Using simulated annealing to solve the p-Hub Median Problem.

Autor: Abdinnour-Helm, Sue
Předmět:
Zdroj: International Journal of Physical Distribution & Logistics Management; 2001, Vol. 31 Issue 3, p203, 18p
Abstrakt: Presents the idea that locating hub facilities is important in different types of transportation and communication networks. The p-Hub Median Problem (p-HMP), which addresses hub location problems in which all hubs are interconnected and each non-hub node is assigned to a single hub; An Artificial Intelligence (AI) heuristic called simulated annealing, used to solve the p-HMP; Comparison of results against another AI heuristic, Tabu Search, and against two other non-AI heuristics.
Databáze: Complementary Index