default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAngela Hsiang-Ling Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Angela Hsiang-Ling Chen
, Kuangnen Cheng, Wan-Ju Chang:
Unravelling commuters' modal splitting behaviour in mass transportation service operation. Public Transp. 15(3): 813-838 (2023)
2010 – 2019
- 2017
- [c10]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
- [j5]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) - [c9]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yucel Ozturkoglu, Angela Hsiang-Ling Chen:
A memetic algorithm with a variable block insertion heuristic for single machine total weighted tardiness problem with sequence dependent setup times. CEC 2016: 2911-2918 - 2014
- [j4]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) - [c8]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
- [c7]Angela Hsiang-Ling Chen, Yun-Chia Liang, Chia-Chien Liu:
Portfolio optimization using improved artificial bee colony approach. CIFEr 2013: 60-67 - 2012
- [c6]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 - 2011
- [j3]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, Angela Hsiang-Ling Chen:
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf. Sci. 181(16): 3459-3475 (2011) - [c5]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ling Wang, Angela Hsiang-Ling Chen:
A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion. ICIC (2) 2011: 83-90 - 2010
- [j2]Angela Hsiang-Ling Chen, Chiuh-Cheng Chyu:
Applying Memetic Algorithm in Multi-Objective Resource Allocation among Competing Projects. J. Softw. 5(8): 802-809 (2010) - [j1]Angela Hsiang-Ling Chen, Chiuh-Cheng Chyu:
Economic optimization of resource-constrained project scheduling: a two-phase metaheuristic approach. J. Zhejiang Univ. Sci. C 11(6): 481-494 (2010) - [c4]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, Angela Hsiang-Ling Chen:
A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2008
- [c3]Angela Hsiang-Ling Chen, Chiuh-Cheng Chyu:
A memetic algorithm for maximizing net present value in resource-constrained project scheduling problem. IEEE Congress on Evolutionary Computation 2008: 2396-2403 - 2007
- [c2]Yun-Chia Liang, Yueh-Chuan Yin, Angela Hsiang-Ling Chen:
Multilevel Thresholding Using Ant Colony Optimization. IMECS 2007: 1848-1853 - 2006
- [c1]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
Coauthor Index
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-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
