A Parallel Meta-heuristic for Solving a Multiple Asymmetric Traveling Salesman Problem with Simulateneous Pickup and Delivery Modeling Demand Responsive Transport Problems

  • E. OsabaEmail author
  • F. Diaz
  • E. Onieva
  • Pedro López-García
  • R. Carballedo
  • A. Perallos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9121)


Transportation is an essential area in the nowadays society. Due to the rapid technological progress, it has gained a great importance, both for business sector and citizenry. Among the different types of transport, one that has gained notoriety recently is the transportation on-demand, because it can affect very positively the people quality of life. There are different kinds of on-demand transportation systems, being the Demand Responsive Transit (DRT) one of the most important one. In this work, a real-life DRT problem is proposed, and modeled as a Rich Traveling Salesman Problem. Specifically, the problem presented is a Multiple Asymmetric Traveling Salesman Problem with Simultaneous Pickup and Delivery. Furthermore, a benchmark for this new problem is also proposed, and its first resolution is offered. For the resolution of this benchmark the recently developed Golden Ball meta-heuristic has been implemented.


On demand transportation Demand responsive transport Traveling salesman problem Golden ball Meta-heuristic Combinatorial optimization 



The authors would like to thank the Entornos inteligentes ubicuos aplicados a la trazabilidad en el sector de transportes y vehiculares project (UBITRACE PC2013-71A) for its support in the development of this work.


  1. 1.
    Cordeau, J.F., Laporte, G., Potvin, J.Y., Savelsbergh, M.W.: Transportation on demand. Transp. Handb. Oper. Res. Manage. Sci. 14, 429–466 (2004)Google Scholar
  2. 2.
    Brake, J., Nelson, J.D., Wright, S.: Demand responsive transport: towards the emergence of a new market segment. J. Transp. Geogr. 12(4), 323–337 (2004)CrossRefGoogle Scholar
  3. 3.
    Ritzinger, U., Puchinger, J., Hartl, R.F.: Dynamic programming based metaheuristics for the dial-a-ride problem. Ann. Oper. Res. 228, 1–18 (2014)Google Scholar
  4. 4.
    Paquette, J., Cordeau, J.F., Laporte, G., Pascoal, M.: Combining multicriteria analysis and tabu search for dial-a-ride problems. Transp. Res. Part B: Methodol. 52, 1–16 (2013)CrossRefGoogle Scholar
  5. 5.
    Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1–21 (2013)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Osaba, E., Diaz, F., Onieva, E.: Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts. Appl. Intell. 41(1), 145–166 (2014)CrossRefGoogle Scholar
  7. 7.
    Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209–219 (2006)CrossRefGoogle Scholar
  8. 8.
    Laporte, G., Mercure, H., Nobert, Y.: An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16(1), 33–46 (1986)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Toth, P., Vigo, D.: A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur. J. Oper. Res. 113(3), 528–543 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Montané, F.A.T., Galvao, R.D.: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput. Oper. Res. 33(3), 595–619 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Bianchessi, N., Righini, G.: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput. Oper. Res. 34(2), 578–594 (2007)CrossRefzbMATHGoogle Scholar
  12. 12.
    Osaba, E., Onieva, E., Diaz, F., Carballedo, R., Lopez, P., Perallos, A.: An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem. In: IEEE International Symposium on Applied Machine Intelligence and Informatics, pp. 151–156. IEEE (2015)Google Scholar
  13. 13.
    Reinelt, G.: TSPLIBA traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)CrossRefzbMATHGoogle Scholar
  14. 14.
    Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44(10), 2245–2269 (1965)CrossRefzbMATHGoogle Scholar
  15. 15.
    Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proceedings of the international joint conference on artificial intelligence, vol. 1, pp. 161–163 (1985)Google Scholar
  16. 16.
    Savelsbergh, M.W.: The vehicle routing problem with time windows: minimizing route duration. ORSA J. Comput. 4(2), 146–154 (1992)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • E. Osaba
    • 1
    Email author
  • F. Diaz
    • 1
  • E. Onieva
    • 1
  • Pedro López-García
    • 1
  • R. Carballedo
    • 1
  • A. Perallos
    • 1
  1. 1.Deusto Institute of Technology (DeustoTech)University of DeustoBilbaoSpain

Personalised recommendations