Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A random-key GRASP for combinatorial optimization (2405.18681v2)

Published 29 May 2024 in cs.NE, cs.AI, and math.OC

Abstract: This paper proposes a problem-independent GRASP metaheuristic using the random-key optimizer (RKO) paradigm. GRASP (greedy randomized adaptive search procedure) is a metaheuristic for combinatorial optimization that repeatedly applies a semi-greedy construction procedure followed by a local search procedure. The best solution found over all iterations is returned as the solution of the GRASP. Continuous GRASP (C-GRASP) is an extension of GRASP for continuous optimization in the unit hypercube. A random-key optimizer (RKO) uses a vector of random keys to encode a solution to a combinatorial optimization problem. It uses a decoder to evaluate a solution encoded by the vector of random keys. A random-key GRASP is a C-GRASP where points in the unit hypercube are evaluated employing a decoder. We describe random key GRASP consisting of a problem-independent component and a problem-dependent decoder. As a proof of concept, the random-key GRASP is tested on five NP-hard combinatorial optimization problems: traveling salesman problem, tree of hubs location problem, Steiner triple covering problem, node capacitated graph partitioning problem, and job sequencing and tool switching problem.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (59)
  1. A tabu search based algorithm for minimizing the number of tool switches on a flexible machine. Computers & Industrial Engineering, 44(1):35–47, 2003.
  2. Deep memetic models for combinatorial optimization problems: application to the tool switching problem. Memetic Computing, 12(1):3–22, 2020.
  3. The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications. European Journal of Operational Research, 289(1):17–30, 2021.
  4. J. F. Bard. A heuristic for minimizing the number of tool switches on a flexible machine. IIE Transactions, 20(4):382–391, 1988.
  5. J. C. Bean. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2):154–160, 1994.
  6. An adaptive and near parameter-free BRKGA using Q𝑄Qitalic_Q-learning method. In 2021 IEEE Congress on Evolutionary Computation (CEC), pages 2331–2338, 2021.
  7. Hybrid method with cs and brkga applied to the minimization of tool switches problem. Computers & Operations Research, 67:174–183, 2016.
  8. Tight bounds from a path based formulation for the tree of hub location problem. Computers & Operations Research, 36(12):3117–3127, 2009.
  9. The tree of hubs location problem. European Journal of Operational Research, 202(2):390–400, 2010. ISSN 0377-2217. doi: https://doi.org/10.1016/j.ejor.2009.05.044.
  10. Minimizing the number of tool switches on a flexible machine. International Journal of Flexible Manufacturing Systems, 6:33–54, 1994.
  11. A new multicommodity flow model for the job sequencing and tool switching problem. International Journal of Production Research, 59(12):3617–3632, 2021.
  12. Solution of a large-scale traveling-salesman problem. Math. Programm. Study, 2:393–410, 1954.
  13. L. D. Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.
  14. An improved Benders decomposition algorithm for the tree of hubs location problem. European Journal of Operational Research, 226(2):185–202, 2013.
  15. Exact and heuristic algorithms for the design of hub networks with multiple lines. European Journal of Operational Research, 246(1):186–198, 2015.
  16. Y. Deng and J.F. Bard. A reactive grasp with path relinking for capacitated clustering. Journal of Heuristics, 17:119–152, 2011. doi: https://doi.org/10.1007/s10732-010-9129-z.
  17. Benchmarking optimization software with performance profiles. Mathematical programming, 91:201–213, 2002.
  18. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8:67–71, 1989a.
  19. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(1):109–133, 1995.
  20. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8(2):67–71, 1989b. ISSN 0167-6377. doi: https://doi.org/10.1016/0167-6377(89)90002-3. URL https://www.sciencedirect.com/science/article/pii/0167637789900023.
  21. The node capacitated graph partitioning problem: a computational study. Math. Program., 81:229–256, 1998.
  22. Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of steiner triple systems. Journal of the Operations Research Society of America, 2:72–81, 1974.
  23. Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem. Networks: An International Journal, 55(4):379–385, 2010.
  24. Biased random-key genetic algorithms for combinatorial optimization. Journal of Heuristics, 17(1):487–525, 2011.
  25. G. Gutin and A. P. Punnen. The traveling salesman problem and its variations, volume 12. Springer Science & Business Media, 2006.
  26. Global optimization by continuous GRASP. Optimization Letters, 1:201–212, 2007.
  27. Speeding up continuous GRASP. European J. of Operational Research, 205:507–521, 2010.
  28. Correspondence of projected 3-d points and lines using a continuous grasp. International Transactions in Operational Research, 18(4):493–511, 2011.
  29. An interior point algorithm to solve computationally difficult set covering problems. Mathematical Programming, 52:597–618, 1991. doi: https://doi.org/10.1007/BF01582907.
  30. B. Kayışoğlu and İ. Akgün. Multiple allocation tree of hubs location problem for non-complete networks. Computers & Operations Research, 136:105478, 2021.
  31. Optimization by direct search: New perspectives on some classical and modern methods. SIAM review, 45(3):385–482, 2003.
  32. Exact algorithms for the job sequencing and tool switching problem. IIE Transactions, 36(1):37–45, 2004.
  33. Meta-heurísticas via chaves aleatórias aplicadas ao problema de localização de hubs em árvore. In Anais do Simpósio Brasileiro de Pesquisa Operacional, São José dos Campos, 2023. Galoá.
  34. Solving hard set covering problems. Operations Research Letters, 18(1):1–5, 1995. ISSN 0167-6377. doi: https://doi.org/10.1016/0167-6377(95)00034-H. URL https://www.sciencedirect.com/science/article/pii/016763779500034H.
  35. A simple and effective hybrid genetic search for the job sequencing and tool switching problem. Computers & Operations Research, 127:105153, 2021.
  36. Cliques and clustering: A combinatorial approach. Operations Research Letters, 22(1):1–12, 1998. ISSN 0167-6377. doi: https://doi.org/10.1016/S0167-6377(98)00006-6. URL https://www.sciencedirect.com/science/article/pii/S0167637798000066.
  37. N. Mladenović and P. Hansen. Variable neighborhood search. Computers & Operations Research, 24(11):1097–1100, 1997.
  38. J. A. Nelder and R. Mead. A simplex method for function minimization. The Computer Journal, 7(4):308–313, 1965.
  39. An introduction to the theory of numbers. John Wiley & Sons, 1991.
  40. Michiel A. Odijk and Hans van Maaren. Improved solutions to the steiner triple covering problem. Inf. Process. Lett., 65(2):67–69, 1998. doi: 10.1016/S0020-0190(97)80440-1. URL http://dx.doi.org/10.1016/S0020-0190(97)80440-1.
  41. A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation. Optimization Methods and Software, 37(3):1065–1086, 2022.
  42. Solving large steiner triple covering problems. Technical Report 1663, Computer Sciences Department, University of Wisconsin, Madison, 1663, 2009.
  43. Solving steiner triple covering problems. Optima, 1663, 2010.
  44. Improved heuristic algorithms for the job sequencing and tool switching problem. Computers & Operations Research, 88:208–219, 2017.
  45. An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, 19:201–232, 2013.
  46. A biased random-key genetic algorithm for the tree of hubs location problem. Optimization Letters, 11:1371–1384, 2017.
  47. C. Privault and G. Finke. k𝑘kitalic_k-server problems with bulk requests: An application to tool switching in manufacturing. Annals of Operations Research, 96(1):255–269, 2000.
  48. G. Reinelt. The traveling salesman: Computational solutions for TSP applications, volume 840. Springer, 2003.
  49. Optimization by GRASP: Greedy randomized adaptive search procedures. Springer Nature, 2016.
  50. Optimization of robot trajectory planning with nature-inspired and hybrid quantum algorithms. Physical Review Applied, 18(5), 2022.
  51. S. Siegal. Nonparametric statistics for the behavioral sciences. McGraw-hill, 1956.
  52. A Python/C library for bound-constrained global optimization with continuous GRASP. Optimization Letters, 7:967–984, 2013.
  53. W. M. Spears and K. A. De Jong. On the virtues of parameterised uniform crossover. In Proceedings of the 4th International Conference on Genetic Algorithms, pages 230–236, San Diego, California, 1991.
  54. Models arising from a flexible manufacturing machine, Part I: Minimization of the number of tool switches. Operations Research, 36(5):767–777, 1988.
  55. A C++ application programming interface for biased random-key genetic algorithms. Optimization Methods and Software, 30(1):81–93, 2015.
  56. C. Tsallis and D. A. Stariolo. Generalized simulated annealing. Physica A: Statistical Mechanics and its Applications, 233(1):395–406, 1996.
  57. Generalized simulated annealing algorithm and its application to the Thomson model. Physics Letters A, 233(3):216–220, 1997.
  58. A beam-search-based algorithm for the tool switching problem on a flexible machine. The International Journal of Advanced Manufacturing Technology, 25:876–882, 2005.
  59. Russian doll search for the steiner triple covering problem. Optimization Letter, 5:631–638, 2011. doi: https://doi.org/10.1007/s11590-010-0225-7.

Summary

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

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

Tweets