Cargando…
A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem
We propose a heuristic approach based on the Clarke-Wright algorithm (CW) to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service. The proposed CW has been presented in four procedures composed...
Autores principales: | Pichpibul, Tantikorn, Kawtummachai, Ruengsak |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3870871/ https://www.ncbi.nlm.nih.gov/pubmed/24382948 http://dx.doi.org/10.1155/2013/874349 |
Ejemplares similares
-
A set-covering based heuristic algorithm for the periodic vehicle routing problem
por: Cacchiani, V., et al.
Publicado: (2014) -
Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows
por: Jawarneh, Sana, et al.
Publicado: (2015) -
Bio-inspired algorithms for the vehicle routing problem
por: Tavares, Jorge, et al.
Publicado: (2008) -
Orienteering problems: models and algorithms for vehicle routing problems with profits
por: Vansteenwegen, Pieter, et al.
Publicado: (2019) -
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics
por: Hemmelmayr, Vera C., et al.
Publicado: (2012)