.

A simulated annealing algorithm for the capacitated vehicle routing problem

LAUR Repository

Show simple item record

dc.contributor.author Azar, Danielle
dc.contributor.author Harmanani, Haidar M.
dc.contributor.author Helal, Nathalies Georges
dc.contributor.author Keirouz, Walid
dc.date.accessioned 2017-03-15T13:42:05Z
dc.date.available 2017-03-15T13:42:05Z
dc.identifier.uri http://hdl.handle.net/10725/5373
dc.description.abstract 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-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. en_US
dc.language.iso en en_US
dc.title A simulated annealing algorithm for the capacitated vehicle routing problem en_US
dc.type Conference Paper / Proceeding en_US
dc.author.school SAS en_US
dc.author.idnumber 198833240 en_US
dc.author.idnumber 199490170 en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.identifier.ctation Harmanani, H. M., Azar, D., Helal, N., & Keirouz, W. (2011). A Simulated Annealing Algorithm for the Capacitated Vehicle Routing Problem. In CATA (pp. 96-101). en_US
dc.author.email danielle.azar@lau.edu.lb en_US
dc.author.email haidar.harmanani@lau.edu.lb en_US
dc.conference.date March 23-15, 2011 en_US
dc.conference.pages 96-101 en_US
dc.conference.place New Orleans, Louisiana, USA en_US
dc.conference.title 26th International Conference on Computers and Their Applications en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url https://www.researchgate.net/profile/Haidar_Harmanani/publication/221206046_A_Simulated_Annealing_Algorithm_for_the_Capacitated_Vehicle_Routing_Problem/links/02e7e533b38058e0da000000.pdf en_US
dc.author.affiliation Lebanese American University en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR


Advanced Search

Browse

My Account