2016
DOI: 10.1007/978-3-319-51133-7_14
|View full text |Cite
|
Sign up to set email alerts
|

Combining Genetic Algorithm with Constructive and Refinement Heuristics for Solving the Capacitated Vehicle Routing Problem

Abstract: This work presents a hybrid strategy for optimization of Capacitated Vehicle Routing Problem (CVRP) that employs Genetic Algorithms (GA) combined with the heuristics of Gillett & Miller (GM) and Hill Climbing (HC). The first heuristic is used to incorporate feasible solutions in the initial population of the GA while the second is responsible for the refinement of solutions after a certain number of generations without improvements. The computational experiments showed that the proposed strategy presented good… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…The efficiency of Simulated Annealing (SA) in solving complex combinatorial problems making it interesting for extension to multi-objective optimization [10]. In addition, it is worth noting that more and more researchers now work on hybrid methods by combining different optimization strategies [3,5,7,8].…”
Section: Introductionmentioning
confidence: 99%
“…The efficiency of Simulated Annealing (SA) in solving complex combinatorial problems making it interesting for extension to multi-objective optimization [10]. In addition, it is worth noting that more and more researchers now work on hybrid methods by combining different optimization strategies [3,5,7,8].…”
Section: Introductionmentioning
confidence: 99%