A genetic algorithm approach for regrouping service sites
From MaRDI portal
Publication:817228
DOI10.1016/S0305-0548(03)00093-5zbMath1087.90519MaRDI QIDQ817228
Nashat Mansour, Hiba Tabbara, Tarek Dana
Publication date: 7 March 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80)
Cites Work
- Genetic search and the dynamic facility layout problem
- A genetic approach to the quadratic assignment problem
- Use of location-allocation models in health service development planning in developing nations
- Inequality measures and equitable approaches to location problems
- Genetic search and the dynamic layout problem
- Multiobjective analysis of facility location decisions
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- An Efficient Heuristic Procedure for Partitioning Graphs
- Feature Article—Genetic Algorithms for the Operations Researcher
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- An approach to determine storage locations of containers at seaport terminals
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A genetic algorithm approach for regrouping service sites
