A memetic algorithm for the Multi Trip Vehicle Routing Problem

Diego Cattaruzza, Nabil Absi, Dominique Feillet and Thibaut Vidal

European Journal of Operational Research, 2014, vol. 236, issue 3, 833-848

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 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (34)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221713005006
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:236:y:2014:i:3:p:833-848

DOI: 10.1016/j.ejor.2013.06.012

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().