Cargando…
Hybrid modified ant system with sweep algorithm and path relinking for the capacitated vehicle routing problem
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 constr...
Autores principales: | Thammano, Arit, Rungwachira, Petcharat |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8482434/ https://www.ncbi.nlm.nih.gov/pubmed/34622046 http://dx.doi.org/10.1016/j.heliyon.2021.e08029 |
Ejemplares similares
-
Graph drawing using tabu search coupled with path relinking
por: Dib, Fadi K., et al.
Publicado: (2018) -
Firefly Mating Algorithm for Continuous Optimization Problems
por: Ritthipakdee, Amarita, et al.
Publicado: (2017) -
A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem
por: Dalbah, Lamees Mohammad, et al.
Publicado: (2022) -
Constrained Fitness Landscape Analysis of Capacitated Vehicle Routing Problems
por: Muñoz-Herrera, Sebastián, et al.
Publicado: (2021) -
New Hybrid Quantum Annealing Algorithms for Solving Vehicle Routing Problem
por: Borowski, Michał, et al.
Publicado: (2020)