Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

A memetic algorithm for the vehicle routing problem with time windows

Nacima LabadiChristian PrinsMohamed Reghioui — 2008

RAIRO - Operations Research

This article deals with the vehicle routing problem with time windows (VRPTW). This problem consists in determining a least-cost set of trips to serve customers during specific time windows. The proposed solution method is a memetic algorithm (MA), a genetic algorithm hybridised with a local search. Contrary to most papers on the VRPTW, which minimize first the number of vehicles, our method is also able to minimize the total distance travelled. The results on 56 classical instances are compared...

Page 1

Download Results (CSV)