A novel chaotic imperialist competitive algorithm for production and air transportation scheduling problems

被引：21
|
作者：
Mortazavi, A. [1 ]
Khamseh, A. Arshadi [1 ]
Naderi, B. [1 ]
机构：
[1] Kharazmi Univ, Fac Engn, Dept Ind Engn, Tehran, Iran
来源：
NEURAL COMPUTING & APPLICATIONS | 2015年 / 26卷 / 07期
关键词：
Supply chain coordination; Air transportation; Imperialist competitive algorithm; Chaos theory; Taguchi experimental design; SUPPLY CHAIN PERFORMANCE; SEQUENCE-DEPENDENT SETUP; GENETIC ALGORITHM; TARDINESS; DELIVERY; IMPACT; COSTS;
D O I：
10.1007/s00521-015-1828-9
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Although production and transportation scheduling problems are of two essential issues in supply chain management, they are rarely integrated. In this paper, we study the problem of production and transportation scheduling to minimize total cost of supply chain. The problem is mathematically modeled. Moreover, a novel metaheuristic based on an imperialist competitive algorithm is developed for solving the problem. The proposed algorithm is enriched by a chaotic map and two new operators to avoid from local optima. To tune the parameters, Taguchi experimental design is applied. For evaluation of the proposed algorithm, it is compared with an available genetic algorithm. Finally, using numerical experiments, the outperformance of the proposed algorithm is shown in both solution quality and performance robustness.
引用
收藏
页码：1709 / 1723
页数：15
相关论文
共 50 条
  • [1] A novel chaotic imperialist competitive algorithm for production and air transportation scheduling problems
    A. Mortazavi
    A. Arshadi Khamseh
    B. Naderi
    [J]. Neural Computing and Applications, 2015, 26 : 1709 - 1723
  • [2] An Imperialist Competitive Algorithm for the Job Shop Scheduling Problems
    Piroozfard, H.
    Wong, K. Y.
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, : 69 - 73
  • [3] A novel imperialist competitive algorithm for generalized traveling salesman problems
    Ardalan, Zaniar
    Karimi, Sajad
    Poursabzi, Omid
    Naderi, B.
    [J]. APPLIED SOFT COMPUTING, 2015, 26 : 546 - 555
  • [4] An imperialist competitive algorithm for distributed assembly flowshop scheduling with Pm→ 1 layout and transportation
    Lei, Deming
    Du, Haoyang
    Tang, Hongtao
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 45 (01) : 269 - 284
  • [5] Novel imperialist competitive algorithm for distributed parallel machine scheduling problem
    Zhang Q.
    Wang H.
    Lei D.
    [J]. Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2019, 47 (08): : 86 - 91
  • [6] Template matching using chaotic imperialist competitive algorithm
    Duan, Haibin
    Xu, Chunfang
    Liu, Senqi
    Shao, Shan
    [J]. PATTERN RECOGNITION LETTERS, 2010, 31 (13) : 1868 - 1875
  • [7] A novel imperialist competitive algorithm for fuzzy distributed assembly flow shop scheduling
    Li, Ming
    Su, Bin
    Lei, Deming
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 40 (03) : 4545 - 4561
  • [8] Production Scheduling in Flexible Job Shop Scheduling Using an Imperialist Competitive Algorithm (ICA) Minimizing Makespan
    Beltran Ricaurte, I. I. Brian
    Londono Restrepo, Maria Isabel
    [J]. 2015 10TH COMPUTING COLOMBIAN CONFERENCE (10CCC), 2015, : 378 - 386
  • [9] Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm
    Karimi, Sajad
    Ardalan, Zaniar
    Naderi, B.
    Mohammadi, M.
    [J]. APPLIED MATHEMATICAL MODELLING, 2017, 41 : 667 - 682
  • [10] Chaotic imperialist competitive algorithm for optimum design of truss structures
    Talatahari, Siamak
    Kaveh, Ali
    Sheikholeslami, Razi
    [J]. STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2012, 46 (03) : 355 - 367
12345