Advertisement

Program Trace Optimization with Constructive Heuristics for Combinatorial Problems

  • James McDermottEmail author
  • Alberto Moraglio
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11452)

Abstract

Program Trace Optimisation (PTO), a highly general optimisation framework, is applied to a range of combinatorial optimisation (COP) problems. It effectively combines “smart” problem-specific constructive heuristics and problem-agnostic metaheuristic search, automatically and implicitly designing problem-appropriate search operators. A weakness is identified in PTO’s operators when applied in conjunction with smart heuristics on COP problems, and an improved method is introduced to address this. To facilitate the comparison of this new method with the original, across problems, a common format for PTO heuristics (known as generators) is demonstrated, mimicking GRASP. This also facilitates comparison of the degree of greediness (the GRASP \(\alpha \) parameter) in the heuristics. Experiments across problems show that the novel operators consistently outperform the original without any loss of generality or cost in CPU time; hill-climbing is a sufficient metaheuristic; and intermediate levels of greediness are usually best.

Keywords

Constructive heuristics GRASP Search operators 

Notes

Acknowledgements

Thanks to Carlos Fonseca for discussion and to anonymous reviewers. This work was carried out while JMcD was at University College Dublin.

References

  1. 1.
    Moraglio, A., McDermott, J.: Program trace optimization. In: Auger, A., Fonseca, C.M., Lourenço, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018, Part II. LNCS, vol. 11102, pp. 334–346. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-99259-4_27CrossRefGoogle Scholar
  2. 2.
    Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109–133 (1995)MathSciNetCrossRefGoogle Scholar
  3. 3.
    McDermott, J., Carroll, P.: Program optimisation with dependency injection. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.Ş., Hu, B. (eds.) EuroGP 2013. LNCS, vol. 7831, pp. 133–144. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-37207-0_12CrossRefGoogle Scholar
  4. 4.
    Juan, A.A., Faulin, J., Ferrer, A., Lourenço, H.R., Barrios, B.: MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems. TOP 21(1), 109–132 (2013)MathSciNetCrossRefGoogle Scholar
  5. 5.
    de Armas, J., Keenan, P., Juan, A.A., McGarraghy, S.: Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics. Ann. Oper. Res. 273(1–2), 135–162 (2019)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Ahuja, R.K., Orlin, J.B., Tiwari, A.: A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. 27(10), 917–934 (2000)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154–160 (1994)CrossRefGoogle Scholar
  8. 8.
    Wingate, D., Stuhlmueller, A., Goodman, N.: Lightweight implementations of probabilistic programming languages via transformational compilation. In: Gordon, G., et al. (eds.) AISTATS. PMLR, vol. 15, pp. 770–778, 11–13 April 2011Google Scholar
  9. 9.
    Moraglio, A.: Towards a geometric unification of evolutionary algorithms. Ph.D. thesis, University of Essex (2008)Google Scholar
  10. 10.
    Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. Ph.D. thesis, University of New Mexico, Albuquerque (1995)Google Scholar
  11. 11.
    Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Manage. Sci. 34, 391–401 (1988)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Yamada, T., Nakano, R.: A genetic algorithm applicable tolarge-scale job-shop instances. In: Manner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, vol. 2, pp. 281–290. North-Holland, Amsterdam (1992)Google Scholar
  13. 13.
    Bierwirth, C., Kuhpfahl, J.: Extended GRASP for the job shop scheduling problem with total weighted tardiness objective. Eur. J. Oper. Res. 261(3), 835–848 (2017)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Waddington, C.H.: Canalization of development and the inheritance of acquired characters. Nature 150(3811), 563 (1942)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.National University of IrelandGalwayIreland
  2. 2.University of ExeterExeterUK

Personalised recommendations