DC FieldValueLanguage
dc.contributor.authorDerbel, Houdaen
dc.contributor.authorJarboui, Bassemen
dc.contributor.authorChabchoub, Habiben
dc.contributor.authorHanafi, Saïden
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:07Z-
dc.date.available2020-05-02T16:42:07Z-
dc.date.issued2011-08-03en
dc.identifier.isbn978-1-457-70324-9en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2498-
dc.description.abstractIn this work, we present a variable neighborhood search for solving a capacitated location routing problem with capacitated depots and a capacitated homogenous vehicle fleet in order to minimize the location and routing cost. We present the basic elements for this purpose and implement the variable neighborhood search algorithm using the variable neighborhood descent as the local search. We tested our heuristic approach on a large number of instances and the results were compared with the literature.en
dc.publisherIEEE-
dc.relation.ispartof2011 4th International Conference on Logistics, LOGISTIQUA'2011en
dc.subjectlocation routing problem | variable neighborhood searchen
dc.titleA variable neighborhood search for the capacitated location-routing problemen
dc.typeConference Paperen
dc.relation.conference4th International Conference on Logistics, LOGISTIQUA'2011; Hammamet; Tunisia; 31 May 2011 through 3 June 2011-
dc.identifier.doi10.1109/LOGISTIQUA.2011.5939452en
dc.identifier.scopus2-s2.0-79960926660en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage514en
dc.relation.lastpage519en
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeConference Paper-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

14
checked on Jun 21, 2024

Page view(s)

80
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.