A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem
| Autor: | Mouhamadou A.M.T. Baldé, Serigne Gueye, Babacar Mbaye Ndiaye |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
0209 industrial biotechnology
Numerical Analysis Mathematical optimization 021103 operations research Quadratic assignment problem Heuristic (computer science) Computer science Strategy and Management 0211 other engineering and technologies Computational intelligence 02 engineering and technology Management Science and Operations Research Flow network Hybrid algorithm Network planning and design 020901 industrial engineering & automation Computational Theory and Mathematics Management of Technology and Innovation Modeling and Simulation Statistics Probability and Uncertainty Routing (electronic design automation) Metaheuristic |
| Zdroj: | Operational Research. 21:1663-1690 |
| ISSN: | 1866-1505 1109-2858 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink