2021
DOI: 10.1016/j.swevo.2021.100911
|View full text |Cite
|
Sign up to set email alerts
|

An improved simulated annealing algorithm with crossover operator for capacitated vehicle routing problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 59 publications
(36 citation statements)
references
References 27 publications
0
26
0
Order By: Relevance
“…˙ILhan, ˙I. [15] designed an improved simulated annealing algorithm with a crossover operator for the capacitated vehicle routing problem (CVRP). Combining multi-depot and integrated delivery to expand the VRPTW makes the MDVRPTW more scientific and reasonable, and the complexity of the solution is increased accordingly.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…˙ILhan, ˙I. [15] designed an improved simulated annealing algorithm with a crossover operator for the capacitated vehicle routing problem (CVRP). Combining multi-depot and integrated delivery to expand the VRPTW makes the MDVRPTW more scientific and reasonable, and the complexity of the solution is increased accordingly.…”
Section: Related Workmentioning
confidence: 99%
“…Each robot's total time from the starting station to the ending station includes the processing task time P g and the transportation time and considers the second section, where the transportation time is affected by the load weight. The time that the robot completes the task must be within the allowable range of its power level, as show in Equation (15).…”
mentioning
confidence: 99%
“…One of the paths deletes the selected points and adds the selected points to the other path. If the new two paths are better than the original two paths, then the original path is replaced [29]. Intra-route optimization consists of path scrambling, path inversion, and path 2-point swapping.…”
Section: Setting For Cvrpmentioning
confidence: 99%
“…The algorithm proposed by İLHAN İlhan [6] used a population-based simulated annealing algorithm, and the solution in the population is developed by local search operators, including exchange, contention, insertion and reduction. A modified 2-opt algorithm was used to develop the compositional solution.…”
Section: Simulated Annealing Algorithmmentioning
confidence: 99%