multiobjectiveoptimizationofthedistributedpermutationflowshopschedulingproblemwithtransportationandeligibilityconstraints
文献类型:期刊论文
作者 | Cai Shuang; Yang Ke; Liu Ke |
刊名 | journaloftheoperationsresearchsocietyofchina |
出版日期 | 2018 |
卷号 | 6期号:3页码:391 |
ISSN号 | 2194-668X |
英文摘要 | In this paper, we consider the distributed permutation flow shop scheduling problem (DPFSSP) with transportation and eligibility constrains. Three objectives are taken into account, i.e., makespan, maximum lateness and total costs (transportation costs and setup costs). To the best of our knowledge, there is no published work on multi-objective optimization of the DPFSSP with transportation and eligibility constraints. First, we present themathematics model and constructive heuristics for single objective; then, we propose an improved The Nondominated Sorting Genetic Algorithm II (NSGA-II) for the multi-objective DPFSSP to find Pareto optimal solutions, in which a novel solution representation, a new population re-/initialization, effective crossover and mutation operators, as well as local search methods are developed. Based on extensive computational and statistical experiments, the proposed algorithm performs better than the well-known NSGA-II and the Strength Pareto Evolutionary Algorithm 2 (SPEA2). |
语种 | 英语 |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/43036] |
专题 | 应用数学研究所 |
作者单位 | 中国科学院数学与系统科学研究院 |
推荐引用方式 GB/T 7714 | Cai Shuang,Yang Ke,Liu Ke. multiobjectiveoptimizationofthedistributedpermutationflowshopschedulingproblemwithtransportationandeligibilityconstraints[J]. journaloftheoperationsresearchsocietyofchina,2018,6(3):391. |
APA | Cai Shuang,Yang Ke,&Liu Ke.(2018).multiobjectiveoptimizationofthedistributedpermutationflowshopschedulingproblemwithtransportationandeligibilityconstraints.journaloftheoperationsresearchsocietyofchina,6(3),391. |
MLA | Cai Shuang,et al."multiobjectiveoptimizationofthedistributedpermutationflowshopschedulingproblemwithtransportationandeligibilityconstraints".journaloftheoperationsresearchsocietyofchina 6.3(2018):391. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。