IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v62y2015i2p545-564.html
   My bibliography  Save this article

A review of distances for the Mallows and Generalized Mallows estimation of distribution algorithms

Author

Listed:
  • Josu Ceberio
  • Ekhine Irurozki
  • Alexander Mendiburu
  • Jose Lozano

Abstract

The Mallows (MM) and the Generalized Mallows (GMM) probability models have demonstrated their validity in the framework of Estimation of distribution algorithms (EDAs) for solving permutation-based combinatorial optimisation problems. Recent works, however, have suggested that the performance of these algorithms strongly relies on the distance used under the model. The goal of this paper is to review three common distances for permutations, Kendall’s- $$\tau $$ τ , Cayley and Ulam, and compare their performance under MM and GMM EDAs. Moreover, with the aim of predicting the most suitable distance for solving any given permutation problem, we focus our attention on the relation between these distances and the neighbourhood systems in the field of local search optimisation. In this sense, we demonstrate that the performance of the MM and GMM EDAs is strongly correlated with that of multistart local search algorithms when using related neighbourhoods. Furthermore, by means of fitness landscape analysis techniques, we show that the suitability of a distance to solve a problem is clearly characterised by the generation of high smoothness fitness landscapes. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Josu Ceberio & Ekhine Irurozki & Alexander Mendiburu & Jose Lozano, 2015. "A review of distances for the Mallows and Generalized Mallows estimation of distribution algorithms," Computational Optimization and Applications, Springer, vol. 62(2), pages 545-564, November.
    • Handle: RePEc:spr:coopap:v:62:y:2015:i:2:p:545-564
    DOI: 10.1007/s10589-015-9740-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-015-9740-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-015-9740-x?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. Tjalling C. Koopmans & Martin J. Beckmann, 1955. "Assignment Problems and the Location of Economic Activities," Cowles Foundation Discussion Papers 4, Cowles Foundation for Research in Economics, Yale University.
    2. Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January.
    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. Yeawon Yoo & Adolfo R. Escobedo, 2021. "A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation," Decision Analysis, INFORMS, vol. 18(4), pages 296-320, December.

    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. Shahaboddin Shamshirband & Mohammad Shojafar & A. Hosseinabadi & Maryam Kardgar & M. Nasir & Rodina Ahmad, 2015. "OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises," Annals of Operations Research, Springer, vol. 229(1), pages 743-758, June.
    2. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    3. Pempera, Jaroslaw & Smutnicki, Czeslaw, 2018. "Open shop cyclic scheduling," European Journal of Operational Research, Elsevier, vol. 269(2), pages 773-781.
    4. Shahvari, Omid & Logendran, Rasaratnam, 2016. "Hybrid flow shop batching and scheduling with a bi-criteria objective," International Journal of Production Economics, Elsevier, vol. 179(C), pages 239-258.
    5. Fleming, Christopher L. & Griffis, Stanley E. & Bell, John E., 2013. "The effects of triangle inequality on the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 1-7.
    6. Jean-Paul Watson & Laura Barbulescu & L. Darrell Whitley & Adele E. Howe, 2002. "Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 98-123, May.
    7. Nouha Nouri & Talel Ladhari, 2018. "Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking," Annals of Operations Research, Springer, vol. 267(1), pages 413-430, August.
    8. Liaw, Ching-Fang, 2000. "A hybrid genetic algorithm for the open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 124(1), pages 28-42, July.
    9. Pflughoeft, K. A. & Hutchinson, G. K. & Nazareth, D. L., 1996. "Intelligent decision support for flexible manufacturing: Design and implementation of a knowledge-based simulator," Omega, Elsevier, vol. 24(3), pages 347-360, June.
    10. Heidrun C. Hoppe & Benny Moldovanu & Aner Sela, 2009. "The Theory of Assortative Matching Based on Costly Signals," Review of Economic Studies, Oxford University Press, vol. 76(1), pages 253-281.
    11. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    12. Ma, Jinpeng, 1998. "Competitive Equilibrium with Indivisibilities," Journal of Economic Theory, Elsevier, vol. 82(2), pages 458-468, October.
    13. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    14. Dennis W. Carlton & Gustavo E. Bamberger & Roy J. Epstein, 1995. "Antitrust and Higher Education: Was There a Conspiracy to Restrict Financial Aid?," RAND Journal of Economics, The RAND Corporation, vol. 26(1), pages 131-147, Spring.
    15. Liu, Jiyin & Reeves, Colin R, 2001. "Constructive and composite heuristic solutions to the P//[summation operator]Ci scheduling problem," European Journal of Operational Research, Elsevier, vol. 132(2), pages 439-452, July.
    16. Marcus Berliant & Yves Zenou, 2014. "Labor Differentiation and Agglomeration in General Equilibrium," International Regional Science Review, , vol. 37(1), pages 36-65, January.
    17. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 0. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    18. Eric Bonabeau & Florian Henaux & Sylvain Gu'erin & Dominique Snyers & Pascale Kuntz & Guy Theraulaz, 1998. "Routing in Telecommunications Networks with ``Smart'' Ant-Like Agents," Working Papers 98-01-003, Santa Fe Institute.
    19. Ben-Daya, M. & Al-Fawzan, M., 1998. "A tabu search approach for the flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 109(1), pages 88-95, August.
    20. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.

    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:coopap:v:62:y:2015:i:2:p:545-564. 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.