Skip to main content

Metaheuristic Solver for Problems with Permutative Representation

  • Conference paper
  • First Online:
Intelligent Computing & Optimization (ICO 2022)

Abstract

Today, a large proportion of combinatorial optimization problems can be efficiently formulated as a mixed-integer program and solved with an exact solver. However, exact solvers do not scale well and thus custom metaheuristic algorithms are being designed to provide better scalability at the cost of no optimality guarantees and time-consuming development. This paper proposes a novel formalism for a large class of problems with permutative representation, together with a metaheuristic solver addressing these problems. This approach combines the advantages of both exact and metaheuristic solvers: straightforward problem formulation, scalability, low design time, and ability to find high quality solutions. Three different problems are formulated in the proposed formalism and solved with the proposed solver. The solver is benchmarked against the Gurobi Optimizer and significantly outperforms it in experiments with a fixed computational budget.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Benavides, A.J., Ritt, M.: Fast heuristics for minimizing the makespan in non-permutation flow shops. Comput. Oper. Res. 100, 230–243 (2018)

    Article  MathSciNet  Google Scholar 

  2. Blot, A., Hoos, H.H., Jourdan, L., Kessaci-Marmion, M.É., Trautmann, H.: MO-ParamILS: a multi-objective automatic algorithm configuration framework. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) LION 2016. LNCS, vol. 10079, pp. 32–47. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-50349-3_3

    Chapter  Google Scholar 

  3. Burkard, R., Çela, E., Karisch, S., Rendl, F.: QAPLIB (2012). https://coral.ise.lehigh.edu/data-sets/qaplib/

  4. De Beukelaer, H., Davenport, G.F., De Meyer, G., Fack, V.: JAMES: an object-oriented Java framework for discrete optimization using local search metaheuristics. Softw. Pract. Experience 47(6), 921–938 (2017)

    Article  Google Scholar 

  5. Deshwal, A., Belakaria, S., Doppa, J.R., Kim, D.H.: Bayesian optimization over permutation spaces. In: Proceedings of the AAAI Conference, vol. 36, no. 6, pp. 6515–6523 (2022)

    Google Scholar 

  6. Dreo, J., et al.: Paradiseo: from a modular framework for evolutionary computation to the automated design of metaheuristics: 22 years of Paradiseo. In: GECCO 2021 Companion, pp. 1522–1530. Association for Computing Machinery, Inc. (2021)

    Google Scholar 

  7. Duarte, A., Sánchez-Oro, J., Mladenović, N., Todosijević, R.: Variable neighborhood descent. In: Martí, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 341–367. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-07124-4_9

    Chapter  Google Scholar 

  8. Hadka, D., Reed, P.M., Simpson, T.W.: Diagnostic assessment of the borg MOEA for many-objective product family design problems. In: 2012 IEEE Congress on Evolutionary Computation, CEC 2012 (2012)

    Google Scholar 

  9. Helsgaun, K.: An extension of the LKH TSP solver for constrained TSP and VRP. Technical report, Roskilde University (2017)

    Google Scholar 

  10. Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507–523. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25566-3_40

    Chapter  Google Scholar 

  11. Lima, I.: CVRPLIB (2014). http://vrp.galgos.inf.puc-rio.br/

  12. López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Birattari, M., Stützle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)

    MathSciNet  Google Scholar 

  13. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 129–168. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-91086-4_5

    Chapter  Google Scholar 

  14. Mehdi, M.: Parallel hybrid optimization methods for permutation based problems. Ph.D. thesis, Université des Sciences et Technologie de Lille (2011)

    Google Scholar 

  15. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  Google Scholar 

  16. Moghadam, B.F., Sadjadi, S.J., Seyedhosseini, S.M.: Comparing mathematical and heuristic methods for robust VRP. IJRRAS 2(2), 108–116 (2010)

    MATH  Google Scholar 

  17. Parejo, J.A., Ruiz-Cortés, A., Lozano, S., Fernandez, P.: Metaheuristic optimization frameworks: a survey and benchmarking. Soft. Comput. 16(3), 527–561 (2012)

    Article  Google Scholar 

  18. Scott, E.O., Luke, S.: ECJ at 20: toward a general metaheuristics toolkit. In: GECCO 2019 Companion, pp. 1391–1398. ACM (2019)

    Google Scholar 

  19. Stützle, T., López-Ibáñez, M.: Automated design of metaheuristic algorithms. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 541–579. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-91086-4_17

    Chapter  Google Scholar 

  20. Vallada, E., Ruiz, R., Framinan, J.M.: New hard benchmark for flowshop scheduling problems minimising makespan. Eur. J. Oper. Res. 240(3), 666–677 (2015)

    Article  Google Scholar 

  21. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658–673 (2014)

    Article  MathSciNet  Google Scholar 

  22. Woller, D.: Permutator github repository (2022). https://github.com/wolledav/permutator

  23. Xia, Y., Yuan, Y.X.: A new linearization method for quadratic assignment problems. Optim. Methods Softw. 21(5), 805–818 (2006)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work has been supported by the European Regional Development Fund under the project Robotics for Industry 4.0 (reg. no. CZ.02.1.01/0.0/0.0/15 003/0000470). The work of David Woller has been also supported by the Grant Agency of the Czech Technical University in Prague, grant No. SGS21/185/OH K3/3T/37 and by the Czech Science Foundation (GACR) under Grant Agreement 19-26143X. Computational resources were supplied by the project“e-Infrastruktura CZ” (e-INFRA CZ LM2018140) supported by the Ministry of Education, Youth and Sports of the Czech Republic.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Woller .

Editor information

Editors and Affiliations

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

Woller, D., Hrazdíra, J., Kulich, M. (2023). Metaheuristic Solver for Problems with Permutative Representation. In: Vasant, P., Weber, GW., Marmolejo-Saucedo, J.A., Munapo, E., Thomas, J.J. (eds) Intelligent Computing & Optimization. ICO 2022. Lecture Notes in Networks and Systems, vol 569. Springer, Cham. https://doi.org/10.1007/978-3-031-19958-5_5

Download citation

Publish with us

Policies and ethics