Please use this identifier to cite or link to this item: http://hdl.handle.net/1822/36519

Full metadata record
DC FieldValueLanguage
dc.contributor.authorMacedo, Ritapor
dc.contributor.authorAlves, Cláudiopor
dc.contributor.authorHanafi, Saidpor
dc.contributor.authorJarboui, Bassempor
dc.contributor.authorMladenovic, Nenadpor
dc.contributor.authorRamos, Brunapor
dc.contributor.authorCarvalho, J. M. Valério depor
dc.date.accessioned2015-07-30T11:54:32Z-
dc.date.available2015-07-30T11:54:32Z-
dc.date.issued2015-09-
dc.identifier.citationMacedo, R., Alves, C., Hanafi, S., Jarboui, B., Mladenović, N., Ramos, B., & de Carvalho, J. V. (2015). Skewed general variable neighborhood search for the location routing scheduling problem. Computers & Operations Research, 61, 143-152por
dc.identifier.issn0305-0548-
dc.identifier.urihttp://hdl.handle.net/1822/36519-
dc.description.abstractThe integrated location routing scheduling problem is a variant of the well-known location routing problem. The location routing problem consists in selecting a set of depots to open and in building a set of routes from these depots, to serve a set of customers at minimum cost. In this variant, a vehicle can perform more than a single route in the planning period. As a consequence, the routes have to be scheduled within the workdays of each vehicle. The problem arises typically when routes are constrained to have a short duration. It happens for example within the boundaries of small geographic areas or in the transportation of perishable goods. In this paper, we propose a skewed general variable neighborhood search based heuristic to solve it. The algorithm is tested extensively and we show that it is efficient and provides the proven optimal solution in a significant number of cases. Moreover, it clearly outperforms a multi-start VND based heuristic that uses the same neighborhood structures.por
dc.description.sponsorshipCentre National de la Recherche Scientifique (CNRS), by the International Campus on Safety and Intermodality in Transportation (CISIT), by the Laboratoire d׳Automatique, de Mécanique et d׳Informatique industrielles et Humaines (LAMIH) of the Université de Valenciennes et du Hainaut-Cambrésis, by FEDER funding through the Programa Operacional Factores de Competitividade - COMPETE and by National funding through the Portuguese Science and Technology Foundation (FCT) in the scope of the project PTDC/EGE-GES/116676/2010 (Ref. COMPETE: FCOMP-01-0124-FEDER-020430) and through the grant SFRH/BPD/78024/2011. National Research University Higher School of Economics and supported by RSF Grant 14-41-00039., info:eu-repo/grantAgreement/FCT/5876-PPCDTI/116676/PTpor
dc.language.isoengpor
dc.publisherElsevierpor
dc.relationinfo:eu-repo/grantAgreement/FCT/5876-PPCDTI/116676/PTpor
dc.rightsrestrictedAccesspor
dc.subjectLocationpor
dc.subjectRoutingpor
dc.subjectSchedulingpor
dc.subjectVariable neighborhood searchpor
dc.titleSkewed general variable neighborhood search for the location routing scheduling problempor
dc.typearticlepor
dc.peerreviewedyespor
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0305054815000696por
sdum.publicationstatuspublishedpor
oaire.citationStartPage143por
oaire.citationEndPage152por
oaire.citationTitleComputers and Operations Researchpor
oaire.citationVolume61por
dc.identifier.doi10.1016/j.cor.2015.03.011por
dc.subject.fosCiências Naturais::Ciências da Computação e da Informaçãopor
dc.subject.wosScience & Technologypor
sdum.journalComputers and Operations Researchpor
Appears in Collections:CAlg - Artigos em revistas internacionais/Papers in international journals

Files in This Item:
File Description SizeFormat 
1-s2.0-S0305054815000696-main.pdf
  Restricted access
644,4 kBAdobe PDFView/Open    Request a copy!

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID