A hybrid two-stage sweep algorithm for capacitated vehicle routing problem

Chen, Menghui; Chang, Pei‐Chann; Chiu, Ching-Ying; Annadurai, Sivachandra Prabhu

doi:10.1109/iccar.2015.7166030

Cited by 5 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CVRP is a VRP with the vehicle capacity constraint [ 16 ]. The total customer demands on each vehicle must be less than its load capacity:

where k = 1, 2, …, m ; m is the number of vehicles; q i is the demand of customer i , and Q is the vehicle capacity.…”

Section: Background Conceptsmentioning

confidence: 99%

“…A Two-stage Sweep Algorithm [ 16 ] is an improved version of SA. In the first stage, customers are clustered by using the original SA.…”

Section: Background Conceptsmentioning

confidence: 99%

“…CVRP is a VRP with the vehicle capacity constraint [16]. The total customer demands on each vehicle must be less than its load capacity:…”

Section: Vrpmentioning

confidence: 99%

“…Chen et al. [ 16 ] used a hybrid of two-stage sweep algorithm and greedy search, for solving CVRP. Sweep algorithm was used to cluster all customers into groups.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Hybrid modified ant system with sweep algorithm and path relinking for the capacitated vehicle routing problem

Thammano

Rungwachira

2021

Heliyon

View full text Add to dashboard Cite

Vehicle routing problem is a widely researched combinatorial optimization problem. We developed a hybrid of three strategies—a modified ant system, a sweep algorithm, and a path relinking—for solving a capacitated vehicle routing optimization problem, a vehicle routing problem with a capacity constraint. A sweep algorithm was used to generate initial solutions and assign customers to vehicles, followed by a modified ant system to generate new generations of good solutions. Path relinking was used for building a better solution (candidate) from a pair of guiding and initial solutions. Finally, a local search method—swap, insert, reverse and greedy search operations—was used to prevent solutions from getting trapped in a local minimum. Performance of the proposed algorithm was evaluated on three datasets from CVRPLIB. Our proposed method was at least competitive to state-of-the-art algorithms in terms of the total route lengths. It even surpassed the best-known solution in the P-n55-k8 instance. Our findings can lower the transportation cost by reducing the travelling distance and efficiently utilizing the vehicle capacity.

show abstract

“…CVRP is a VRP with the vehicle capacity constraint [ 16 ]. The total customer demands on each vehicle must be less than its load capacity:

where k = 1, 2, …, m ; m is the number of vehicles; q i is the demand of customer i , and Q is the vehicle capacity.…”

Section: Background Conceptsmentioning

confidence: 99%

“…A Two-stage Sweep Algorithm [ 16 ] is an improved version of SA. In the first stage, customers are clustered by using the original SA.…”

Section: Background Conceptsmentioning

confidence: 99%

“…CVRP is a VRP with the vehicle capacity constraint [16]. The total customer demands on each vehicle must be less than its load capacity:…”

Section: Vrpmentioning

confidence: 99%

“…Chen et al. [ 16 ] used a hybrid of two-stage sweep algorithm and greedy search, for solving CVRP. Sweep algorithm was used to cluster all customers into groups.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations