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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | conferenceObject |
| منشور في: |
2011
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | 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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513482146185217 |
|---|---|
| author | Azar, Danielle |
| author2 | Harmanani, Haidar M. Keirouz, Walid Helal, Nathalie Georges |
| author2_role | author author author |
| author_facet | Azar, Danielle Harmanani, Haidar M. Keirouz, Walid Helal, Nathalie Georges |
| author_role | author |
| dc.creator.none.fl_str_mv | Azar, Danielle Harmanani, Haidar M. Keirouz, Walid Helal, Nathalie Georges |
| dc.date.none.fl_str_mv | 2011 2018-04-20T11:23:35Z 2018-04-20T11:23:35Z 2018-04-20 |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10725/7442 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). 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 |
| dc.language.none.fl_str_mv | en |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Application software -- Congresses Computers -- Congresses |
| dc.title.none.fl_str_mv | A simulated annealing algorithm for the capacitated vehicle routing problem |
| dc.type.none.fl_str_mv | Conference Paper / Proceeding info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/conferenceObject |
| description | 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). |
| eu_rights_str_mv | openAccess |
| format | conferenceObject |
| id | LAURepo_df2a468bfa40754e135d3b12728b1afa |
| identifier_str_mv | 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). |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/7442 |
| publishDate | 2011 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A simulated annealing algorithm for the capacitated vehicle routing problemAzar, DanielleHarmanani, Haidar M.Keirouz, WalidHelal, Nathalie GeorgesApplication software -- CongressesComputers -- CongressesThe 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).N/A2018-04-20T11:23:35Z2018-04-20T11:23:35Z20112018-04-20Conference Paper / Proceedinginfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjecthttp://hdl.handle.net/10725/7442Harmanani, H. M., Azar, D., Helal, N., & Keirouz, W. (2011). A Simulated Annealing Algorithm for the Capacitated Vehicle Routing Problem. In CATA (pp. 96-101).http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.phphttps://www.researchgate.net/publication/221206046_A_Simulated_Annealing_Algorithm_for_the_Capacitated_Vehicle_Routing_Problemeninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/74422021-03-19T10:03:31Z |
| spellingShingle | A simulated annealing algorithm for the capacitated vehicle routing problem Azar, Danielle Application software -- Congresses Computers -- Congresses |
| status_str | publishedVersion |
| title | A simulated annealing algorithm for the capacitated vehicle routing problem |
| title_full | A simulated annealing algorithm for the capacitated vehicle routing problem |
| title_fullStr | A simulated annealing algorithm for the capacitated vehicle routing problem |
| title_full_unstemmed | A simulated annealing algorithm for the capacitated vehicle routing problem |
| title_short | A simulated annealing algorithm for the capacitated vehicle routing problem |
| title_sort | A simulated annealing algorithm for the capacitated vehicle routing problem |
| topic | Application software -- Congresses Computers -- Congresses |
| url | 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 |