Vehicle selection for a multi-compartment vehicle routing problem

被引:62
作者
Ostermeier, Manuel [1 ]
Huebner, Alexander [2 ]
机构
[1] Catholic Univ Eichstlitt Ingolstadt, Supply Chain Management & Operat, Schanz 49, D-85049 Ingolstadt, Germany
[2] European Business Sch, Inst Supply Chain Management, Burgrstr 5, D-65375 Oestrich Winkel, Germany
关键词
Food retailing; Multi-temperature logistics; Vehicle routing; Large neighborhood search; Multi- vs. single- commodity distribution; MEMETIC ALGORITHM; RETAIL LOGISTICS; DELIVERY PROBLEM; TABU SEARCH; COLLECTION;
D O I
10.1016/j.ejor.2018.01.059
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper addresses the vehicle routing and selection problem of single and multi-compartment vehicles for grocery distribution. Retailers used to rely on single-compartment vehicles (SCV), and transported only one temperature-specific product segment with this vehicle type. Retailers now have the option of using multi-compartment vehicles (MCV) due to technological advances. Products requiring differing temperature zones can be transported jointly as the loading area is split into separate compartments. Both vehicle types cause different costs for loading, transportation and unloading. In literature either the use of SCVs or MCVs has been considered without a distinction between vehicle-dependent costs and the use of both vehicle types in the fleet to achieve a cost-optimal fleet mix. We therefore identify vehicle-dependent costs within empirical data collection and present an extended multi-compartment vehicle routing problem (MCVRP) for the vehicle selection. We solve the problem with a Large Neighborhood Search. Our numerical experiments are based on the insights we draw from a real-life case with a retailer. In further experiments we show that the mixed fleet is always better than an exclusive fleet of SCVs or MCVs and state which factors influence the cost reduction. A mixed fleet can reduce costs by up to 30%. As a result, mixed fleets are advisable in grocery distribution and vehicle selection should be part of the MCVRP. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:682 / 694
页数:13
相关论文
共 40 条
[1]  
[Anonymous], 2012, AKZENTE-Z LIT
[2]   Multicommodity vs. Single-Commodity Routing [J].
Archetti, Claudia ;
Campbell, Ann Melissa ;
Speranza, M. Grazia .
TRANSPORTATION SCIENCE, 2016, 50 (02) :461-472
[3]   Solving a fuel delivery problem by heuristic and exact approaches [J].
Avella, P ;
Boccia, M ;
Sforza, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 152 (01) :170-179
[4]  
Baldacci R, 2008, OPER RES COMPUT SCI, V43, P3, DOI 10.1007/978-0-387-77778-8_1
[5]   REAL-TIME DISPATCH OF PETROLEUM TANK TRUCKS [J].
BROWN, GG ;
GRAVES, GW .
MANAGEMENT SCIENCE, 1981, 27 (01) :19-32
[6]   A Milk Collection Problem with Incompatibility Constraints [J].
Caramia, Massimiliano ;
Guerriero, Francesca .
INTERFACES, 2010, 40 (02) :130-143
[7]   Scheduling deliveries in vehicles with multiple compartments [J].
Chajakis, ED ;
Guignard, M .
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 26 (01) :43-78
[8]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[9]   Classification, models and exact algorithms for multi-compartment delivery problems [J].
Coelho, Leandro C. ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 242 (03) :854-864
[10]   A heuristic for the multi-periodpetrol station replenishment problem [J].
Cornillier, Fabien ;
Boctor, Fayez F. ;
Laporte, Gilbert ;
Renaud, Jacques .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (02) :295-305