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 CPLEX solver.