162
Views
28
CrossRef citations to date
0
Altmetric
General Paper

An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries

&
Pages 402-409 | Received 01 Aug 2011, Accepted 01 Jan 2012, Published online: 21 Dec 2017

References

  • AltınelİKÖncanTA new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problemJournal of the Operational Research Society200556895496110.1057/palgrave.jors.2601916
  • AnilySMosheiovGThe traveling salesman problem with delivery and back-haulsOperations Research Letters1994161111810.1016/0167-6377(94)90016-7
  • ApplegateDLBixbyREChvátalVCookWLThe Traveling Salesman Problem: A Computational Study2007
  • BaldacciRHadjiconstantinouEMingozziAAn exact algorithm for the traveling salesman problem with deliveries and collectionsNetworks2003421264110.1002/net.10079
  • BattarraMBenedettiniSRoliALeveraging saving-based algorithms by master-slave genetic algorithmsEngineering Applications of Artificial Intelligence201124455556610.1016/j.engappai.2011.01.007
  • BerbegliaGCordeauJ-FGribkovskaiaILaporteGStatic pickup and delivery problems: A classification scheme and surveyTOP: An Official Journal of the Spanish Society of Statistics and Operations Research200715113110.1007/s11750-007-0009-0
  • CordeauJ-FGendreauMLaporteGPotvinJ-YSemetFA guide to vehicle routing heuristicsJournal of the Operational Research Society200253551252210.1057/palgrave.jors.2601319
  • CroesGAA method for solving traveling-salesman problemsOperations Research19586679181210.1287/opre.6.6.791
  • Dongarra J (2010). Performance of various computers using standard linear equations software. (Linpack Benchmark Report). Technical report, University of Tennessee Computer Science, CS-89-85.
  • ErdoğanGCordeauJ-FLaporteGThe pickup and delivery traveling salesman problem with first-in-first-out loadingComputers & Operations Research20093661800180810.1016/j.cor.2008.05.005
  • ErdoğanGBattarraMLaporteGVigoDMetaheuristics for the traveling salesman problem with pickups, deliveries and handling costsComputers & Operations Research20123951074108610.1016/j.cor.2011.07.013
  • FinkeGClausAGunnEA two-commodity network flow approach to the traveling salesman problemCongressus Numerantium1984411167178
  • FischettiMLodiALocal branchingMathematical Programming2003981234710.1007/s10107-003-0395-5
  • GaskellTJBases for vehicle fleet schedulingOperational Research Quarterly196718328129510.1057/jors.1967.44
  • GavishBTopological design of telecommunication networks-local access design methodsAnnals of Operations Research1991331177110.1007/BF02061657
  • GendreauMLaporteGVigoDHeuristics for the traveling salesman problem with pickup and deliveryComputers & Operations Research199926769971410.1016/S0305-0548(98)00085-9
  • GloverFFuture paths for integer programming and links to artificial intelligenceComputers & Operations Research19865553354910.1016/0305-0548(86)90048-1
  • GribkovskaiaILaporteGShyshouAThe single vehicle routing problem with deliveries and selective pickupsComputers & Operations Research20083592908292410.1016/j.cor.2007.01.007
  • Hernández-PérezHSalazar-GonzálezJ-JThe one-commodity pickup-and-delivery travelling salesman problemCombinatorial Optimization—Eureka, you Shrink200389104
  • Hernández-PérezHSalazar-GonzálezJ-JHeuristics for the one-commodity pickup-and-delivery traveling salesman problemTransportation Science200438224525510.1287/trsc.1030.0086
  • Hernández-PérezHSalazar-GonzálezJ-JThe one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithmsNetworks200750425827210.1002/net.20209
  • LadanySPMehrezAOptimal routing of a single vehicle with loading and unloading constraintsTransportation Planning and Technology19848430130610.1080/03081068408717261
  • LourencoHRMartinOCStutzleTIterated local searchHandbook of Metaheuristics2003321353
  • MartinOOttoSWFeltenEWLarge-step Markov chains for the traveling salesman problemComplex Systems199153299326
  • MosheiovGThe travelling salesman problem with pick-up and deliveryEuropean Journal of Operational Research199479229931010.1016/0377-2217(94)90360-3
  • Or I (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD Thesis, Northwestern University.
  • Penna PHV, Subramanian A and Ochi LS (2011). An iterated local search heuristic for the heterogenous fleet vehicle routing problem. Journal of Heuristics, http://dx.doi.org/10.1007/s10732-011-9186-y, published online 8 September.
  • PisingerDRopkeSA general heuristic for vehicle routing problemsComputers & Operations Research20073482403243510.1016/j.cor.2005.09.012
  • RopkeSPisingerDA unified heuristic for a large class of vehicle routing problems with backhaulsEuropean Journal of Operational Research2006171375077510.1016/j.ejor.2004.09.004
  • SubramanianAUchoaEOchiLNew lower bounds for the vehicle routing problem with simultaneous pickup and deliveryExperimental Algorithms2010276287
  • ZhaoF-GSunJ-SLiS-JLiuW-MA hybrid genetic algorithm for the traveling salesman problem with pickup and deliveryInternational Journal of Automation and Computing2009619710210.1007/s11633-009-0097-4

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.