A simulated annealing algorithm for the capacitated vehicle routing problem
The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a fleet 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-heur...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5373 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://www.researchgate.net/profile/Haidar_Harmanani/publication/221206046_A_Simulated_Annealing_Algorithm_for_the_Capacitated_Vehicle_Routing_Problem/links/02e7e533b38058e0da000000.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|