A memetic algorithm for the Multi Trip Vehicle Routing Problem

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.

MoreLess

Year of publication:	2014
Authors:	Cattaruzza, Diego ; Absi, Nabil ; Feillet, Dominique ; Vidal, Thibaut
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 236.2014, 3, p. 833-848
Publisher:	Elsevier
Subject:	Multi Trip Vehicle Routing Problem \| Memetic algorithm \| City logistics

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011097796