The close–open mixed vehicle routing problem

Ran Liu and Zhibin Jiang

European Journal of Operational Research, 2012, vol. 220, issue 2, 349-360

Abstract: We consider the Close–Open Mixed Vehicle Routing Problem (COMVRP) in this paper. The COMVRP differs from the classical vehicle routing problems because simultaneously considering open and close routes in the solution of the problem. The objective of the problem is to minimize the fixed and variable costs for operating the open and close routes. No attention was devoted to this problem. A mix integer programming (MIP) model and an effective metheuristic, i.e., memetic algorithm, are established for the COMVRP. Computational experiments are conducted. The results of experiments show that the proposed metheuristic algorithm is able to produce satisfied solutions within an acceptable running time, and outperforms the robust MIP solver CPLEX.

Keywords: Metaheuristics; Close and open; Vehicle routing; Memetic algorithm (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221712000999
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:220:y:2012:i:2:p:349-360

DOI: 10.1016/j.ejor.2012.01.061

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 ().