A Hybrid Algorithm for the Vehicle Routing Problem with Window
Main Article Content
Abstract
The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. The VRPTW benchmark problems of Solomon (1987) have been most commonly chosen to evaluate and compare all exact and heuristic algorithms. A genetic algorithm and a set partitioning two phases approach has obtained competitive results in terms of total travel distance minimization. However, a great number of heuristics has used the number of vehicles as the first objective and travel distance as the second, subject to the first. This paper proposes a three phases approach considering both objectives. Initially, a hierarchical tournament selection genetic algorithm is applied. It can reach all best results in number of vehicles of the 56 Solomon’s problems explored in the literature. After then, the two phase approach, the genetic and the set partitioning, is applied to minimize the travel distance as the second objective.
Article Details
How to Cite
Alvarenga, G. B., Silva, R. M. de A., & Sampaio, R. M. (2004). A Hybrid Algorithm for the Vehicle Routing Problem with Window. INFOCOMP Journal of Computer Science, 4(2), 9–16. Retrieved from https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/87
Section
Articles
Upon receipt of accepted manuscripts, authors will be invited to complete a copyright license to publish the paper. At least the corresponding author must send the copyright form signed for publication. It is a condition of publication that authors grant an exclusive licence to the the INFOCOMP Journal of Computer Science. This ensures that requests from third parties to reproduce articles are handled efficiently and consistently and will also allow the article to be as widely disseminated as possible. In assigning the copyright license, authors may use their own material in other publications and ensure that the INFOCOMP Journal of Computer Science is acknowledged as the original publication place.