Hybrid algorithms for the uncapacitated continuous location-allocation problem
β Scribed by Mohammad Saeed Jabalameli; Abdolsalam Ghaderi
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 173 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0268-3768
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given n interacting nodes in a network, the Uncapacitated Hub Location Problem (UHP) determines the number of hubs, the location for the hubs, and the assignment of the spokes to hubs that minimizes the overall transportation cost. The hubs are interconnected and each spoke is assigned to a single h
Location-allocation model is widely applied for facility location design in practice. In this paper, we discuss an extension of location-allocation model which has capacity constraints and propose a hybrid evolutionary method to solve it which absorbs ideas from both genetic algorithms (GAs) and evo