Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2018, Article ID 2571380, 21 pages
Research Article

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

1State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body, Hunan University, Changsha 410082, China
2CRRC Zhuzhou Institute Co., Ltd., Zhuzhou 412200, China

Correspondence should be addressed to Qianwang Deng; moc.361@tiebra_gned

Received 15 September 2017; Accepted 19 March 2018; Published 19 June 2018

Academic Editor: Nunzio Salerno

Copyright © 2018 Guiliang Gong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.