A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements
β Scribed by Bernard Gendron; Jean-Yves Potvin; Patrick Soriano
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 156 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, a parallel hybrid heuristic is developed for the multicommodity capacitated location problem with balancing requirements. The hybrid involves variable neighborhood descent (VND) and slope scaling (SS). Both methods evolve in parallel within a master-slave architecture where the slave processes communicate through adaptive memories. Numerical results are reported on different types of randomly generated instances, using an increasing number of processors and different distributions of processes between SS and VND.
π 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