![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Yun-Chia Liang
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j18]Wei-Chang Yeh
, Yi-Ping Lin, Yun-Chia Liang
, Chyh-Ming Lai
, Chia-Ling Huang
:
Simplified swarm optimization for hyperparameters of convolutional neural networks. Comput. Ind. Eng. 177: 109076 (2023) - [c26]Jerry Chen, Jiann-Shing Shieh, Chi-Yuan Lee, Chuan-Jun Su, Yun-Chia Liang, Tien-Lung Sun:
Autonomous System with Cyber-Physical Integrating Features on Public Utility of Chemical Fiber Factory. HCI (46) 2023: 454-460 - 2021
- [i1]Wei-Chang Yeh, Yi-Ping Lin, Yun-Chia Liang, Chyh-Ming Lai:
Convolution Neural Network Hyperparameter Optimization Using Simplified Swarm Optimization. CoRR abs/2103.03995 (2021) - 2020
- [j17]Yun-Chia Liang, Josue Rodolfo Cuevas Juarez:
A self-adaptive virus optimization algorithm for continuous optimization problems. Soft Comput. 24(17): 13147-13166 (2020)
2010 – 2019
- 2017
- [c25]Angela Hsiang-Ling Chen, Yun-Chia Liang, Jose David Padilla:
Using discrete Differential Evolution and entropy to solve the MRCPSP. CEC 2017: 2437-2442 - 2016
- [j16]Angela Hsiang-Ling Chen, Yun-Chia Liang, Jose David Padilla:
A Practical and Robust Execution Time-Frame Procedure for the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags. Algorithms 9(4): 63 (2016) - [c24]Yun-Chia Liang, Josue Rodolfo Cuevas Juarez:
Harmony search and virus optimization algorithm for multi-objective combined economic energy dispatching problems. CEC 2016: 3947-3954 - 2014
- [j15]Angela Hsiang-Ling Chen, Yun-Chia Liang, Jose David Padilla:
An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules. Entropy 16(9): 5032-5067 (2014) - [c23]Yun-Chia Liang, Angela Hsiang-Ling Chen, Yung-Hsiang Nien:
Artificial Bee Colony for workflow scheduling. IEEE Congress on Evolutionary Computation 2014: 558-564 - 2013
- [j14]Yun-Chia Liang, Josue R. Cuevas J.:
An Automatic Multilevel Image Thresholding Using Relative Entropy and Meta-Heuristic Algorithms. Entropy 15(6): 2181-2209 (2013) - [c22]Angela Hsiang-Ling Chen, Yun-Chia Liang, Chia-Chien Liu:
Portfolio optimization using improved artificial bee colony approach. CIFEr 2013: 60-67 - 2012
- [j13]Vincent C. Li
, Yun-Chia Liang, Huan-Fu Chang:
Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method. Comput. Oper. Res. 39(9): 2111-2121 (2012) - [j12]Yun-Chia Liang, Zu-Hsu Lee, Yu-Shen Chen:
A novel ant colony optimization approach for on-line scheduling and due date determination. J. Heuristics 18(4): 571-591 (2012) - [c21]Angela Hsiang-Ling Chen, Yun-Chia Liang, Chia-Chien Liu:
An artificial bee colony algorithm for the cardinality-constrained portfolio optimization problems. IEEE Congress on Evolutionary Computation 2012: 1-8 - [c20]Yun-Chia Liang, Josue R. Cuevas J.:
Multilevel image thresholding using relative entropy and Virus Optimization Algorithm. IEEE Congress on Evolutionary Computation 2012: 1-8 - 2011
- [j11]Yun-Chia Liang, Nan Fang:
Supplier Productivity and Quality Performance Evaluation in the TFT-LCD Industry. Asia Pac. J. Oper. Res. 28(6): 787-802 (2011) - [c19]Yun-Chia Liang, Chia-Yun Tien:
Variable Neighborhood Search for Drilling Operation Scheduling in PCB Industries. ICIC (1) 2011: 55-62 - 2010
- [j10]Junqing Li, Quan-Ke Pan
, Yun-Chia Liang:
An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 59(4): 647-662 (2010) - [j9]Yun-Chia Liang, Min-Hua Lo:
Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm. J. Heuristics 16(3): 511-535 (2010) - [j8]Alice E. Smith
, David W. Coit, Yun-Chia Liang:
Neural Network Models to Anticipate Failures of Airport Ground Transportation Vehicle Doors. IEEE Trans Autom. Sci. Eng. 7(1): 183-188 (2010) - [c18]Quan-Ke Pan, Mehmet Fatih Tasgetiren
, Ponnuthurai Nagaratnam Suganthan, Yun-Chia Liang:
Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm. IEEE Congress on Evolutionary Computation 2010: 1-6
2000 – 2009
- 2009
- [j7]Mehmet Fatih Tasgetiren
, Quan-Ke Pan
, Yun-Chia Liang:
A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Comput. Oper. Res. 36(6): 1900-1915 (2009) - [c17]Mehmet Fatih Tasgetiren
, Quan-Ke Pan, Ponnuthurai N. Suganthan, Yun-Chia Liang:
A differential evolution algorithm with variable parameter search for real-parameter continuous function optimization. IEEE Congress on Evolutionary Computation 2009: 1247-1254 - 2008
- [j6]Quan-Ke Pan
, Mehmet Fatih Tasgetiren
, Yun-Chia Liang:
A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput. Ind. Eng. 55(4): 795-816 (2008) - [j5]Quan-Ke Pan
, Mehmet Fatih Tasgetiren
, Yun-Chia Liang:
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput. Oper. Res. 35(9): 2807-2839 (2008) - [c16]Mehmet Fatih Tasgetiren
, Quan-Ke Pan, Yun-Chia Liang:
A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times. IEEE Congress on Evolutionary Computation 2008: 2613-2620 - [c15]Quan-Ke Pan, Mehmet Fatih Tasgetiren
, Yun-Chia Liang, Ponnuthurai N. Suganthan:
Upper bounds on Taillard's benchmark suite for the no-wait flowshop scheduling problem with makespan criterion. IEEE Congress on Evolutionary Computation 2008: 2955-2961 - 2007
- [j4]Mehmet Fatih Tasgetiren
, Yun-Chia Liang, Mehmet Sevkli, Günes Gençyilmaz:
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur. J. Oper. Res. 177(3): 1930-1947 (2007) - [j3]Yun-Chia Liang, Yi-Ching Chen:
Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm. Reliab. Eng. Syst. Saf. 92(3): 323-331 (2007) - [c14]Mehmet Fatih Tasgetiren
, Ponnuthurai N. Suganthan
, Quan-Ke Pan, Yun-Chia Liang:
A genetic algorithm for the generalized traveling salesman problem. IEEE Congress on Evolutionary Computation 2007: 2382-2389 - [c13]Mehmet Fatih Tasgetiren
, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan
, Yun-Chia Liang:
A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion. CISched 2007: 251-258 - [c12]Mehmet Fatih Tasgetiren
, Quan-Ke Pan, Yun-Chia Liang, Ponnuthurai Nagaratnam Suganthan
:
A Discrete Differential Evolution Algorithm for the Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine. CISched 2007: 271-278 - [c11]Quan-Ke Pan, Mehmet Fatih Tasgetiren
, Yun-Chia Liang:
A discrete differential evolution algorithm for the permutation flowshop scheduling problem. GECCO 2007: 126-133 - [c10]Yun-Chia Liang, Yueh-Chuan Yin, Angela Hsiang-Ling Chen:
Multilevel Thresholding Using Ant Colony Optimization. IMECS 2007: 1848-1853 - [c9]Nan Fang, Yun-Chia Liang, Shinn Sun:
A New Development Model: SBM-Additive Context-Dependent Data Envelopment Analysis. IMECS 2007: 2279-2284 - 2006
- [j2]Shu-Kai S. Fan, Yun-Chia Liang, Erwie Zahara:
A genetic algorithm and a particle swarm optimizer hybridized with Nelder-Mead simplex search. Comput. Ind. Eng. 50(4): 401-425 (2006) - [c8]Quan-Ke Pan, Mehmet Fatih Tasgetiren
, Yun-Chia Liang:
Minimizing Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine Using a Discrete Particle Swarm Optimization Algorithm. ANTS Workshop 2006: 460-467 - [c7]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A Discrete Particle Swarm Optimization Algorithm for Single Machine Total Earliness and Tardiness Problem with a Common Due Date. IEEE Congress on Evolutionary Computation 2006: 3281-3288 - [c6]Yun-Chia Liang, Angela Hsiang-Ling Chen, Chiuh-Cheng Chyu:
Application of a Hybrid Ant Colony Optimization for the Multilevel Thresholding in Image Processing. ICONIP (2) 2006: 1183-1192 - [c5]Quan-Ke Pan, Mehmet Fatih Tasgetiren
, Yun-Chia Liang:
A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan Criterion. SGAI Conf. 2006: 19-31 - 2004
- [j1]Yun-Chia Liang, Alice E. Smith
:
An ant colony optimization algorithm for the redundancy allocation problem (RAP). IEEE Trans. Reliab. 53(3): 417-423 (2004) - [c4]Mehmet Fatih Tasgetiren
, Mehmet Sevkli, Yun-Chia Liang, Günes Gençyilmaz:
Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem. ANTS Workshop 2004: 382-389 - [c3]Mehmet Fatih Tasgetiren, Mehmet Sevkli, Yun-Chia Liang, Günes Gençyilmaz:
Particle swarm optimization algorithm for single machine total weighted tardiness problem. IEEE Congress on Evolutionary Computation 2004: 1412-1419 - 2002
- [c2]Yun-Chia Liang, Sadan Kulturel-Konak, Alice E. Smith
:
Meta heuristics for the orienteering problem. IEEE Congress on Evolutionary Computation 2002: 384-389
1990 – 1999
- 1999
- [c1]Yun-Chia Liang, Alice E. Smith
:
An ant system approach to redundancy allocation. CEC 1999: 1478-1486
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint