IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v19y2019i2d10.1007_s12351-017-0299-4.html
   My bibliography  Save this article

Mixed integer formulations for the multiple minimum latency problem

Author

Listed:
  • F. Angel-Bello

    (School of Engineering and Science)

  • Y. Cardona-Valdés

    (Universidad Autónoma de Coahuila)

  • A. Álvarez

    (Universidad Autónoma de Nuevo León)

Abstract

In this paper we propose five mathematical formulations for the multiple minimum latency problem. The first three mathematical models are straight derived from classical formulations and from a flow-based formulation to the multiple travelling salesman problem. The last two are obtained as generalizations of time-dependent formulations to the minimum latency problem. We carry out an extensive computational experimentation to evaluate the performance of the proposed models using routing and scheduling instances. These experiments evidence that the time-dependent formulations show a much better performance than the other formulations, regarding to the size of instances that can be solved and the elapsed computational time to reach the optimal solutions. The obtained results suggest to consider the development of time-dependent formulations for other problems that consider the latency as objective function.

Suggested Citation

  • F. Angel-Bello & Y. Cardona-Valdés & A. Álvarez, 2019. "Mixed integer formulations for the multiple minimum latency problem," Operational Research, Springer, vol. 19(2), pages 369-398, June.
    • Handle: RePEc:spr:operea:v:19:y:2019:i:2:d:10.1007_s12351-017-0299-4
    DOI: 10.1007/s12351-017-0299-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-017-0299-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-017-0299-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gouveia, Luis & Vo[ss], Stefan, 1995. "A classification of formulations for the (time-dependent) traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 69-82, May.
    2. Gerhard Reinelt, 1991. "TSPLIB—A Traveling Salesman Problem Library," INFORMS Journal on Computing, INFORMS, vol. 3(4), pages 376-384, November.
    3. Jean-Claude Picard & Maurice Queyranne, 1978. "The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling," Operations Research, INFORMS, vol. 26(1), pages 86-110, February.
    4. Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
    5. Samuel Nucamendi-Guillén & Iris Martínez-Salazar & Francisco Angel-Bello & J Marcos Moreno-Vega, 2016. "A mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(8), pages 1121-1134, August.
    6. Matteo Fischetti & Gilbert Laporte & Silvano Martello, 1993. "The Delivery Man Problem and Cumulative Matroids," Operations Research, INFORMS, vol. 41(6), pages 1055-1064, December.
    7. Silva, Marcos Melo & Subramanian, Anand & Vidal, Thibaut & Ochi, Luiz Satoru, 2012. "A simple and effective metaheuristic for the Minimum Latency Problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 513-520.
    8. Vallada, Eva & Ruiz, Rubén, 2011. "A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 211(3), pages 612-622, June.
    9. Imen Ome Ezzine & Sonda Elloumi, 2012. "Polynomial formulation and heuristic based approach for the k-travelling repairman problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 4(5), pages 503-514.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Timo Gschwind & Stefan Irnich & Christian Tilk & Simon Emde, 2020. "Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network," Journal of Scheduling, Springer, vol. 23(3), pages 363-377, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Albert Einstein Fernandes Muritiba & Tibérius O. Bonates & Stênio Oliveira Da Silva & Manuel Iori, 2021. "Branch-and-Cut and Iterated Local Search for the Weighted k -Traveling Repairman Problem: An Application to the Maintenance of Speed Cameras," Transportation Science, INFORMS, vol. 55(1), pages 139-159, 1-2.
    2. Jan Mikula & Miroslav Kulich, 2022. "Solving the traveling delivery person problem with limited computational time," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(4), pages 1451-1481, December.
    3. Rivera, Juan Carlos & Murat Afsar, H. & Prins, Christian, 2016. "Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 249(1), pages 93-104.
    4. Cacchiani, Valentina & Contreras-Bolton, Carlos & Toth, Paolo, 2020. "Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times," European Journal of Operational Research, Elsevier, vol. 283(3), pages 825-843.
    5. Roberto Roberti & Aristide Mingozzi, 2014. "Dynamic ng-Path Relaxation for the Delivery Man Problem," Transportation Science, INFORMS, vol. 48(3), pages 413-424, August.
    6. Juan Rivera & H. Afsar & Christian Prins, 2015. "A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem," Computational Optimization and Applications, Springer, vol. 61(1), pages 159-187, May.
    7. Silva, Marcos Melo & Subramanian, Anand & Vidal, Thibaut & Ochi, Luiz Satoru, 2012. "A simple and effective metaheuristic for the Minimum Latency Problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 513-520.
    8. N. A. Arellano-Arriaga & J. Molina & S. E. Schaeffer & A. M. Álvarez-Socarrás & I. A. Martínez-Salazar, 2019. "A bi-objective study of the minimum latency problem," Journal of Heuristics, Springer, vol. 25(3), pages 431-454, June.
    9. Enrique Benavent & Antonio Martínez, 2013. "Multi-depot Multiple TSP: a polyhedral study and computational results," Annals of Operations Research, Springer, vol. 207(1), pages 7-25, August.
    10. Kinable, Joris & Cire, Andre A. & van Hoeve, Willem-Jan, 2017. "Hybrid optimization methods for time-dependent sequencing problems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 887-897.
    11. Akbari, Vahid & Shiri, Davood, 2021. "Weighted online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 51-65.
    12. Miranda-Bront, Juan José & Méndez-Díaz, Isabel & Zabala, Paula, 2014. "Facets and valid inequalities for the time-dependent travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 891-902.
    13. Tamás Kalmár-Nagy & Giovanni Giardini & Bendegúz Dezső Bak, 2017. "The Multiagent Planning Problem," Complexity, Hindawi, vol. 2017, pages 1-12, February.
    14. Ajam, Meraj & Akbari, Vahid & Salman, F. Sibel, 2022. "Routing multiple work teams to minimize latency in post-disaster road network restoration," European Journal of Operational Research, Elsevier, vol. 300(1), pages 237-254.
    15. Bruni, M.E. & Khodaparasti, S. & Beraldi, P., 2020. "The selective minimum latency problem under travel time variability: An application to post-disaster assessment operations," Omega, Elsevier, vol. 92(C).
    16. Fink, Andreas & Vo[ss], Stefan, 2003. "Solving the continuous flow-shop scheduling problem by metaheuristics," European Journal of Operational Research, Elsevier, vol. 151(2), pages 400-414, December.
    17. Vahid Akbari & İhsan Sadati & F. Sibel Salman & Davood Shiri, 2023. "Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(3), pages 807-852, September.
    18. Vu, Duc Minh & Hewitt, Mike & Vu, Duc D., 2022. "Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery," European Journal of Operational Research, Elsevier, vol. 302(3), pages 831-846.
    19. Ajam, Meraj & Akbari, Vahid & Salman, F. Sibel, 2019. "Minimizing latency in post-disaster road clearance operations," European Journal of Operational Research, Elsevier, vol. 277(3), pages 1098-1112.
    20. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:operea:v:19:y:2019:i:2:d:10.1007_s12351-017-0299-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.