hrcak mascot   Srce   HID

Izvorni znanstveni članak

On Hub Location Models

Darko Skorin-Kapov ; W. A. Harriman School for Management and Policy, Stony Brook, USA
Jadranka Skorin-Kapov ; W. A. Harriman School for Management and Policy, Stony Brook, USA

Puni tekst: engleski, pdf (6 MB) str. 183-192 preuzimanja: 146* citiraj
APA 6th Edition
Skorin-Kapov, D. i Skorin-Kapov, J. (1995). On Hub Location Models. Journal of computing and information technology, 3 (3), 183-192. Preuzeto s https://hrcak.srce.hr/150426
MLA 8th Edition
Skorin-Kapov, Darko i Jadranka Skorin-Kapov. "On Hub Location Models." Journal of computing and information technology, vol. 3, br. 3, 1995, str. 183-192. https://hrcak.srce.hr/150426. Citirano 20.07.2019.
Chicago 17th Edition
Skorin-Kapov, Darko i Jadranka Skorin-Kapov. "On Hub Location Models." Journal of computing and information technology 3, br. 3 (1995): 183-192. https://hrcak.srce.hr/150426
Harvard
Skorin-Kapov, D., i Skorin-Kapov, J. (1995). 'On Hub Location Models', Journal of computing and information technology, 3(3), str. 183-192. Preuzeto s: https://hrcak.srce.hr/150426 (Datum pristupa: 20.07.2019.)
Vancouver
Skorin-Kapov D, Skorin-Kapov J. On Hub Location Models. Journal of computing and information technology [Internet]. 1995 [pristupljeno 20.07.2019.];3(3):183-192. Dostupno na: https://hrcak.srce.hr/150426
IEEE
D. Skorin-Kapov i J. Skorin-Kapov, "On Hub Location Models", Journal of computing and information technology, vol.3, br. 3, str. 183-192, 1995. [Online]. Dostupno na: https://hrcak.srce.hr/150426. [Citirano: 20.07.2019.]

Sažetak
The study of hub location models involves designing communication networks where some of the nodes serve as focal points (i.e. hubs) and other nodes are connected to those hubs. Possible applications include airline traffic flow, telecommunications, and mail delivery networks. In this paper we present an overview of recent results on solvability of some hub location models. The overview includes a heuristic approach based on tabu search, lower bounds for cases where distances satisfy triangular inequality, tight linear programming relaxations, and a linkage between optimal and heuristic solutions. As a result of those studies the range of optimally solvable instances of NP-hard hub location problems was extended. In particular, well known and heavily used bench-mark data set of real world problems (Civil Aeronautics Board (CAB) data set), that has resisted efficient solutions for more than a decade, has been solved to optimality. The paper concludes with the discussion of some avenues for future research.

Ključne riječi
Hub location; Linear programming; Integer programming; Tabu search

Hrčak ID: 150426

URI
https://hrcak.srce.hr/150426

Posjeta: 174 *