In this paper the problems of locating urban logistic terminals are studied as hub location problems that due to a large number of potential nodes in big cities belong to hard non-polynomial problems, the so-called NP-problems. The hub location problems have found wide application in physical planning of transport and telecommunication systems, especially systems of fast delivery, networks of logistic and distribution centres and cargo traffic terminals of the big cities, etc. The paper defines single and multiple allocations and studies the numerical examples. The capacitated single allocation hub location problems have been studied, with the provision of a mathematical model of selecting the location for the hubs on the network. The paper also presents the differences in the possibilities of implementing the exact and heuristic methods to solve the actual location problems of big dimensions i.e. hub problems of the big cities.
Zečević, S., Tadić, S.: “City logistika”, Saobraćajni fakultet, Beograd, 2006.
Stanimirović, Z.: “Genetski algoritam za rešavanje nekih NP-teških hab lokacijskih problema”, Doctoral dissertation, Univerzitet u Beogradu, Matematički fakultet, Beograd, 2007
Boland, N., Krishnamoorthy, M., Ernst, A., Ebery, J.: “Preprocessing and Cutting for Multiple Allocation Hub Location Problems”, European Journal of Operational Research, Vol. 155, pp. 638-653 (2004)
Perez – Perez, M., Almeida Rodriguez, F., Moreno Vega, J. M.: “On the Use of the Path Relinking for the p-Hub Median Problem”, Lecture Notes in Computer Science, Vol. 3004, pp. 155 – 164 (2004)
Vujošević, M., Papić, B.: “Network Location Models and their Application”, Tehnička dijagnostika , 3-4, 2006
Galvao, R.D., ReVelle, C.S.: A Lagrangean heuristic for the maximal covering location problem, European Journal of Operational Research, Vol. 88, pp. 114-123 (1996)
Krčevinac, S., Čangalović, M., et al.: “Operaciona istraživanja”, Fakultet organizacionih nauka, Beograd, 2006.
Pašagić, H.: “Matematičke metode u prometu”, Fakultet prometnih znanosti, Zagreb, 2003
Campbell, J.F., Ernst, A.T., Krishnamoorthy, M.. “Hub Arc Location Problems: Part II-Formulations and Optimal Algorithms”, Management Science, Vol. 51, pp. 1556 – 1571 (2005)
Perez – Perez, M., Almeida Rodriguez, F., Moreno Vega, J.M.: “A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p-Hub Median Problem”, Lecture Notes in Computer Science, Vol. 3636, pp. 142 – 153 (2005)
Pašagić-Škrinjar, J.:“Racionalizacija mreže logističkih centara u zračnom prometu Republike Hrvatske” Doctoral dissertation, FZ, 2007, Zagreb
Love R. F., Morris J. G., Wesolowsky G. O., “Facilities Location: Models and Methods”, Elsevier, New York, 1988
Pamuk P., Sepil C., “A Solution to the Hub Center Problem via a Single-Relocation Algorithm With Tabu Search”, IEEE Transactions, Vol. 23, pp. 399-411 (2001)
Reeves C. R., “Modern Heuristics Techniques for Combinatorial Problems”, McGraw-Hill Book, 1995
Kratica J., Stanimirović Z., “Solving the Uncapacitated Multiple Allocation p-Hub Center Problem by Genetic Algorithm”, Asia-Pacific Journal of Operational Research, Vol. 23. No. 4, pp. 425 – 437 (2006)
Kratica J., Stanimirović Z., Tošić D., Filipović V., “Two Genetic Algorithms for Solving the Uncapacitated Single Allocation p-Hub Median Problem”, European Journal of Operational Research, Vol. 182, pp. 15 -28 (2006)
Current, J., Daskin, M., Schilling, D., “Facility Location: Applications and Theory”, Springer-Verlag, New York, 2001
http://www.ilog.com/products/cplex/ (10.10.2011.)
Guest Editor: Eleonora Papadimitriou, PhD
Editors: Dario Babić, PhD; Marko Matulin, PhD; Marko Ševrović, PhD.
The mission of our journal is to provide high quality communication of research results, which is crucial for the effectiveness of scientific research, the promotion of scientific information, new ideas, and original research in the field of traffic and transportation engineering.
1848-4069
0353-5320
Proud publisher
Accelerating Discoveries in Traffic Science |
2024 © Promet - Traffic&Transportation journal
