Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Less is more approach in optimization: a road to artificial intelligence

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The main idea of Less is more approach (LIMA) is using as fewer as possible ingredients to provide the best possible outcome. This approach has been used successfully almost in all the scientific and art disciplines. Recently, the idea has also been successfully explored in solving hard optimization problems. In this note we first define the dominance relation between two algorithms that includes their simplicity as well. Then we propose the general LIMA algorithm and discuss automatic ways to include common ingredients of all search algorithms, increasing the algorithms complexity in a systematic way. That kind of approach may represent a road from Optimization to Artificial Intelligence and Machine learning. Finally, we illustrate LIMA algorithm on two optimization problems and show its efficiency.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Data Availibility

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

References

  1. Amirgaliyeva, Z., Mladenović, N., Todosijević, R., Urošević, D.: Solving the maximum min-sum dispersion by alternating formulations of two different problems. Eur. J. Oper. Res. 260, 444–459 (2017)

    Article  MathSciNet  Google Scholar 

  2. Bannard, O.M., Cyster, J.G.: When less signaling is more. Science 336, 1120 (2012)

    Article  Google Scholar 

  3. Bassiri-Gharb, N.: Less can be more in functional materials. Science 369, 252 (2020)

    Article  Google Scholar 

  4. Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069–1072 (1990). https://doi.org/10.1057/jors.1990.166

    Article  Google Scholar 

  5. Bornholdt, S.: Less is more in modeling large genetic networks. Science 310, 449 (2005)

    Article  Google Scholar 

  6. Brimberg, J., Mladenović, N., Todosijević, R., Urošević, D.: Less is more: solving the max-mean diversity problem with variable neighborhood search. Inf. Sci. 382, 179 (2017)

    Article  Google Scholar 

  7. Chong, L.D.: Less is more. Science 331, 126 (2011)

    Article  Google Scholar 

  8. Davidović, T., Ramljak, D., Šelmić, M., Teodorović, D.: Bee colony optimization for the \(p\)-center problem. Comput. Oper. Res. 38, 1367–1376 (2011)

    Article  MathSciNet  Google Scholar 

  9. Duarte, A., Sánchez-Oro, J., Resende, M.G., Glover, F., Martí, R.: Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization. Inf. Sci. 296, 46 (2015)

    Article  MathSciNet  Google Scholar 

  10. Elloumi, S., Labbe, M., Pochet, Y.: New formulation and resolution method for the p-center problem. INFORMS J. Comput. 16, 84–94 (2004)

    Article  MathSciNet  Google Scholar 

  11. Ferone, D., Festa, P., Napoletano, A., Resende, M.: A new local search for the p-center [roblem based on the critical vertex concept. In: R. Battiti, D.E. Kvasov, Y.D. Sergeyev (eds.) Proceedings of 11th International Conference on Learning and Intelligent Optimization (LION 11), Lecture Notes in Computer Science 10556, pp. 79–92. Springer (2017)

  12. Gonçalves Silva, K., Aloise, D., Xavier-de-Souza, S., Mladenović, N.: Less is more: simplified Nelder-Mead method for large unconstrained optimization. Yugoslav J. Operat. Res. 28, 153–169 (2018)

    Article  MathSciNet  Google Scholar 

  13. Hansen, P., Mladenović, N., Brimberg, J., Pérez, J.A.M.: Variable neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 272. Springer, Cham (2019)

  14. Imran, A., Salhi, S., Wassan, N.A.: A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Eur. J. Oper. Res. 197, 509–518 (2009)

    Article  Google Scholar 

  15. Kaiser, J.: When less is more. Science 355, 1144 (2017)

    Article  Google Scholar 

  16. McCartney, M.: Less is more. Science 334, 878 (2011)

    Google Scholar 

  17. Mladenović, N., Alkandari, A., Pei, J., Todosijević, R., Pardalos, P.M.: Less is more approach: basic variable neighborhood search for the obnoxious p-median problem. Int. Trans. Oper. Res. 27, 480–493 (2020)

    Article  MathSciNet  Google Scholar 

  18. Mladenović, N., Labbe, M., Hansen, P.: Solving the \(p\)-center problem with tabu search and variable neighborhood search. Networks 42, 48–64 (2003)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  20. Mladenović, N., Mussabayev, R., Urošević, D.: Less is more approach for the \(p\)-center problem (submitted)

  21. Mladenović, N., Plastria, F., Urošević, D.: Formulation space search for circle packing problems international workshop on engineering stochastic local search algorithms SLS 2007 engineering stochastic local search algorithms. Des. Implement. Anal. Eff. Heuristics Lect. Notes Comput. Sci. 4638, 212–216 (2007)

  22. Mladenović, N., Todosijević, R., Urošević, D.: Less is more: basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326, 160–171 (2016)

    Article  Google Scholar 

  23. Mladenović, N., Urošević, D., Pérez-Brito, D., García-González, C.G.: Variable neighbourhood search for bandwidth reduction. Eur. J. Oper. Res. 200, 14–27 (2010)

    Article  MathSciNet  Google Scholar 

  24. Pardo, E., Mladenović, N., Pantrigo, J., Duarte, A.: Variable formulation search for the cutwidth minimization problem. Appl. Soft Comput. 13, 2242–2252 (2013)

    Article  Google Scholar 

  25. Prokopyev, O.A., Kong, N., Martinez-Torres, D.L.: The equitable dispersion problem. Eur. J. Oper. Res. 197, 59–67 (2009)

    Article  MathSciNet  Google Scholar 

  26. Salhi, S.: Heuristic Search: The Emerging Science of Problem Solving. Springer (2017)

  27. Salhi, S., Imran, A., Wassan, N.A.: The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation. Comput. Oper. Res. 52, 315–325 (2014)

    Article  MathSciNet  Google Scholar 

  28. Shi, L.Z.: Less is more for adoptive immunotherapy? Sci. Transl. Med. 12,(2020)

Download references

Acknowledgements

The work of N. Mladenovic is partially supported by the Khalifa University of Science and Technology under Award No. RC2 DSO, and by the Committee of Science of Ministry of Education and Science of the Republic of Kazakhstan under the grant number AP08856034. The work of P.M. Pardalos was conducted within the framework of the Basic Research Program at the National Research University Higher School of Economics (HSE).The work of D. Urosevic is partially supported by the Serbian Ministry of Education, Science and Technological Development through Mathematical Institute of the Serbian Academy of Sciences and Arts.

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Khalifa University, Abu Dhabi, UAE

    Nenad Mladenović

  2. School of Management, Hefei University of Technology, Hefei, China

    Nenad Mladenović & Jun Pei

  3. University of Florida, Gainesville, USA

    Panos M. Pardalos

  4. LATNA, Higher School of Economics, Moscow, Russia

    Panos M. Pardalos

  5. Mathematical Institute of the Serbian Academy of Sciences and Arts, Belgrade, Serbia

    Dragan Urošević

Authors
  1. Nenad Mladenović
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun Pei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dragan Urošević
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nenad Mladenović.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mladenović, N., Pei, J., Pardalos, P.M. et al. Less is more approach in optimization: a road to artificial intelligence. Optim Lett 16, 409–420 (2022). https://doi.org/10.1007/s11590-021-01818-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-021-01818-w

Keywords

Search

Navigation