|
|||||
|
|
A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem |
|
| Authors: | Anand Subramanian Puca Huachi Vaz Penna Eduardo Uchoa Luiz Satoru Ochi |
| Affiliation: | 1. Universidade Federal da Paraíba, Departamento de Engenharia de Produção, Centro de Tecnologia, Bloco G, Cidade Universitária, João Pessoa-PB 58051-970, Brazil;2. Universidade Federal Fluminense, Instituto de Computação, Rua Passo da Pátria 156, Bloco E, 3° andar, São Domingos, Niterói-RJ 24210-240, Brazil;3. Universidade Federal Fluminense, Departamento de Engenharia de Produção, Rua Passo da Pátria 156, Bloco E, 4° andar, São Domingos, Niterói-RJ 24210-240, Brazil;4. Universidade Federal Fluminense, Instituto do Noroeste Fluminense de Educação Superior, Rua João Jazbik s/n, Santo Antônio de Pádua-RJ 28470-000, Brazil |
| Abstract: | 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. |
| Keywords: | Routing Heterogeneous fleet Matheuristics Iterated Local Search Set Partitioning |
| 本文献已被 ScienceDirect 等数据库收录！ | |