The close–open mixed vehicle routing problem

► A new problem in the VRPs, Close–Open Mixed Vehicle Routing Problem, is proposed. ► A mixed integer programming (MIP) model is built for this problem. ► An effective memetic algorithm is established for solving the problem. ► Experiments show that the proposed method is satisfied, and dominates CP...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research 2012-07, Vol.220 (2), p.349-360
Hauptverfasser: Liu, Ran, Jiang, Zhibin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:► A new problem in the VRPs, Close–Open Mixed Vehicle Routing Problem, is proposed. ► A mixed integer programming (MIP) model is built for this problem. ► An effective memetic algorithm is established for solving the problem. ► Experiments show that the proposed method is satisfied, and dominates CPLEX solver. 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.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2012.01.061