|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 4 of 21 found articles
| Title: |
A solution to the hub center problem via a single-relocation algorithm with tabu search |
| Author: |
Pamuk, F. Selcen Sepil, Canan |
| Appeared in: |
IIE transactions |
| Paging: | Volume 33 (2001) nr. 5 pages 399-411 |
| Year: |
2001-05-01 |
| Contents: |
Network designers for many transportation or telecommunication applications need to minimize the maximum (weighted) interaction time or distance in the networks, i.e., to solve the p-hub center problems. This study addresses the p-hub center problem. A single-relocation heuristic is proposed as a means of generating location-allocation strategies in a reasonable amount of time, and tabu search is superimposed on the underlying algorithm, so as to decrease the possibility of being trapped by local optima. Two single-allocation schemes are adapted from the literature, and a further one is developed specifically for the minimax objective function, for use in the evaluation phase of the algorithm. A greedy local search is employed to improve the resulting allocations. A number of strategies for choosing the initial hub locations are discussed and initial strategy - allocation scheme combinations are compared in terms of solution quality and pragmatic efficiency. |
| Publisher: |
Taylor & Francis |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 4 of 21 found articles
| << previous | next >> |