Industrial Engineering Journal

Industrial Engineering Journal ›› 2019, Vol. 22 ›› Issue (6): 67-73.doi: 10.3969/j.issn.1007-7375.2019.06.009

• articles • Previous Articles     Next Articles

A Capacitated Vehicle Routing Problem with Split Deliveries by Backpack

LU Juan1, XIA Yangkun2, ZOU Anquan3, FU Zhuo4, WANG Song5, WEI Zhanguo2, FU Ying2   

  1. 1. Management Engineering Department, Hunan Vocational College of Engineering, Changsha 410151, China;
    2. School of Logistics and Transportation, Central South University of Forestry and Technology, Changsha 410004, China;
    3. School of Business and Law, Foshan University, Foshan 528000, China;
    4. School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China;
    5. College of Business Administration, Hunan University of Commerce, Changsha 410205, China
  • Received:2019-02-21 Published:2019-12-24

RichHTML

14

PDF

5746

Abstract: Taking the shortest total travel time as the optimization object, a model of single objective programming is constructed, which contains a series of constraints, such as single depot, single vehicle type, loading capacity limitation, split deliveries by backpack and so on. An adaptive tabu search algorithm (ATSA) is designed to solve the problem. The ATSA uses a series of optimization strategies to improve the search ability, such as an adaptive penalty mechanism and a multi-neighborhood structure, and designs corresponding neighborhood operators for both customer points and backpack, which can better adapt to the discrete splitting degree of customer demands. The validity of the proposed model and algorithm is demonstrated by the comparison of the test results with the literature.

Key words: vehicle routing problem, split, split deliveries by backpack, tabu search algorithm, logistics

CLC Number: