A simulated annealing algorithm for the capacitated vehicle routing problem
The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a eet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. In this paper, we present a meta-heuris...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | conferenceObject |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10725/7442 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://www.researchgate.net/publication/221206046_A_Simulated_Annealing_Algorithm_for_the_Capacitated_Vehicle_Routing_Problem |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a eet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combination of random and deterministic operators that are based on problem knowledge information. Experimental results are presented and favorable comparisons are reported. Copyright © 2011 by the International Society for Computers and Their Applications (ISCA). |
|---|