A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem

作者：Subramanian Anand^*; Vaz Penna Puca Huachi; Uchoa Eduardo; Ochi Luiz Satoru

来源：European Journal of Operational Research, 2012, 221(2): 285-295.

DOI：10.1016/j.ejor.2012.03.016

• Routing
• Heterogeneous fleet
• Matheuristics
• Iterated Local Search
• Set Partitioning

This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The HFVRP generalizes the classical Capacitated Vehicle Routing Problem by considering the existence of different vehicle types, with distinct capacities and costs. The objective is to determine the best fleet composition as well as the set of routes that minimize the total 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 solver that interactively calls the ILS heuristic during its execution. The developed algorithm was tested in benchmark instances with up to 360 customers. The results obtained are quite competitive with those found in the literature and new improved solutions are reported.

• 出版日期2012-9-1