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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
