期刊
APPLIED SOFT COMPUTING
卷 55, 期 -, 页码 226-237出版社
ELSEVIER
DOI: 10.1016/j.asoc.2017.01.044
关键词
Parallel batch machines; Ant colony optimization algorithm; Makespan; Energy consumption; Green manufacturing
资金
- National Natural Science Foundation [71601001, 71671168]
- Humanity and Social Science Youth Foundation of Ministry of Education of China [15YJC630041]
- Science Foundation of Anhui Province [1608085MG154]
- Natural Science Foundation of Anhui Provincial Education Department [KJ2015A062]
- Foundation of Co-Innovation Center for Information Supply and Assurance Technology of Anhui University [ADXXBZ201509]
- Natural Science Foundation of China [71471052]
We investigate the problem of minimizing the makespan and the total electric power cost simultaneously on a set of parallel identical batch-processing machines, where the jobs with non-identical sizes dynamically arrive. To address the bi-criteria problem, a Pareto-based ant colony optimization (PACO) algorithm is proposed. Depending on whether the current batch being delayed after the job is added into, two candidate lists are constructed to narrow the search space. Moreover, heuristic information is designed for each candidate list to guide the search. In addition, the objective-oriented local optimization methods are applied to improve the solution quality. Finally, the proposed algorithm is compared with existing multi objective algorithms through extensive simulation experiments. The experimental results indicate that the proposed algorithm outperforms all of the compared algorithms, especially for large-scale problems. (c) 2017 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据