Artificial bee colony algorithm with variable neighborhood search and path relinking for two-echelon location-routing problem

被引:0
|
作者
Chen, Jiu-Mei [1 ,2 ]
Zeng, Bo [1 ,2 ]
机构
[1] Chongqing Key Laboratory of Electronic Commerce and Supply Chain System, Chongqing Technology and Business University, Chongqing 400067, China
[2] Department of Strategical Planning, Chongqing Technology and Business University, Chongqing 400067, China
关键词
Location - Evolutionary algorithms - Mathematical transformations - Routing algorithms;
D O I
10.13196/j.cims.2014.05.chenjiumei.1228.9.20140526
中图分类号
学科分类号
摘要
To adapt the transformation of logistics demand from few varieties with large batch to many varieties with small batch, a mathematical model of two-echelon location-routing problem was established, and the artificial bee colony algorithm with variable neighborhood search and path relinking was put forward to solve this model. LINGO was used to solve small scale two-echelon location-routing problem. Basic artificial bee colony algorithm, artificial bee colony algorithm with path relinking, artificial bee colony algorithm with variable neighborhood search, artificial bee colony algorithm with path relinking and variable neighborhood search were applied to solve three groups of larger scale two-echelon location-routing problem separately. The results showed that the proposed mathematical model was correct, and the proposed algorithm not only had better optimization results, but also had better convergence.
引用
收藏
页码:1228 / 1236
相关论文
共 50 条
  • [1] A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem
    Viet-Phuong Nguyen
    Prins, Christian
    Prodhon, Caroline
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2012, 25 (01) : 56 - 71
  • [2] Adaptive Large Neighborhood Search Algorithm for Two-Echelon Location-Routing Problem with Different Service Modes
    Yang, Yifu
    Sun, Bing
    Ma, Yanfang
    Cheng, Cong
    Feng, Cuiying
    Computer Engineering and Applications, 59 (03): : 282 - 292
  • [3] A two-echelon location-routing problem with synchronisation
    Mirhedayatian, Seyed Mostafa
    Crainic, Teodor Gabriel
    Guajardo, Mario
    Wallace, Stein W.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2021, 72 (01) : 145 - 160
  • [4] A variable neighborhood search with path-relinking for the capacitated location routing problem
    Yu, Vincent F.
    Maghfiroh, Meilinda F. N.
    JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2014, 31 (03) : 163 - 176
  • [5] An exact algorithm for Two-Echelon Location-Routing problem with simultaneous pickup and delivery
    Yildiz, Ece Arzu
    Karaoglan, Ismail
    Altiparmak, Fulya
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 231
  • [6] Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
    Viet-Phuong Nguyen
    Prins, Christian
    Prodhon, Caroline
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 216 (01) : 113 - 126
  • [7] A two-echelon location-routing problem for biomass logistics systems
    Cao, Jin Xin
    Wang, Xiangting
    Gao, Jiachen
    BIOSYSTEMS ENGINEERING, 2021, 202 (202) : 106 - 118
  • [8] A novel multi-objective artificial bee colony algorithm for solving the two-echelon load-dependent location-routing problem with pick-up and delivery
    Tan, Dekun
    Liu, Xuhui
    Zhou, Ruchun
    Fu, Xuefeng
    Li, Zhenzhen
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2025, 139
  • [9] Simulated annealing with large-neighborhood search for two-echelon location routing problem
    Li X.
    Li S.-J.
    Li H.
    Gongcheng Kexue Xuebao/Chinese Journal of Engineering, 2017, 39 (06): : 953 - 961
  • [10] Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows
    Akbay, Mehmet Anil
    Kalayci, Can Berk
    Blum, Christian
    Polat, Olcay
    APPLIED SCIENCES-BASEL, 2022, 12 (03):