IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v54y2012i2p405-429.html
   My bibliography  Save this article

Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms

Author

Listed:
  • Celso Ribeiro
  • Isabel Rosseti
  • Reinaldo Vallejos

Abstract

Run time distributions or time-to-target plots are very useful tools to characterize the running times of stochastic algorithms for combinatorial optimization. We further explore run time distributions and describe a new tool to compare two algorithms based on stochastic local search. For the case where the running times of both algorithms fit exponential distributions, we derive a closed form index that gives the probability that one of them finds a solution at least as good as a given target value in a smaller computation time than the other. This result is extended to the case of general run time distributions and a numerical iterative procedure is described for the computation of the above probability value. Numerical examples illustrate the application of this tool in the comparison of different sequential and parallel algorithms for a number of distinct problems. Copyright Springer Science+Business Media, LLC. 2012

Suggested Citation

  • Celso Ribeiro & Isabel Rosseti & Reinaldo Vallejos, 2012. "Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms," Journal of Global Optimization, Springer, vol. 54(2), pages 405-429, October.
  • Handle: RePEc:spr:jglopt:v:54:y:2012:i:2:p:405-429
    DOI: 10.1007/s10898-011-9769-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-011-9769-z
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10898-011-9769-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lawrence J. Osborne & Billy E. Gillett, 1991. "A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks," INFORMS Journal on Computing, INFORMS, vol. 3(3), pages 213-225, August.
    2. Thomas A. Feo & Mauricio G. C. Resende & Stuart H. Smith, 1994. "A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set," Operations Research, INFORMS, vol. 42(5), pages 860-878, October.
    3. Abilio Lucena & Celso Ribeiro & Andréa Santos, 2010. "A hybrid heuristic for the diameter constrained minimum spanning tree problem," Journal of Global Optimization, Springer, vol. 46(3), pages 363-381, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Julliany S. Brandão & Thiago F. Noronha & Celso C. Ribeiro, 2016. "A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks," Journal of Global Optimization, Springer, vol. 65(4), pages 813-835, August.
    2. Wang, Yang & Wu, Qinghua & Glover, Fred, 2017. "Effective metaheuristic algorithms for the minimum differential dispersion problem," European Journal of Operational Research, Elsevier, vol. 258(3), pages 829-843.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    2. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Herrán, Alberto & Manuel Colmenar, J. & Duarte, Abraham, 2021. "An efficient variable neighborhood search for the Space-Free Multi-Row Facility Layout problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 893-907.
    4. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    5. Mario Pavone & Giuseppe Narzisi & Giuseppe Nicosia, 2012. "Clonal selection: an immunological algorithm for global optimization over continuous spaces," Journal of Global Optimization, Springer, vol. 53(4), pages 769-808, August.
    6. Parreño, Francisco & Pacino, Dario & Alvarez-Valdes, Ramon, 2016. "A GRASP algorithm for the container stowage slot planning problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 141-157.
    7. Alejandra Casado & Sergio Pérez-Peló & Jesús Sánchez-Oro & Abraham Duarte, 2022. "A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem," Journal of Heuristics, Springer, vol. 28(1), pages 121-146, February.
    8. Da Kuang & Sangwoon Yun & Haesun Park, 2015. "SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering," Journal of Global Optimization, Springer, vol. 62(3), pages 545-574, July.
    9. Drexl, Andreas & Salewski, Frank, 1996. "Distribution Requirements and Compactness Constraints in School Timetabling. Part II: Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 384, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Wolfgang Steitz, 2015. "New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 151-163, February.
    12. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    13. Jan Mikula & Miroslav Kulich, 2022. "Solving the traveling delivery person problem with limited computational time," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(4), pages 1451-1481, December.
    14. Colombi, Marco & Mansini, Renata & Savelsbergh, Martin, 2017. "The generalized independent set problem: Polyhedral analysis and solution approaches," European Journal of Operational Research, Elsevier, vol. 260(1), pages 41-55.
    15. J. Terán-Villanueva & Héctor Fraire Huacuja & Juan Carpio Valadez & Rodolfo Pazos Rangel & Héctor Puga Soberanes & José Martínez Flores, 2015. "A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems," Computational Optimization and Applications, Springer, vol. 62(3), pages 787-814, December.
    16. Sacramento Quintanilla & Francisco Ballestín & Ángeles Pérez, 2020. "Mathematical models to improve the current practice in a Home Healthcare Unit," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 43-74, March.
    17. Sebastian Kling & Sebastian Kraul & Jens O. Brunner, 2024. "Customized GRASP for rehabilitation therapy scheduling with appointment priorities and accounting for therapist satisfaction," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(3), pages 821-872, September.
    18. Duarte, Abraham & Martí, Rafael & Álvarez, Ada & Ángel-Bello, Francisco, 2012. "Metaheuristics for the linear ordering problem with cumulative costs," European Journal of Operational Research, Elsevier, vol. 216(2), pages 270-277.
    19. Fernando Stefanello & Vaneet Aggarwal & Luciana S. Buriol & Mauricio G. C. Resende, 2019. "Hybrid algorithms for placement of virtual machines across geo-separated data centers," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 748-793, October.
    20. Serigne Gueye & Philippe Michelon, 2005. "“Miniaturized” Linearizations for Quadratic 0/1 Problems," Annals of Operations Research, Springer, vol. 140(1), pages 235-261, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:2:p:405-429. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.