A New Imperialist Competitive Algorithm for Multiobjective Low Carbon Parallel Machines Scheduling

被引:20
|
作者
Pan, Zixiao [1 ]
Lei, Deming [1 ]
Zhang, Qingyong [1 ]
机构
[1] Wuhan Univ Technol, Sch Automat, Wuhan 430070, Hubei, Peoples R China
关键词
FLOW SHOPS; METAHEURISTICS; OPTIMIZATION; NETWORK; SEARCH; ENERGY; TIMES;
D O I
10.1155/2018/5914360
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper considers low carbon parallelmachines scheduling problem (PMSP), in which total tardiness is regarded as key objective and total energy consumption is a non-key one. A lexicographical method is used to compare solutions and a novel imperialist competitive algorithm (ICA) is presented, in which a new strategy for initial empires is adopted. Some new improvements are also added in ICA to obtain high quality solutions, which are adaptive assimilation, adaptive revolution, imperialist innovation, and alliance and the novel way of imperialist competition. Extensive experiments are conducted to test the search performance of ICA by comparing it with methods from literature. Computational results show the promising advantages of ICA on low carbon PMSP.
引用
收藏
页数:13
相关论文
共 50 条
  • [41] Arrival sequencing and scheduling based on multi-objective Imperialist competitive algorithm
    Zhang, Junfeng
    You, Lubao
    Yang, Chunwei
    Hu, Rong
    Hangkong Xuebao/Acta Aeronautica et Astronautica Sinica, 2021, 42 (06):
  • [42] Competitive Project Scheduling on Two Unbounded Parallel Batch Machines
    Lu L.-F.
    Zhang L.-Q.
    Journal of the Operations Research Society of China, 2018, 6 (3) : 473 - 483
  • [43] A novel chaotic imperialist competitive algorithm for production and air transportation scheduling problems
    Mortazavi, A.
    Khamseh, A. Arshadi
    Naderi, B.
    NEURAL COMPUTING & APPLICATIONS, 2015, 26 (07): : 1709 - 1723
  • [44] A novel chaotic imperialist competitive algorithm for production and air transportation scheduling problems
    A. Mortazavi
    A. Arshadi Khamseh
    B. Naderi
    Neural Computing and Applications, 2015, 26 : 1709 - 1723
  • [45] The economic lot scheduling problem with deteriorating items and shortage: an imperialist competitive algorithm
    Kayvanfar, V.
    Zandieh, M.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 62 (5-8): : 759 - 773
  • [46] A novel imperialist competitive algorithm for fuzzy distributed assembly flow shop scheduling
    Li, Ming
    Su, Bin
    Lei, Deming
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 40 (03) : 4545 - 4561
  • [47] Scheduling the Parallel Execution of Workflows in Cloud Computing Based on the Imperialist Competitive and Genetic Algorithms
    Paridar, Farzad
    Majma, Mohammadreza
    Maeen, Mehrdad
    PROCEEDINGS OF 2018 2ND INTERNATIONAL CONFERENCE ON CLOUD AND BIG DATA COMPUTING (ICCBDC 2018), 2018, : 16 - 21
  • [48] A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates
    Tang, Lixin
    Zhang, Yanyan
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2011, 42 (07) : 1133 - 1141
  • [49] A New Method for Clustering Based on Development of Imperialist Competitive Algorithm
    Zadeh, Mohammad Reza Dehghani
    Fathian, Mohammad
    Gholamian, Mohammad Reza
    CHINA COMMUNICATIONS, 2014, 11 (12) : 54 - 61
  • [50] New Imperialist Competitive Algorithm to solve the travelling salesman problem
    Yousefikhoshbakht, Majid
    Sedighpour, Mohammad
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2013, 90 (07) : 1495 - 1505