Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/emerald-publishing/using-simulated-annealing-to-solve-the-p-hub-median-problem-oWAhAVYgLD
References (48)
-
Yang-Byung Park, S. Song (1997)
Vehicle scheduling problems with time-varying speedComputers & Industrial Engineering, 33
-
D. Skorin-Kapov, J. Skorin-Kapov, M. O’Kelly (1996)
Tight linear programming relaxations of uncapacitated p-hub median problemsEuropean Journal of Operational Research, 94
-
James Campbell (1996)
Hub Location and the p-Hub Median ProblemOper. Res., 44
-
L. Chestler (1985)
OVERNIGHT AIR EXPRESS: SPATIAL PATTERN, COMPETITION AND THE FUTURE IN SMALL PACKAGE DELIVERY SERVICETransportation Quarterly, 39
-
James Campbell (1994)
Integer programming formulations of discrete hub location problemsEuropean Journal of Operational Research, 72
-
K. Campbell, R. Durfee, G. Hines (1997)
FedEx Generates Bid Lines Using Simulated AnnealingInterfaces, 27
-
J. Klincewicz (1991)
Heuristics for the p-hub location problemEuropean Journal of Operational Research, 53
-
S. Kirkpatrick, C. Gelatt, Mario Vecchi (1983)
Optimization by Simulated AnnealingScience, 220
-
T. Aykin (1995)
Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation SystemTransp. Sci., 29
-
D. Skorin-Kapov, J. Skorin-Kapov (1994)
On tabu search for the location of interacting hub facilitiesEuropean Journal of Operational Research, 73
-
L. Chwif, M. Barretto, L. Moscato (1998)
A solution to the facility layout problem using simulated annealingComputers in Industry, 36
-
D.D. Gemmill, Y‐W Tsai
Using a simulated annealing algorithm to schedule activities of resource‐constrained projects -
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller (1953)
Equation of state calculations by fast computing machinesJournal of Chemical Physics, 21
-
J.F Campbell
Hub location problems and the p‐Hub Median Problem -
David Johnson, C. Aragon, L. McGeoch, C. Schevon (1989)
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOper. Res., 37
-
J.F Campbell
A survey of network hub location -
David Connolly (1990)
An improved annealing scheme for the QAPEuropean Journal of Operational Research, 46
-
M. O’Kelly (1987)
A quadratic integer program for the location of interacting hub facilitiesEuropean Journal of Operational Research, 32
-
M. Gorman (1998)
Santa Fe Railway Uses an Operating-Plan Model to Improve Its Service DesignInterfaces, 28
-
N.E Collins, R.W Eglese, B.L Golden
Simulated annealing bibliography -
Jh Cho, Y.-D. Kim (1997)
A simulated annealing algorithm for resource constrained project scheduling problemsJournal of the Operational Research Society, 48
-
M. O’Kelly, D. Bryan (1998)
Hub location with flow economies of scaleTransportation Research Part B-methodological, 32
-
D. Sier, P. Tobin, C. McGurk (1997)
Scheduling surgical proceduresJournal of the Operational Research Society, 48
-
Sue Abdinnour-Helm (1998)
A hybrid heuristic for the uncapacitated hub location problemEur. J. Oper. Res., 106
-
M. O’Kelly (1992)
Hub facility location with fixed costsPapers in Regional Science, 71
-
G. Adil, D. Rajamani, D. Strong (1997)
Assignment allocation and simulated annealing algorithms for cell formationIie Transactions, 29
-
Sue Abdinnour-Helm (1999)
Network design in supply chain managementInternational Journal of Agile Management Systems, 1
-
M. Kolonko (1999)
Some new results on simulated annealing applied to the job shop scheduling problemEur. J. Oper. Res., 113
-
N. Collins (1988)
Simulated annealing - an annotated bibliographyAmerican Journal of Mathematical and Management Sciences, 8
-
K. Lumsden, F. Dallari, R. Ruggeri (1999)
Improving the efficiency of the Hub and Spoke system for the SKF European distribution networkInternational Journal of Physical Distribution & Logistics Management, 29
-
Andreas Ernst, M. Krishnamoorthy (1996)
Efficient algorithms for the uncapac-itated single allocation p-hub median problem -
Sue Abdinnour-Helm, M. Venkataramanan (1998)
Solution approaches to hub location problemsAnnals of Operations Research, 78
-
J. Klincewicz (1993)
Avoiding local optima in thep-hub location problem using tabu search and GRASPAnnals of Operations Research, 40
-
Y. Chan, Ronny Ponder (1979)
The small package air freight industry in the United States: A review of the federal express experienceTransportation Research Part A: General, 13
-
F. Glover, H. Greenberg (1989)
New approaches for heuristic search: A bilateral linkage with artificial intelligenceEuropean Journal of Operational Research, 39
-
10.1038/sj.jors.2600416
-
E Nelson
Logistics wiz rises at Wal‐Mart -
10.1108/09600039810248082
-
A. Day (1996)
Getting logistics into the boardroomLogistics Information Management, 9
-
K. Lai, J. Chan (1997)
Developing a simulated annealing algorithm for the cutting stock problemComputers & Industrial Engineering, 32
-
K. Smith, M. Krishnamoorthy, M. Palaniswami (1996)
Neural versus traditional approaches to the location of interacting hub facilitiesLocation Science, 4
-
G. Taylor, S. Harit, J. English, G. Whicker (1995)
Hub and spoke networks in truckload trucking: configuration, testing and operational concernsThe Logistics and Transportation Review, 31
-
Christos Koulamas, Solomon Antony, R. Jaen (1994)
A survey of simulated annealing applications to operations research problemsOmega-international Journal of Management Science, 22
-
Moon-Won Park, Yeong-Dae Kim (1997)
Search heuristics for a parallel machine scheduling problem with ready times and due datesComputers & Industrial Engineering, 33
-
L. Berry, B. Murtagh, G. McMahon, S. Sugden, L. Welling (1998)
Genetic algorithms in the design of complex distribution networksInternational Journal of Physical Distribution & Logistics Management, 28
-
R. Eglese (1990)
Simulated annealing: A tool for operational researchEuropean Journal of Operational Research, 46
-
G Naik
Back to Darwin: in sunlight and cells, science seeks answers to high‐tech puzzles -
Jonathan Thompson, K. Dowsland (1998)
A robust simulated annealing based examination timetabling systemComput. Oper. Res., 25
- Publisher
- Emerald Publishing
- Copyright
- Copyright © 2001 MCB UP Ltd. All rights reserved.
- ISSN
- 0960-0035
- DOI
- 10.1108/09600030110389532
- Publisher site
- See Article on Publisher Site
Abstract
Locating hub facilities is important in different types of transportation and communication networks. The p‐Hub Median Problem (p‐HMP) addresses a class of hub location problems in which all hubs are interconnected and each non‐hub node is assigned to a single hub. The hubs are uncapacitated, and their number p is initially determined. Introduces an Artificial Intelligence (AI) heuristic called simulated annealing to solve the p‐HMP. The results are compared against another AI heuristic, namely Tabu Search, and against two other non‐AI heuristics. A real world data set of airline passenger flow in the USA, and randomly generated data sets are used for computational testing. The results confirm that AI heuristic approaches to the p‐HMP outperform non‐AI heuristic approaches on solution quality.
Journal
International Journal of Physical Distribution & Logistics Management – Emerald Publishing
Published: Apr 1, 2001
Keywords: Artificialintelligence; Transportoperations; Distribution