Skip to main content
Log in

An adapted heuristic approach for a clustered traveling salesman problem with loading constraints

  • Research Paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

The joint optimization of routing and loading operations is crucial to fully optimize the overall planning process in logistics, and as a result routing problems with side constraints are becoming more and more important during the last years. This paper approaches the design of optimal routes for pickup and delivery operations considering in addition some capacity and loading constraints on the vehicles to be used. It is focused on exploiting new ideas to deal with real life situations in which the customers are not uniformly distributed on the pickup or delivery regions of the problem. An adapted and effective heuristic based on a Variable Neighborhood Search framework using improved neighborhood structures is proposed and discussed. The algorithm is applied to several new sets of instances with special structures to better represent real life situations, providing computational results to evaluate its performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alba M, Cordeau J-F, Dell’Amico M, Iori MA (2011) Branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. INFORMS J Comput (to appear)

  • Carrabs F, Cerulli R, Cordeau J-F (2007) An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading. INFOR Inf Syst Oper Res 45(4): 223–238

    Article  Google Scholar 

  • Carrabs F, Cordeau J-F, Laporte G (2007) Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput 19: 618–632

    Article  Google Scholar 

  • Carrabs F, Cerulli R, Speranza MG (2010) A branch-and-bound algorithm for the double TSP with two stacks. Technical Report 4, DMI, University of Salerno, Italy (available on line)

  • Cassani L, Righini G (2004) Heuristic algorithms for the TSP with rear-loading. In: 35th annual conference of the Italian operational research society, AIRO XXXV, Lecce, Italy

  • Cassaza M, Ceselli A, Nunkesser M (2009) Efficient algorithms for the double traveling salesman problem with multiple stacks. In: Proceedings of Cologne twente workshop, Paris, France

  • Cordeau J-F, Iori M, Laporte G, Salazar-González J (2010) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1): 46–59

    Article  Google Scholar 

  • Cotè JF, Gendreau M, Potvin JY (2012) Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. Networks. doi:10.1002/net.20448

  • Doerner DF, Fuellerer G, Hartl RF, Gronalt M, Iori M (2007) Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4): 294–307

    Article  Google Scholar 

  • Felipe A, Ortuño MT, Tirado G (2009) The double traveling salesman problem with multiple stacks: a variable neighborhood search approach. Comput Oper Res 36: 2983–2993

    Article  Google Scholar 

  • Felipe A, Ortuño MT, Tirado G (2011) Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints. Eur J Oper Res 211: 66–75

    Article  Google Scholar 

  • Gendreau M, Iori M, Laporte G, Martello S (2006) A heuristic algorithm for a routing and container loading problem. Transp Sci 40: 342–350

    Article  Google Scholar 

  • Gendreau M, Iori M, Laporte G, Martello S (2008) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1): 4–18

    Article  Google Scholar 

  • Iori M, Salazar-González J, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp Sci 41(2): 253–264

    Article  Google Scholar 

  • Lusby R, Larsen J, Ehrgott M, Ryan D (2010) An exact method for the double TSP with multiple stacks. Int Trans Oper Res 17: 637–652

    Article  Google Scholar 

  • Petersen HL, Archetti C, Speranza MG (2010) Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56(4): 229–243

    Article  Google Scholar 

  • Petersen HL, Madsen OBG (2009) The double travelling salesman problem with multiple stacks—formulation and heuristic solution approaches. Eur J Oper Res 198(1): 139–147

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gregorio Tirado.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Felipe, A., Ortuño, M.T. & Tirado, G. An adapted heuristic approach for a clustered traveling salesman problem with loading constraints. 4OR-Q J Oper Res 10, 245–265 (2012). https://doi.org/10.1007/s10288-012-0207-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-012-0207-y

Keywords

Mathematics Subject Classification (2000)

Navigation