IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v38y2019i4d10.1007_s10878-019-00445-7.html
   My bibliography  Save this article

Random walk’s correlation function for multi-objective NK landscapes and quadratic assignment problem

Author

Listed:
  • Madalina M. Drugan

    (ITLearns.Online)

Abstract

The random walk’ correlation matrix of multi-objective combinatorial optimization problems utilizes both local structure and general statistics of the objective functions. Reckoning time of correlation, or the random walk of lag 0, is quadratic in problem size L and number of objectives D. The computational complexity of the correlation coefficients of mNK is $$O(D^2 K^2 L)$$ O ( D 2 K 2 L ) , and of mQAP is $$O(D^2 L^2)$$ O ( D 2 L 2 ) , where K is the number of interacting bits. To compute the random walk of a lag larger than 0, we employ a weighted graph Laplacian that associates a mutation operator with the difference in the objective function. We calculate the expected objective vector of a neighbourhood function and the eigenvalues of the corresponding transition matrix. The computational complexity of random walk’s correlation coefficients is polynomial with the problem size L and the number of objectives D. The computational effort of the random walks correlation coefficients of mNK is $$O(2^K L D^2)$$ O ( 2 K L D 2 ) , whereas of mQAP is $$O(L^6 D^2)$$ O ( L 6 D 2 ) . Numerical examples demonstrate the utilization of these techniques.

Suggested Citation

  • Madalina M. Drugan, 2019. "Random walk’s correlation function for multi-objective NK landscapes and quadratic assignment problem," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1213-1262, November.
  • Handle: RePEc:spr:jcomop:v:38:y:2019:i:4:d:10.1007_s10878-019-00445-7
    DOI: 10.1007/s10878-019-00445-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00445-7
    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-019-00445-7?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. Aguirre, Hernan E. & Tanaka, Kiyoshi, 2007. "Working principles, behavior, and performance of MOEAs on MNK-landscapes," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1670-1690, September.
    2. Verel, Sébastien & Liefooghe, Arnaud & Jourdan, Laetitia & Dhaenens, Clarisse, 2013. "On the structure of multiobjective combinatorial search space: MNK-landscapes with correlated objectives," European Journal of Operational Research, Elsevier, vol. 227(2), pages 331-342.
    Full references (including those not matched with items on IDEAS)

    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. Derbel, Bilel & Humeau, Jérémie & Liefooghe, Arnaud & Verel, Sébastien, 2014. "Distributed localized bi-objective search," European Journal of Operational Research, Elsevier, vol. 239(3), pages 731-743.
    2. 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.
    3. Ravshanbek Khodzhimatov & Stephan Leitner & Friederike Wall, 2021. "Interactions between social norms and incentive mechanisms in organizations," Papers 2102.12309, arXiv.org.
    4. Ravshanbek Khodzhimatov & Stephan Leitner & Friederike Wall, 2021. "On the effect of social norms on performance in teams with distributed decision makers," Papers 2104.05993, arXiv.org, revised Apr 2021.
    5. Ravshanbek Khodzhimatov & Stephan Leitner & Friederike Wall, 2022. "Controlling replication via the belief system in multi-unit organizations," Papers 2206.03786, arXiv.org.
    6. Allmendinger, Richard & Handl, Julia & Knowles, Joshua, 2015. "Multiobjective optimization: When objectives exhibit non-uniform latencies," European Journal of Operational Research, Elsevier, vol. 243(2), pages 497-513.
    7. 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.
    8. Marcella S. R. Martins & Mohamed El Yafrani & Myriam Delgado & Ricardo Lüders & Roberto Santana & Hugo V. Siqueira & Huseyin G. Akcay & Belaïd Ahiod, 2021. "Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape," Journal of Heuristics, Springer, vol. 27(4), pages 549-573, August.
    9. Joop van de Heijning & Stephan Leitner & Alexandra Rausch, 2020. "On the Effectiveness of Minisum Approval Voting in an Open Strategy Setting: An Agent-Based Approach," Papers 2009.04912, arXiv.org, revised Sep 2020.
    10. Verel, Sébastien & Liefooghe, Arnaud & Jourdan, Laetitia & Dhaenens, Clarisse, 2013. "On the structure of multiobjective combinatorial search space: MNK-landscapes with correlated objectives," European Journal of Operational Research, Elsevier, vol. 227(2), pages 331-342.

    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:38:y:2019:i:4:d:10.1007_s10878-019-00445-7. 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.