A two-phase hybrid metaheuristic for the vehicle routing problem with time windows |
| |
| Institution: | 1. Deutsche Post Chair of Optimization of Distribution Networks, RWTH Aachen University, Aachen, Germany;2. Dipartimento di Ingegneria dell’Energia Elettrica e dell’Informazione, University of Bologna, Bologna, Italy;3. Denkungsart GmbH;1. Department of Industrial Engineering & Management, Shanghai Jiao Tong University, 800 Dongchuan Road, 200240 Shanghai, China;2. Department of Industrial Engineering, Tsinghua University, Beijing, China;1. Universidade Federal Fluminense - Departamento de Engenharia de Produção, Rua Passo da Pátria 156, Niterói, RJ 24210-240, Brasil;2. INRIA Bordeaux – Sud-Ouest, 200 Avenue de la Veille Tour, Talence 33405, France |
| |
| Abstract: | The subject of this paper is a two-phase hybrid metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The objective function of the VRPTW considered here combines the minimization of the number of vehicles (primary criterion) and the total travel distance (secondary criterion). The aim of the first phase is the minimization of the number of vehicles by means of a (μ,λ)-evolution strategy, whereas in the second phase the total distance is minimized using a tabu search algorithm. The two-phase hybrid metaheuristic was subjected to a comparative test on the basis of 356 problems from the literature with sizes varying from 100 to 1000 customers. The derived results show that the proposed two-phase approach is very competitive. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
