IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v37y2019i4d10.1007_s10878-018-0357-8.html
   My bibliography  Save this article

Estimating the number of basins of attraction of multi-objective combinatorial problems

Author

Listed:
  • Madalina M. Drugan

    (ITLearns.Online)

Abstract

The efficiency of local search is proportional to the number and the distribution of basins of attraction. Often combinatorial optimisation problems have a large number of local optima, uncountable with available computational resources. Approximating the number of basins of attraction and the minimal number of samples for visiting all basins at least once are complex problems for which we assume specific distributions of basins of attraction. We define two types of basins of attraction of multi-objective combinatorial optimisation problems with complementary properties. Acknowledging that each local search run generates a Pareto front of solutions, either each Pareto local solution corresponds to a basin of attraction, or a Pareto basin matches an entire Pareto local front. Simulations compare parametric and non-parametric estimators on bi-objective quadratic assignment problem instances.

Suggested Citation

  • Madalina M. Drugan, 2019. "Estimating the number of basins of attraction of multi-objective combinatorial problems," Journal of Combinatorial Optimization, Springer, vol. 37(4), pages 1367-1407, May.
  • Handle: RePEc:spr:jcomop:v:37:y:2019:i:4:d:10.1007_s10878-018-0357-8
    DOI: 10.1007/s10878-018-0357-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0357-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-018-0357-8?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. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
    2. C R Reeves & A V Eremeev, 2004. "Statistical analysis of local search landscapes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 687-693, July.
    3. Paquete, Luis & Stutzle, Thomas, 2006. "A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices," European Journal of Operational Research, Elsevier, vol. 169(3), pages 943-959, 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. Zhiguo Wang & Lufei Huang & Cici Xiao He, 2021. "A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 785-812, November.
    2. Zhiguo Wang & Lufei Huang & Cici Xiao He, 0. "A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-28.
    3. Mihael Baketarić & Marjan Mernik & Tomaž Kosar, 2021. "Attraction Basins in Metaheuristics: A Systematic Mapping Study," Mathematics, MDPI, vol. 9(23), pages 1-25, November.

    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. Krešimir Mihić & Kevin Ryan & Alan Wood, 2018. "Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 295-308, May.
    2. Andrzej Jaszkiewicz & Thibaut Lust, 2017. "Proper balance between search towards and along Pareto front: biobjective TSP case study," Annals of Operations Research, Springer, vol. 254(1), pages 111-130, July.
    3. Huizhen Zhang & Cesar Beltran-Royo & Liang Ma, 2013. "Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers," Annals of Operations Research, Springer, vol. 207(1), pages 261-278, August.
    4. Dubois-Lacoste, Jérémie & López-Ibáñez, Manuel & Stützle, Thomas, 2015. "Anytime Pareto local search," European Journal of Operational Research, Elsevier, vol. 243(2), pages 369-385.
    5. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2015. "Solving the planar p-median problem by variable neighborhood and concentric searches," Journal of Global Optimization, Springer, vol. 63(3), pages 501-514, November.
    6. Peter Hahn & J. MacGregor Smith & Yi-Rong Zhu, 2010. "The Multi-Story Space Assignment Problem," Annals of Operations Research, Springer, vol. 179(1), pages 77-103, September.
    7. Nyberg, Axel & Westerlund, Tapio, 2012. "A new exact discrete linear reformulation of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 314-319.
    8. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    9. Zvi Drezner & Alfonsas Misevičius & Gintaras Palubeckis, 2015. "Exact algorithms for the solution of the grey pattern quadratic assignment problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 85-105, August.
    10. Monique Guignard, 2020. "Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints," Annals of Operations Research, Springer, vol. 286(1), pages 173-200, March.
    11. Jingyang Zhou & Peter E.D. Love & Kok Lay Teo & Hanbin Luo, 2017. "An exact penalty function method for optimising QAP formulation in facility layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2913-2929, May.
    12. Martí, Rafael & Campos, Vicente & Resende, Mauricio G.C. & Duarte, Abraham, 2015. "Multiobjective GRASP with Path Relinking," European Journal of Operational Research, Elsevier, vol. 240(1), pages 54-71.
    13. Jooken, Jorik & Leyman, Pieter & De Causmaecker, Patrick, 2023. "Features for the 0-1 knapsack problem based on inclusionwise maximal solutions," European Journal of Operational Research, Elsevier, vol. 311(1), pages 36-55.
    14. Luis Paquete & Tommaso Schiavinotto & Thomas Stützle, 2007. "On local optima in multiobjective combinatorial optimization problems," Annals of Operations Research, Springer, vol. 156(1), pages 83-97, December.
    15. Mădălina M. Drugan, 2015. "Generating QAP instances with known optimum solution and additively decomposable cost function," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1138-1172, November.
    16. James, Tabitha & Rego, Cesar & Glover, Fred, 2009. "A cooperative parallel tabu search algorithm for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 810-826, June.
    17. Mădălina M. Drugan, 2018. "Scaling-up many-objective combinatorial optimization with Cartesian products of scalarization functions," Journal of Heuristics, Springer, vol. 24(2), pages 135-172, April.
    18. Zhuoxuan Jiang & Xinyuan Zhao & Chao Ding, 2021. "A proximal DC approach for quadratic assignment problem," Computational Optimization and Applications, Springer, vol. 78(3), pages 825-851, April.
    19. Paul, G., 2011. "An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 209(3), pages 215-218, March.
    20. Jaszkiewicz, Andrzej, 2018. "Many-Objective Pareto Local Search," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1001-1013.

    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:jcomop:v:37:y:2019:i:4:d:10.1007_s10878-018-0357-8. 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.