Skip to main content
SpringerLink
Log in

MineReduce-Based Metaheuristic for the Minimum Latency Problem

  • Conference paper
  • First Online:
Metaheuristics (MIC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13838))

Included in the following conference series:

Abstract

The minimum latency problem is a variant of the well-known travelling salesperson problem where the objective is to minimize the sum of arrival times at vertices. Recently, a proposal that incorporates data mining into a state-of-the-art metaheuristic by injecting patterns from high-quality solutions has consistently led to improved results in terms of solution quality and running time for this problem. This paper extends that proposal by leveraging data mining to contract portions of the problem frequently found in high-quality solutions. Our proposal aims at mitigating the burden of searching for improving solutions by periodically solving a reduced version of the original problem. Computational experiments conducted on a well-diversified set of instances demonstrate that our proposal improved solution quality without increasing computational time, introducing 11 new best solutions to the literature.

This work was supported by Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq, Brazil) [grants 310444/2018-7, 310624/2018-5, 309832/2020-9], Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro (FAPERJ, Brazil) [grant E-26/201.344/2021], Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES, Brazil) [grant 88887.646206/2021-00], and Instituto Brasileiro de Geografia e Estatística (IBGE, Brazil).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Abeledo, H., Fukasawa, R., Pessoa, A., Uchoa, E.: The time dependent traveling salesman problem: polyhedra and algorithm. Math. Program. Comput. 5, 27–55 (2013). https://doi.org/10.1007/s12532-012-0047-y

    Article  MathSciNet  MATH  Google Scholar 

  2. Angel-Bello, F., Alvarez, A., García, I.: Two improved formulations for the minimum latency problem. Appl. Math. Model. 37(4), 2257–2266 (2013). https://doi.org/10.1016/j.apm.2012.05.026

    Article  MathSciNet  MATH  Google Scholar 

  3. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 163–171. Association for Computing Machinery, New York (1994). https://doi.org/10.1145/195058.195125

  4. Bulhões, T., Sadykov, R., Uchoa, E.: A branch-and-price algorithm for the minimum latency problem. Comput. Oper. Res. 93, 66–78 (2018). https://doi.org/10.1016/j.cor.2018.01.016

    Article  MathSciNet  MATH  Google Scholar 

  5. Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transp. Sci. 42(2), 127–145 (2008). https://doi.org/10.1287/trsc.1070.0209

    Article  Google Scholar 

  6. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109–133 (1995). https://doi.org/10.1007/BF01096763

    Article  MathSciNet  MATH  Google Scholar 

  7. Fischetti, M., Laporte, G., Martello, S.: The delivery man problem and cumulative matroids. Oper. Res. 41(6), 1055–1064 (1993). https://doi.org/10.1287/opre.41.6.1055

    Article  MathSciNet  MATH  Google Scholar 

  8. Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: Goethals, B., Zaki, M.J. (eds.) Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (2003)

    Google Scholar 

  9. Kindervater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges, pp. 337–360. Princeton University Press (2018). https://doi.org/10.1515/9780691187563-013

  10. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated Local Search, pp. 320–353. Springer, Boston (2003). https://doi.org/10.1007/0-306-48056-5_11

  11. Maia, M.R.H., Plastino, A., Souza, U.S.: MineReduce for the minimum weight vertex cover problem. In: Proceedings of the International Conference on Optimization and Learning (OLA 2020), pp. 11–22 (2020)

    Google Scholar 

  12. Maia, M.R.H., Plastino, A., Penna, P.H.V.: MineReduce: an approach based on data mining for problem size reduction. Comput. Oper. Res. 122, 104995 (2020). https://doi.org/10.1016/j.cor.2020.104995

  13. Mladenović, N., Urošević, D., Goos, P., Hanafi, S.: Variable neighborhood search for the travelling deliveryman problem. 4OR 11, 57–73 (2013). https://doi.org/10.1007/s10288-012-0212-1

  14. Plastino, A., Barbalho, H., Santos, L.F.M., Fuchshuber, R., Martins, S.L.: Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic. J. Heurist. 20, 1899–1911 (2014). https://doi.org/10.1007/s10732-013-9231-0

    Article  Google Scholar 

  15. Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991). https://doi.org/10.1287/ijoc.3.4.376

    Article  MATH  Google Scholar 

  16. Roberti, R., Mingozzi, A.: Dynamic ng-path relaxation for the delivery man problem. Transp. Sci. 48(3), 413–424 (2014). https://doi.org/10.1287/trsc.2013.0474

    Article  Google Scholar 

  17. Salehipour, A., Sörensen, K., Goos, P., Bräysy, O.: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR 9(2), 189–209 (2011). https://doi.org/10.1007/s10288-011-0153-0

  18. Santana, I., Plastino, A., Rosseti, I.: Improving a state-of-the-art heuristic for the minimum latency problem with data mining. Int. Trans. Oper. Res. 29(2), 959–986 (2022). https://doi.org/10.1111/itor.12774

    Article  Google Scholar 

  19. Silva, M.M., Subramanian, A., Vidal, T., Ochi, L.S.: A simple and effective metaheuristic for the minimum latency problem. Eur. J. Oper. Res. 221(3), 513–520 (2012). https://doi.org/10.1016/j.ejor.2012.03.044

    Article  MATH  Google Scholar 

  20. Subramanian, A., Drummond, L., Bentes, C., Ochi, L., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899–1911 (2010). https://doi.org/10.1016/j.cor.2009.10.011

    Article  MATH  Google Scholar 

  21. Talbi, E.G.: Machine learning into metaheuristics: a survey and taxonomy. ACM Comput. Surv. 54(6), 1–32 (2021). https://doi.org/10.1145/3459664

    Article  Google Scholar 

  22. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unifying view on timing problems and algorithms. Technical report, CIRRELT (2011)

    Google Scholar 

  23. Yang, G.: The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2004, pp. 344–353. Association for Computing Machinery, New York (2004). https://doi.org/10.1145/1014052.1014091

Download references

Author information

Authors and Affiliations

  1. Instituto de Computação, Universidade Federal Fluminense, Niterói, RJ, Brazil

    Marcelo Rodrigues de Holanda Maia, Isabel Rosseti, Uéverton dos Santos Souza & Alexandre Plastino

  2. Instituto Brasileiro de Geografia e Estatística, Rio de Janeiro, RJ, Brazil

    Marcelo Rodrigues de Holanda Maia

  3. Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro, Rio de Janeiro, RJ, Brazil

    Ítalo Santana

Authors
  1. Marcelo Rodrigues de Holanda Maia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ítalo Santana
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Isabel Rosseti
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Uéverton dos Santos Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Alexandre Plastino
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcelo Rodrigues de Holanda Maia .

Editor information

Editors and Affiliations

  1. University of Udine, Udine, Italy

    Luca Di Gaspero

  2. University of Napoli - Federico II, Napoli, Italy

    Paola Festa

  3. University of Paris Est, Paris, France

    Amir Nakib

  4. University of Catania, Catania, Italy

    Mario Pavone

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Maia, M.R.d.H., Santana, Í., Rosseti, I., Souza, U.d.S., Plastino, A. (2023). MineReduce-Based Metaheuristic for the Minimum Latency Problem. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-26504-4_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-26503-7

  • Online ISBN: 978-3-031-26504-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation