Solving the capacitated vehicle routing problem with stochastic demands applying the simulated annealing algorithm
A new hybrid algorithm for solving the capacitated vehicle routing problem (CVRP) with stochastic demands is proposed. This new approach combines the simulated annealing (SA) with the savings algorithms and is implemented to obtain results of several Solomon’s instances of CVRP. This approach is na...
Main Authors: | Ernesto Liñán García, Linda Crystal Cruz Villegas, David Salvador González González |
---|---|
Format: | Article |
Language: | English |
Published: |
Universidad Autónoma del Estado de Morelos
2014-06-01
|
Series: | Programación Matemática y Software |
Subjects: | |
Online Access: | https://progmat.uaem.mx/progmat/index.php/progmat/article/view/156 |
Similar Items
-
Tests with two heuristic search strategies in the simulated annealing algorithm for an inventory problem
by: Salvador Hernández González
Published: (2012-05-01) -
Adaptation Of The Variable Neighborhood Search Heuristic To Solve The Vehicle Routing Problem
by: Arif Imran, et al.
Published: (2012-03-01) -
Metaheurística Simulated Annealing para solução de problemas de planejamento florestal com restrições de integridade Simulated Annealing metaheuristic to solve forest planning problem with integer constraints
by: Flávio Lopes Rodrigues, et al.
Published: (2004-04-01) -
Modelling of a Fed-Batch Culture Applying Simulated Annealing
by: Olympia Roeva, et al.
Published: (2012-12-01) -
A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
Published: (2012-06-01)