A two-phase metaheuristic for the cumulative capacitated vehicle routing problem

Authors:
Liangjun Ke;Zuren Feng
Affiliations:
State Key Laboratory for Manufacturing Systems Engineering, Xi'an Jiaotong University, Xi'an, China;State Key Laboratory for Manufacturing Systems Engineering, Xi'an Jiaotong University, Xi'an, China
Venue:
Computers and Operations Research
Year:
2013

Citing 6
Cited 0

The delivery man problem and cumulative matroids

Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Routing for Relief Efforts

Transportation Science
An effective memetic algorithm for the cumulative capacitated vehicle routing problem

Computers and Operations Research
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The cumulative capacitated vehicle routing problem, which aims to minimize the total arrival time at customers, is a relatively new variant of vehicle routing problem. It can be used to model many real-world applications, e.g., the important application arisen from the humanitarian aid after a natural disaster. In this paper, an approach, called two-phase metaheuristic, is proposed to deal with this problem. This algorithm starts from a solution. At each iteration, two interdependent phases use different perturbation and local search operators for solution improvement. The effectiveness of the proposed algorithm is empirically investigated. The comparison results show that the proposed algorithm is promising. Moreover, for nine benchmark instances, the two-phase metaheuristic can find better solutions than those reported in the previous literature.