Skip to main content
SpringerLink
Log in

A general variable neighborhood search variants for the travelling salesman problem with draft limits

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we present two general variable neighborhood search (GVNS) based variants for solving the traveling salesman problem with draft limits (TSPDL), a recent extension of the traveling salesman problem. TSPDL arises in the context of maritime transportation. It consists of finding optimal Hamiltonian tour for a given ship which has to visit and deliver products to a set of ports while respecting the draft limit constraints. The proposed methods combine ideas in sequential variable neighborhood descent within GVNS. They are tested on a set of benchmarks from the literature as well as on a new one generated by us. Computational experiments show remarkable efficiency and effectiveness of our new approach. Moreover, new set of benchmarks instances is generated.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Battara, M., Pessoa, A.A., Subramanian, A., Uchoa, E.: Exact algorithms for the travelling salesman problem with draft limits. Eur. J. Oper. Res. doi:10.1016/j.ejor.2013.10.042

  2. Hansen, P., Mladenović, N., Moreno-Pérez, J.A.: Variable neighbourhood search: methods and applications. 4OR 6, 319–360 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hansen, P., Mladenović, N., Moreno-Pérez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367–407 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215–310. Wiley, New York (1995)

    Google Scholar 

  5. Mjirda, A., Jarboui, B., Macedo, R., Hanafi, S., Mladenović, N.: A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. doi:10.1016/j.cor.2013.06.006i

  6. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mladenović, N., Todosijević, R., Urosević, D.: An efficient General variable neighborhood search for large TSP problem with time windows. Yugosl. J. Oper. Res. 22, 141–151 (2012)

    MATH  Google Scholar 

  8. Mladenović, N., Todosijević, R., Urosević, D.: Two level General variable neighborhood search for Attractive traveling salesman problem. Comput. Oper. Res. doi:10.1016/j.cor.2013.04.015

  9. Mladenović, N., Urosević, D., Hanafi, A., Ilić, A.: A General variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 220, 270–285 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mladenović, N., Urosević, N., Hanafi, S.: Variable neighborhood search for the travelling deliveryman problem. 4OR 11, 57–73 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Panchamgam, K., Xiong, Y., Golden, B., Dussault, B., Wasil, E.: The hierarchical traveling salesman problem. Optim. Lett. 7, 1–8 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  12. Rakke, J.G., Christiansen, M., Fagerholt, K., Laporte, G.: The travelling salesman problem with draft limits. Comput. Oper. Res. 39, 2162–2167 (2012)

    MATH  Google Scholar 

  13. Reinelt, G.: TSPLIB—a traveling salesman problem library. ORSA J. Comput. 3, 376–384 (1991)

    Article  MATH  Google Scholar 

  14. Yadlapalli, S., Rathinam, S., Darbha, S.: 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem. Optim. Lett. 6, 141–152 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by the Centre National de la Recherche Scientifique (CNRS), by the Campus interdisciplinaire de recherche, d’innovation technologique et de formation Internationale sur la Sécurité et l’Intermodalité des Transports (CISIT), and by the Laboratoire d’Automatique, de Mécanique et d’Informatique industrielles et Humaines (LAMIH) of the Université de Valenciennes et du Hainaut-Cambrésis.

Author information

Authors and Affiliations

  1. LAMIH-UVHC, Le Mont Houy Valenciennes, Cedex 9, France

    Raca Todosijević, Anis Mjirda, Marko Mladenović & Saïd Hanafi

  2. CIRRELT, Université de Montréal, Québec, Canada

    Bernard Gendron

Authors
  1. Raca Todosijević
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anis Mjirda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marko Mladenović
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Saïd Hanafi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bernard Gendron
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anis Mjirda.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Todosijević, R., Mjirda, A., Mladenović, M. et al. A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim Lett 11, 1047–1056 (2017). https://doi.org/10.1007/s11590-014-0788-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0788-9

Keywords

Search

Navigation