Show simple item record

dc.contributor.authorVansteenwegen, Pieter
dc.contributor.authorMateo Doll, Manuel
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.date.accessioned2014-07-01T10:02:38Z
dc.date.created2014-09-16
dc.date.issued2014-09-16
dc.identifier.citationVansteenwegen, P.; Mateo, M. An iterated local search algorithm for the single-vehicle cyclic inventory routing problem. "European journal of operational research", 16 Setembre 2014, vol. 237, núm. 3, p. 802-813.
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/2117/23355
dc.description.abstractThe Single-Vehicle Cyclic Inventory Routing Problem (SV-CIRP) belongs to the class of Inventory Routing Problems (IRP) in which the supplier optimises both the distribution costs and the inventory costs at the customers. The goal of the SV-CIRP is to minimise both kinds of costs and to maximise the collected rewards, by selecting a subset of customers from a given set and determining the quantity to be delivered to each customer and the vehicle routes, while avoiding stockouts. A cyclic distribution plan should be developed for a single vehicle.; We present an iterated local search (ILS) metaheuristic that exploits typical characteristics of the problem and opportunities to reduce the computation time. Experimental results on 50 benchmark instances show that our algorithm improves the results of the best available algorithm on average with 16.02%. Furthermore, 32 new best known solutions are obtained. A sensitivity analysis demonstrates that the performance of the algorithm is not influenced by small changes in the parameter settings of the ILS. (C) 2014 Elsevier B.V. All rights reserved.
dc.format.extent12 p.
dc.language.isoeng
dc.publisherElsevier
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses
dc.subject.lcshHeuristic algorithms
dc.subject.otherRouting
dc.subject.otherInventory
dc.subject.otherSingle-vehicle cyclic inventory routing problem
dc.subject.otherIterated local search
dc.subject.otherMetaheuristic
dc.subject.otherORIENTEERING PROBLEM
dc.subject.otherMANAGEMENT
dc.subject.otherSYSTEMS
dc.titleAn iterated local search algorithm for the single-vehicle cyclic inventory routing problem
dc.typeArticle
dc.subject.lemacHeurística
dc.contributor.groupUniversitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
dc.identifier.doi10.1016/j.ejor.2014.02.020
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0377221714001350
dc.rights.accessRestricted access - publisher's policy
drac.iddocument14964384
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
upcommons.citation.authorVansteenwegen, P.; Mateo, M.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameEuropean journal of operational research
upcommons.citation.volume237
upcommons.citation.number3
upcommons.citation.startingPage802
upcommons.citation.endingPage813


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain