Skip to main content

Advertisement

Springer Nature Link
Log in

A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem

  • Original paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

Our paper deals with a combinatorial optimization problem called the optimal network and quadratic assignment problem. The problem has been introduced by Los (Region Sci Urban Econ 8:21–42, 1978) as a model of an urban planning problem that consists in optimizing simultaneously the best location of the activities of an urban area (land-use), as well as the road network design (transportation network) in such a way to minimize as much as possible the routing and network costs. We propose a mixed-integer programming formulation of the problem, and a hybrid algorithm based on greedy and evolutionary heuristic methods. Some numerical experiments on randomly generated instances, and on real-life big data from Dakar city, show the efficiency of the method.

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

Access this article

Log in via an institution

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. https://www.ea.com/games/simcity.

References

  • Abdel-Baset M, Wu H, Zhou Y, Abdel-fatah L (2017) Elite opposition-flower pollination algorithm for quadratic assignment problem. J Intell Fuzzy Syst 33:901–911

    Article  Google Scholar 

  • Abdel-Baset M, Manogaran G, El-Shahat D, Mirjalili S (2018) Integrating the whale algorithm with Tabu search for quadratic assignment problem: a new approach for locating hospital departments. Appl Soft Comput J 73:530–546

    Article  Google Scholar 

  • Battiti R, Tecchiolli G (1994) The reactive tabu search. ORSA J Comput 6(2):126–140

    Article  Google Scholar 

  • Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154–60

    Article  Google Scholar 

  • Benlic U, Hao K J (2013c) Breakout local search for the quadratic assignment problem. Appl Math Comput 219(9:4800–4815

    Google Scholar 

  • Burkard RE, Karisch SE, Rendl F (1997) Qaplib—a quadratic assignment problem library. J Global Optim 10:391–403

    Article  Google Scholar 

  • Davis L (1991) Handbook of genetic algorithms. Van Nostrand, New York

    Google Scholar 

  • Elshafei AN (1977) Hospital layout as a quadratic assignment problem. Oper Res Q 28(1 Part 2):167–179

    Article  Google Scholar 

  • Fleurent C, Ferland JA (1994) Genetic hybrids for the quadratic assignment problem, vol 16. DIMACS series in discrete mathematics and theoretical computer science. American Mathematical Society, Providence, pp 173–87

    Book  Google Scholar 

  • Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345

    Article  Google Scholar 

  • Gamvros I, Golden B, Raghavan S, Stanojević D (2005) Heuristic search for network design. In: Greenberg HJ (ed) Tutorials on Emerging methodologies and applications in operations research. International series in operations research & management science, vol 76. Springer, New York, NY

    Chapter  Google Scholar 

  • Garey M-R, Johnson D-S (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., New York, NY, USA

    Google Scholar 

  • Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Publishing Company, Reading

    Google Scholar 

  • Gueye S, Ndiaye BM, Josselin D, Poss M, Faye RM, Michelon P, Genre-Grandpierre C, Ciari F (2015) Using mobile phone data for spatial planning simulation and optimization technologies (SPOT), data for development challenge Senegal. In: Book of Abstracts: Scientific Papers, N T15:516–534

  • Hadley SW, Rendl F, Wolkowicz H (1992) A new lower bound via projection for the quadratic assignment problem. Math Oper Res 17(3):727–739

    Article  Google Scholar 

  • Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI

    Google Scholar 

  • Krarup J, Pruzan PM (1978) Computer-aided layout design. Math Program Study 9:75–94

    Article  Google Scholar 

  • Lawler EL (1963) The quadratic assignment problem. Manag Sci 9:586–599

    Article  Google Scholar 

  • Li Y, Pardalos PM (1992) Generating quadratic assignment test problems with known optimal permutations. Comput Optim Appl 1:163–184

    Article  Google Scholar 

  • Lin J-L, Feng C-M (2003) A bi-level programming model for the land use-network design problem. Ann Region Sci 37:93–105

    Article  Google Scholar 

  • Los M (1978) Simultaneous optimization of land use and transportation. A synthesis of the quadratic assignment problem and the optimal network problem. Region Sci Urban Econ 8:21–42

    Article  Google Scholar 

  • Los M (1979) A discrete-convex programming approach to simultaneous optimization of land use and transportation. Transp Res B 13B:33–48

    Article  Google Scholar 

  • Lundqvist L (1973) Integrated location—transportation analysis; a decomposition approach. Region Urban Econ 3(3):233–262

    Article  Google Scholar 

  • Nugent CE, Vollman TE Ruml (1968) An experimental comparison of techniques for the assignment of facilities to locations. J Oper Res 1:150–73

    Article  Google Scholar 

  • Patriksson M (1994) The traffic assignment problem: models and methods. Linköping Institute of Technology, Linköping

    Google Scholar 

  • Roucairol C (1987) Du sequentiel au parallèle: la recherche arborescente et son application à la programmation quadratique en variables 0 et 1, 1987. Thèse d’Etat, Universitè Pierre et Marie Curie, Paris, France

  • Scott AJ (1969) The optimal network problem: some computational procedures. Transp Res 3:201–210

    Article  Google Scholar 

  • Scriabin M, Vergin RC (1975) Comparison of computer algorithms and visual based methods for plant layout. Manag Sci 22:172–187

    Article  Google Scholar 

  • Sean L (2013) Essentials of metaheuristics, Lulu, 2nd edn. http://cs.gmu.edu/~sean/book/metaheuristics/

  • Sheffi Y (1984) Urban transportation networks: equilibrium analysis with mathematical programming techniques. Prentice Hall, Englewood Cliffs

    Google Scholar 

  • Skorin-kapov J (1990) Tabu search applied to the quadratic assingnment problem. ORSA J Comput 2(1):33–45

    Article  Google Scholar 

  • Stützle T (2006) Iterated local search for the quadratic assignment problem. Eur J Oper Res 174(3):1519–1539

    Article  Google Scholar 

  • Taillard ED (1995) Comparison of iterative searches for the quadratic assingnment problem. Locat Sci 3:87–105

    Article  Google Scholar 

  • Tate DE, Smith AE (1985) A genetic approach to the quadratic assignment problem. Comput Oper Res 22:73–83

    Article  Google Scholar 

  • Thonemann UW, Bölte A (1994) An improved simulated annealing algorithm for the quadratic assignment problem. Working paper, School of Business, Department of Production and Operations Research, University of Paderborn, Germany

  • Wilheilm MR, Ward TL (1987) Solving quadratic assignment problems by simulated annealing. IIE Trans 19(1):107–119

    Article  Google Scholar 

  • Xiong Y, Schneider JB (1995) Transportation network design using a cumulative genetic algorithm and neural network. Transp Res Rec 1364:37–44

    Google Scholar 

Download references

Acknowledgements

The authors are grateful to John Catherall and James Bleach (the õbex project) for their editorial support. As well as to the two reviewers for their valuable comments that help to improve the paper quality.

Author information

Authors and Affiliations

  1. Laboratoire de Mathématiques de la Décision et d’Analyse Numérique, LMDAN-FASEG, Université Cheikh Anta Diop, BP 4500, 10700, Dakar-Fann, Dakar, Senegal

    Mouhamadou A. M. T. Baldé & Babacar M. Ndiaye

  2. Laboratoire d’Informatique d’Avignon (LIA), Avignon Université, 339 chemin des Meinajaries, BP 1228, 84911, Avignon Cedex 9, France

    Serigne Gueye

Authors
  1. Mouhamadou A. M. T. Baldé
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serigne Gueye
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Babacar M. Ndiaye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Serigne Gueye.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Baldé, M.A.M.T., Gueye, S. & Ndiaye, B.M. A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem. Oper Res Int J 21, 1663–1690 (2021). https://doi.org/10.1007/s12351-020-00549-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-020-00549-7

Keywords