|
|||||
|
|
A memetic algorithm for the Multi Trip Vehicle Routing Problem |
|
| Authors: | Diego Cattaruzza Nabil Absi Dominique Feillet Thibaut Vidal |
| Affiliation: | 1. Ecole des Mines de Saint-Etienne, CMP Georges Charpak, F. 13541 Gardanne, France;2. CIRRELT, Département d’informatique et de recherche opérationnelle, Université de Montréal, Montréal H3C 3J7, Canada;3. Institut Charles Delaunay, Université de Technologie de Troyes, 10010 Troyes, France |
| Abstract: | We consider the Multi Trip Vehicle Routing Problem, in which a set of geographically scattered customers have to be served by a fleet of vehicles. Each vehicle can perform several trips during the working day. The objective is to minimize the total travel time while respecting temporal and capacity constraints. |
| Keywords: | Multi Trip Vehicle Routing Problem Memetic algorithm City logistics |
| 本文献已被 ScienceDirect 等数据库收录！ | |