Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Improving a State-of-the-Art Heuristic for the Minimum Latency Problem with Data Mining (1908.10705v2)

Published 28 Aug 2019 in cs.LG, cs.AI, and stat.ML

Abstract: Recently, hybrid metaheuristics have become a trend in operations research. A successful example combines the Greedy Randomized Adaptive Search Procedures (GRASP) and data mining techniques, where frequent patterns found in high-quality solutions can lead to an efficient exploration of the search space, along with a significant reduction of computational time. In this work, a GRASP-based state-of-the-art heuristic for the Minimum Latency Problem (MLP) is improved by means of data mining techniques for two MLP variants. Computational experiments showed that the approaches with data mining were able to match or improve the solution quality for a large number of instances, together with a substantial reduction of running time. In addition, 88 new cost values of solutions are introduced into the literature. To support our results, tests of statistical significance, impact of using mined patterns, equal time comparisons and time-to-target plots are provided.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (49)
  1. The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. Technical report, Universidade Federal Fluminense.
  2. The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. In Proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010, Ischia Island, Italy, pp. 202–213.
  3. The complexity of the travelling repairman problem. RAIRO Informatique théorique 20, 79–87.
  4. Fast Algorithms for Mining Association Rules in Large Databases. In Proc. of the 20th International Conf. on Very Large Data Bases, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 487–499.
  5. TTT plots: A perl program to create time-to-target plots. Optimization Letters 1, 355–366.
  6. Two improved formulations for the minimum latency problem. Applied Mathematical Modelling 37, 2257–2266.
  7. Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls. In Proceedings of the 21th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 429–447.
  8. A Hybrid Data Mining GRASP with Path-Relinking. Computers and Operations Research 40, 3159–3173.
  9. The Traveling Salesman Problem with Cumulative Costs. Networks 23, 81–91.
  10. The Minimum Latency Problem. In Proceedings of the 26th annual ACM symposium on Theory of computing, Montreal, Canada, pp. 163–171.
  11. A branch-and-price algorithm for the Minimum Latency Problem. Computers and Operations Research 93, 66–78.
  12. Routing for Relief Efforts. Transportation Science 42, 127–145.
  13. Paths, Trees, and Minimum Latency Tours. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, Cambridge, USA, pp. 36–45.
  14. A Polyhedral Approach to the Delivery Man Problem. Technical report, Eindhoven University of Technology.
  15. New formulations for the traveling repairman problem. In Proceedings of the 8th International Conference of Modeling and Simulation, Hammamet, Tunisia, pp. 1889–1894.
  16. Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization 6, 109–133.
  17. The Delivery Man Problem and Cumulative Matroids. Operations Research 41, 1055–1064.
  18. Efficiently Using Prefix-trees in Mining Frequent Itemsets. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Melbourne, USA, pp. 236–245.
  19. Extending the Hybridization of Metaheuristics with Data Mining: Dealing with Sequences. Intelligent Data Analysis 20, 1133–1156.
  20. Data Mining: Concepts and Techniques (third edn.). Morgan Kaufmann Publishers Inc., San Francisco, USA.
  21. Mining Frequent Patterns without Candidate Generation. In Proceedings of ACM SIGMOD’00, pp. 1–12.
  22. The Delivery Man Problem with time windows. Discrete Optimization 7, 269–282.
  23. Vehicle routing: handling edge exchanges. In Local Search in Combinatorial Optimization, Wiley, New York, pp. 337–360.
  24. Iterated local search. In Glover, F. and Kochenberger, G.A. (eds), Handbook of Metaheuristics, Springer, pp. 320–353.
  25. Time-dependent traveling salesman problem - the deliveryman case. Networks 20, 753–763.
  26. Heurísticas Híbridas com Mineração de Dados para o Problema de Roteamento de Veículos com Frota Heterogênea. Master’s thesis, Universidade Federal Fluminense.
  27. Large-step Markov Chains for the Traveling Salesman Problem. Complex Systems 5, 299–326.
  28. Making a State-of-the-art Heuristic Faster with Data Mining. Annals of Operations Research 263, 141–162.
  29. A new formulation for the Traveling Deliveryman Problem. Discrete Applied Mathematics 156, 3223–3237.
  30. Variable Neighborhood Search. Computers and Operations Research 24, 1097–1100.
  31. Variable neighborhood search for the travelling deliveryman problem. 4OR: A Quarterly Journal of Operations Research 11, 57–73.
  32. An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers and Operations Research 37, 1877–1885.
  33. Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic. Journal of Heuristics 20, 39–74.
  34. A Hybrid Data Mining Metaheuristic for the p -Median Problem. Statistical Analysis and Data Mining 4, 313–335.
  35. Hybridization of GRASP Metaheuristic with Data Mining Techniques. Journal of Mathematical Modelling and Algorithms 5, 23–41.
  36. Hybridization of GRASP Metaheuristics with Data Mining Techniques. In Proceedings of the ECAI Workshop on Hybrid Metaheuristics, pp. 69–78.
  37. Exploração de Estratégias de Busca Local em Ambientes CPU/GPU. Phd thesis, Universidade Federal Fluminense.
  38. Dynamic ng-Path Relaxation for the Delivery Man Problem. Transportation Science 48, 413–424.
  39. P-Complete Approximation Problems. Journal of the ACM 23, 555–565.
  40. Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR: A Quarterly Journal of Operations Research 9, 189–209.
  41. Experimental data from ‘Improving a State-of-the-Art Heuristic for the Minimum Latency Problem with Data Mining’. Available on http://dx.doi.org/10.17632/sxz37ssdbc.2.
  42. A Hybrid GRASP with Data Mining for Efficient Server Replication for Reliable Multicast. In IEEE Globecom 2006, pp. 1–6.
  43. A Hybrid GRASP with Data Mining for the Maximum Diversity Problem. In Proceedings of the International Workshop on Hybrid Metaheuristics, pp. 116–127.
  44. Nonparametric Statistics for the Behavioral Sciences. McGraw-Hill.
  45. A Simple and Effective Metaheuristic for the Minimum Latency Problem. European Journal of Operational Research 221, 513–520.
  46. A Parallel Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. Computers and Operations Research 37, 1899–1911.
  47. A Taxonomy of Hybrid Metaheuristics. Journal of Heuristics 8, 541–564.
  48. Timing Problems and Algorithms: Time Decisions for Sequences of Activities. Networks 62, 102–128.
  49. Efficient representative pattern mining based on weight and maximality conditions. Expert Systems 33, 439–462.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now