Journal of Global Optimization

, Volume 65, Issue 1, pp 57–82 | Cite as

Notes on the single route lateral transhipment problem



Previous research has analyzed deterministic and stochastic models of lateral transhipments between different retailers in a supply chain. In these models the analysis assumes given fixed transhipment costs and determines under which situations (magnitudes of excess supply and demand at various retailers) the transhipment is profitable. However, in reality, these depend on aspects like the distance between retailers or the transportation mode chosen. In many situations, combining the transhipments may save transportation costs. For instance, one or more vehicle routes may be used to redistribute the inventory of the potential pickup and delivery stations. This can be done in any sequence as long as the vehicle capacity is not violated and there is enough load on the vehicle to satisfy demand. The corresponding problem is an extension of the one-commodity pickup and delivery traveling salesman and the pickup and delivery vehicle routing problem. When ignoring the routing aspect and assuming given fixed costs, transhipment is only profitable if the quantities are higher than a certain threshold. In contrast to that, the selection of visited retailers is dependent on the transportation costs of the tour and therefore the selected retailers are interrelated. Hence the problem also has aspects of a (team) orienteering problem. The main contribution is the discussion of the tour planning aspects for lateral transhipments which may be valuable for in-house planning but also for price negotiations with external contractors. A mixed integer linear program for the single route and single commodity version is presented and an improved LNS framework to heuristically solve the problem is introduced. Furthermore, the effect of very small load capacity on the structure of optimal solutions is discussed.


Lateral transhipment Orienteering Team orienteering Vehicle routing Pickup and delivery 


  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., New Jersey (1993)MATHGoogle Scholar
  2. 2.
    Balas, E.: The prize collecting traveling salesman problem. Networks 19, 621–636 (1989)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Chao, I.M., Golden, B., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88, 474–474 (1996)MATHGoogle Scholar
  4. 4.
    Dell’Amico, M., Maffioli, F., Värbrand, P.: On prize-collecting tours and the asymmetric travelling salesman problem. Int. Trans. Oper. Res. 2(3), 297–308 (1995)CrossRefMATHGoogle Scholar
  5. 5.
    Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Trans. Sci. 39(2), 188–205 (2005)CrossRefGoogle Scholar
  6. 6.
    Hartl, R.F., Romauch, M.: The influence of routing on lateral transhipment. In: Computer Aided Systems Theory—EUROCAST 2013—14th International Conference, Las Palmas de Gran Canaria, Spain, February 10–15, 2013, Revised Selected Papers, Part I, pp. 267–275 (2013)Google Scholar
  7. 7.
    Herer, Y., Tzur, M., Ycesan, E.: The multilocation transshipment problem. IIE Trans. 38, 186–200 (2006)CrossRefGoogle Scholar
  8. 8.
    Hernández-Prez, H., Salazar-González, J.J.: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. Eur. J. Oper. Res. 196(3), 987–995 (2009)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Parragh, S., Doerner, K., Hartl, R.: A survey on pickup and delivery problems. part II: transportation between pickup and delivery locations. J. für Betriebswirtschaft 58, 81–117 (2008)CrossRefGoogle Scholar
  10. 10.
    Rainer-Harbach, M., Papazek, P., Hu, B., Raidl, G.R.: Balancing bicycle sharing systems: a variable neighborhood search approach evolutionary computation in combinatorial optimization. Lecture Notes in Computer Science. vol. 7832, pp. 121-132 (2013)Google Scholar
  11. 11.
    Raviv, T., Tzur, M., Forma, I.A.: Static repositioning in bike-sharing system: models and solution approaches. EURO J. Trans. Logist. 2, 187–229 (2012)Google Scholar
  12. 12.
    Tricoire, F., Romauch, M., Doerner, K., Hartl, R.: Heuristics for the multi-period orienteering problem with multiple time windows. Comput. Oper. Res. 37, 351–367 (2010)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797–809 (1984)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Department of Business Administration, Production and Operations ManagementUniversity of ViennaViennaAustria

Personalised recommendations