A Bee Evolutionary Algorithm for Multiobjective Vehicle Routing Problem with Simultaneous Pickup and Delivery

被引:11
|
作者
Gong, Guiliang [1 ]
Deng, Qianwang [1 ]
Gong, Xuran [1 ]
Zhang, Like [1 ]
Wang, Haibin [2 ]
Xie, He [2 ]
机构
[1] Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha 410082, Hunan, Peoples R China
[2] CRRC Zhuzhou Inst Co Ltd, Zhuzhou 412200, Peoples R China
基金
中国国家自然科学基金; 国家高技术研究发展计划(863计划);
关键词
ANT COLONY; SEARCH ALGORITHM; SYSTEM;
D O I
10.1155/2018/2571380
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A new closed-loop supply chain logistics network of vehicle routing problem with simultaneous pickups and deliveries (VRPSPD) dominated by remanufacturer is constructed, in which the customers are originally divided into three types: distributors, recyclers, and suppliers. Furthermore, the fuel consumption is originally added to the optimization objectives of the proposed VRPSPD. In addition, a bee evolutionary algorithm guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) with a two-stage optimization mechanism is originally designed to solve the proposed VRPSPD model with three optimization objectives: minimum fuel consumption, minimum waiting time, and the shortest delivery distance. The proposed BEG-NSGA-II could conquer the disadvantages of traditional nondominated sorting genetic algorithm II (NSGA-II) and algorithms with a two-stage optimization mechanism. Finally the validity and feasibility of the proposed model and algorithm are verified by simulating an engineering machinery remanufacturing company's reverse logistics and another three test examples.
引用
收藏
页数:21
相关论文
共 50 条
  • [41] An Improved Genetic Algorithm for the Granularity-Based Split Vehicle Routing Problem with Simultaneous Delivery and Pickup
    Liu, Yuxin
    Qin, Zihang
    Liu, Jin
    [J]. MATHEMATICS, 2023, 11 (15)
  • [42] A hybrid metaheuristic algorithm based on iterated local search for vehicle routing problem with simultaneous pickup and delivery
    Oztas, Tayfun
    Tus, Aysegul
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 202
  • [43] An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
    Gajpal, Yuvraj
    Abad, Prakash
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (12) : 3215 - 3223
  • [44] A multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
    Tan, KC
    Lee, TH
    Chew, YH
    Lee, LH
    [J]. 2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2003, : 361 - 366
  • [45] Multiobjective Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Customer Satisfaction
    Zhang, Jingling
    Wang, Wanliang
    Zhao, Yanwei
    Cattani, Carlo
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
  • [46] A multiobjective evolutionary algorithm for solving vehicle routing problem with stochastic demand
    Cheong, C. Y.
    Tan, K. C.
    Liu, D. K.
    Xu, J. X.
    [J]. 2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 1355 - +
  • [47] Vehicle Routing Problem with Simultaneous Delivery and Pickup for Cold-chain Logistics
    Ji, Yingfeng
    Yang, Hualong
    Zhou, Yong
    [J]. PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED MATHEMATICS, 2015, 122 : 70 - 74
  • [48] A Study on Green Two Echelon Vehicle Routing Problem with Simultaneous Pickup and Delivery
    Yildiz, Ece Arzu
    Altiparmak, Fulya
    [J]. PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT - VOL 1, 2022, 144 : 778 - 793
  • [49] Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
    Anand Subramanian
    Eduardo Uchoa
    Artur Alves Pessoa
    Luiz Satoru Ochi
    [J]. Optimization Letters, 2013, 7 : 1569 - 1581
  • [50] Optimization of the simultaneous pickup and delivery vehicle routing problem based on carbon tax
    Qin, Gaoyuan
    Tao, Fengming
    Li, Lixia
    Chen, Zhenyu
    [J]. INDUSTRIAL MANAGEMENT & DATA SYSTEMS, 2019, 119 (09) : 2055 - 2071