iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-031-62922-8_25
Two Examples for the Usefulness of STNWeb for Analyzing Optimization Algorithm Behavior | SpringerLink
Skip to main content

Two Examples for the Usefulness of STNWeb for Analyzing Optimization Algorithm Behavior

  • Conference paper
  • First Online:
Metaheuristics (MIC 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14754))

Included in the following conference series:

  • 190 Accesses

Abstract

Search Trajectory Networks (STNs) are visualizations of directed graphs designed to analyze the behavior of stochastic optimization algorithms such as metaheuristics. Their purpose is to provide researchers with a tool that allows them to gain a deeper understanding of the behavior exhibited by multiple algorithms when applied to a specific instance of an optimization problem. In this short paper, we present two examples of our work in which STN graphics have helped us to discover interesting and useful algorithm/problem characteristics.

The research presented in this paper was supported by grants TED2021-129319B-I00 and PID2022-136787NB-I00 funded by MCIN/AEI/10.13039/501100011033.

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

Access this chapter

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

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

Similar content being viewed by others

Notes

  1. 1.

    In this context, understanding the nature of these algorithms is not crucial.

  2. 2.

    https://igraph.org/.

References

  1. Akbay, M.A., Kalayci, C.B., Blum, C.: Application of adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries. In: Pérez Cáceres, L., Stützle, T. (eds.) Evolutionary Computation in Combinatorial Optimization. LNCS, pp. 16–33. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-30035-6_2

    Chapter  Google Scholar 

  2. Akbay, M.A., López Serrano, A., Blum, C.: A self-adaptive variant of CMSA: application to the minimum positive influence dominating set problem. Int. J. Comput. Intell. Syst. 15(1), 44 (2022)

    Article  Google Scholar 

  3. Blum, C.: Construct. Merge. Solve & Adapt. Springer, Cham (2024). in press

    Google Scholar 

  4. Blum, C., Pinacho Davidson, P., López-Ibáñez, M., Lozano, J.A.: Construct, merge, solve & adapt: a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75–88 (2016)

    Article  MathSciNet  Google Scholar 

  5. Chacón Sartori, C., Blum, C., Ochoa, G.: STNWeb: a new visualization tool for analyzing optimization algorithms. Softw. Impacts 17, 100558 (2023)

    Article  Google Scholar 

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

    MathSciNet  Google Scholar 

  7. Michel, G., Potvin, J.Y. (eds.): Handbook of Metaheuristics, Series in Operations Research & Management Science, vol. 272, 3rd edn. Springer, Switzerland (2019)

    Google Scholar 

  8. Ochoa, G., Malan, K.M., Blum, C.: Search trajectory networks: a tool for analysing and visualising the behaviour of metaheuristics. Appl. Soft Comput. 109, 107492 (2021)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mehmet Anıl Akbay .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 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

Akbay, M.A., Blum, C. (2024). Two Examples for the Usefulness of STNWeb for Analyzing Optimization Algorithm Behavior. In: Sevaux, M., Olteanu, AL., Pardo, E.G., Sifaleras, A., Makboul, S. (eds) Metaheuristics. MIC 2024. Lecture Notes in Computer Science, vol 14754. Springer, Cham. https://doi.org/10.1007/978-3-031-62922-8_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-62922-8_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-62921-1

  • Online ISBN: 978-3-031-62922-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics