A Hybrid Algorithm for the Fleet Size and Mix Vehicle Routing Problem

被引：0

作者：

Subramanian, Anand ^{[1
]}

Vaz Penna, Puca Huachi ^{[2
]}

Uchoa, Eduardo ^{[3
]}

Ochi, Luiz Satoru ^{[1
]}

机构：

[1] Univ Fed Fluminense, Inst Comp, Rua Passo da Patria 156,Bloco E,3 Andar, BR-24210240 Niteroi, RJ, Brazil

[2] Univ Fed Fluminense, Inst Noroeste Flumiense Educ Super, BR-28470970 Santo Antonio De Padua, RJ, Brazil

[3] Univ Fed Fluminense, Dept Engn Prod, BR-24210240 Niteroi, RJ, Brazil

来源：

PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT | 2011年

关键词：

Fleet Size and Mix; Vehicle Routing Problem; Matheuristics; Iterated Local Search; Set Partitioning; TABU SEARCH; EVOLUTIONARY ALGORITHM;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper deals with the Fleet Size and Mix (FSM) Vehicle Routing Problem. The FSM generalizes the classical Vehicle Routing Problem (VRP) by allowing the existence of an unlimited heterogeneous fleet of vehicles. Each type of vehicle is associated with a distance-dependent and/or fixed cost. The objective is to determine the best fleet composition as well as the set of routes that minimize the travel costs. The proposed hybrid algorithm is composed by an Iterated Local Search (ILS) based heuristic and a Set Partitioning (SP) formulation. The SP model is solved by means of a Mixed Integer Programming (MIP) solver that interactively calls the ILS heuristic during its execution. The developed algorithm was tested on benchmark instances involving up to 100 customers. The results obtained are highly competitive since the hybrid approach was always capable to find or improve the best known solutions reported in the literature.

引用

页码：1214 / 1223

页数：10

共 50 条

[21] Scatter search for the fleet size and mix vehicle routing problem with time windows
Belfiore, Patricia Prado
Lopes Favero, Luiz Paulo
[J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2007, 15 (04) : 351 - 368
[22] Valid Inequalities for the Fleet Size and Mix Vehicle Routing Problem with Fixed Costs
Baldacci, Roberto
Battarra, Maria
Vigo, Daniele
[J]. NETWORKS, 2009, 54 (04) : 178 - 189
[23] Application of a variable neighborhood search algorithm to a fleet size and mix vehicle routing problem with electric modular vehicles
Rezgui, Dhekra
Siala, Jouhaina Chaouachi
Aggoune-Mtalaa, Wassila
Bouziri, Hend
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 130 : 537 - 550
[24] A hybrid simulated annealing algorithm for the heterogeneous fleet vehicle routing problem
Lima, C. M. R.
Goldbarg, M. C.
Goldbarg, E. F. G.
[J]. Computational Methods, Pts 1 and 2, 2006, : 881 - 892
[25] Step cost functions in a fleet size and mix vehicle routing problem with time windows
João L. V. Manguino
Débora P. Ronconi
[J]. Annals of Operations Research, 2022, 316 : 1013 - 1038
[26] A hybrid metaheuristic algorithm for the green vehicle routing problem with a heterogeneous fleet
Ene, Seval
Kucukoglu, Ilker
Aksoy, Asli
Ozturk, Nursel
[J]. INTERNATIONAL JOURNAL OF VEHICLE DESIGN, 2016, 71 (1-4) : 75 - 102
[27] The Multi-period Fleet Size and Mix Vehicle Routing Problem with Stochastic Demands
Pasha, Urooj
Hoff, Arild
Hvattum, Lars Magnus
[J]. COMPUTATIONAL METHODS AND MODELS FOR TRANSPORT: NEW CHALLENGES FOR THE GREENING OF TRANSPORT SYSTEMS, 2018, 45 : 121 - 146
[28] The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, Gerhard
Puchinger, Jakob
Ropke, Stefan
Hartl, Richard F.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (03) : 995 - 1018
[29] Step cost functions in a fleet size and mix vehicle routing problem with time windows
Manguino, Joao L. V.
Ronconi, Debora P.
[J]. ANNALS OF OPERATIONS RESEARCH, 2022, 316 (02) : 1013 - 1038
[30] Simple heuristics for the multi-period fleet size and mix vehicle routing problem
Pasha, Urooj
Hoff, Arild
Hvattum, Lars Magnus
[J]. INFOR, 2016, 54 (02) : 97 - 120

← 1 2 3 4 5 →