A multiobjective intermodal shortest path (MOISP)

• Autorzy: Boussedjra M. , Bloch C. , El Moudni A.

Warianty tytułu

EN

Wielozadaniowa najkrótsza ścieżka intermodalna

• Konferencja: "Transport Systems Telematics TST' 03". III International Conference, Katowice-Ustroń, 13-15 November 2003
• Języki publikacji: PL

Abstrakty

PL

W artyklule badany jest problem odnajdowania najkrótszej ścieżki na trasie punkt Wyjścia - punkt Przeznaczenia (O-D) w intermodalnych sieciach transportowych, mających na celu minimalizację czasu podróży i liczby pośrednich przesyłek dla wymaganej ścieżki. Sieć transportowa oraz odnośne dane są modelowane za pomocą wieloetykietowych grafów. Problem intermodalnych najkrótszych ścieżek i jego definicja zostały omówione pokrótce. Zaprezentowano algorytm opracowany do znajdowania ścieżki. Istotnym jest zwłaszcza zwrócenie uwagi na wdrożenie tego podejścia oraz wyników, jakich ono dostarcza.

EN

A paper begins by an introduction, the description of the treated problematic and some definitions of the different concepts (e.g. intermodality, transshipments, travel and waiting times...) used in the following (section 2). A brief survey presents some related works (section 3). The proposed contribution is explained in three main points: the model used to formulate the problem (section 4), the description of a given solution (section 5), and the basic principles of the solving algorithm (section 6). The correctness and the complexity of this contribution are discussed (section 7) and its performances are presented (section 8). Finally, the paper is concluded by some prospects (section 9).

Słowa kluczowe

PL

sieć intermodalna; ścieżka intermodalna; sieć transportowa

EN

intermodal networks; intermodal path; transport network

• Wydawca: Wydawnictwo Politechniki Śląskiej
• Czasopismo: Zeszyty Naukowe. Transport / Politechnika Śląska
• Rocznik: 2003
• Tom: z. 51
• Strony: 77--85
• Opis fizyczny: Bibliogr. 20 poz.

Twórcy

autor

Boussedjra M.

• Laboratoire Systemes et Transports, Universite de Technologie de Belfort-Montbeliard, 90010 Belfort, France

autor

Bloch C.

• Laboratoire Systemes et Transports, Universite de Technologie de Belfort-Montbeliard, 90010 Belfort, France

autor

El Moudni A.

• Laboratoire Systemes et Transports, Universite de Technologie de Belfort-Montbeliard, 90010 Belfort, France

Bibliografia

• [1 ] AHUJA R.K., ORLIN J.B., PALLOTTINO S . , SCUTELLA M.G., Minim um time and cost path problems in street networks with traffic lights, rapport technique, TR-99-13.
• [2] AHUJA R. K., ORLIN J.B., PALLOTTINO S ., SCUTELLA M. G., Dynamic shortest paths minimizing travel times and costs, in Proceedings of the Mediterranean Electrotechnical Conference, vol. 2, pp. 656-659 CODEN: PMECFA, 2001.
• [3] BELLMANRE., On a routing problem. In Quart. Appl. Math, 16 : 87 -9 0 , 1958.
• [4] BlSTARELLIS., MONTANARIU., ROSSIF., in Proc. CP-AI-OR'99 Workshop on Integration of A1 and OR techniques in Constraint Programming for Combinatorial Optimization Problems.
• [5] BOILEM. P. Intermodal Transportation Network Analysis - A G1S Application . Proceedings of the 10th Mediterranean Electrotechnical Conference, Information Technology and Electrotechnology for the Mediterranean Countries, II: 660-663, 2000.
• [6] BOUSSEDJRA M., BLOCH C., El—MOUDNl A ., Solution optimale pour la recherche du meilleure chemin intermodal. Proc: 4e Confrence Francophone de M Od'elisation et SIMulation M O S I M , : pp. 230-238, 2003.
• [7] CARLOS F.D., Reversibility of the time-dependent shortest path problem. Transportation Research Part B, 36:665-668, 2002.
• [8] CHABINl I., Discrete dynamic shortest path problems in transportation application: complexity and algorithms with optimal run time, Transportation Research, pp. 170-175, 1997.
• [9] CORDEAU J.F., Toth P., VIGO D., A survey of optimization models for train routing and scheduling. Transportation Science Vol. 32, pp. 380-404, 1998.
• [10] DIJKSTRA E.W., A note on two problems in connexion with graphs. Numerische Mathematik, 1 : 269 -2 7 1 , 1959.
• [11] FEBBRARO A. D . , SACONE S . , A new algorithm to finding the best path in intermodal transportation systems, Studies in Informatics and Control, Vol. 4, pp. 357-363. 1995.
• [12] FLOYD R.W., Algorithm 97, Shortest path. Comm, ACM, 5: 345, 1962.
• [13] GONDRAN M., MINOUX M . , Graphes et Algorithmes, Editions EY RO LL ES 1985, Paris.
• [14] LOZANO A., STORCHI G., Shortest viable hyperpath in multimodal networks. Transportation Research Part B 36 : 853-874, 2002.
• [15] M O D E S T I P., S C IO M A C H E N A., A utility measure for .nding multiobjective shortest paths in urban multimodal transportation networks. European Journal of Operational Research, 1 1 1 : 495-508,1998.
• [16] MOHAPATRA P.K..J., DUTTA R.K., An intermodal investment decision model in the transport sector. Omega, 18(2): 203-212, 1990.
• [17] MOORE E.F., The shortest path through a maze. Proc. Int. Symp. On theory of switching, II, April 2-5: 285— 292, 1959.
• [18] NACHTIGALL K. Theory and methodologys Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research, 83: 154-166, 1995.
• [19] Pallottino S., SCUTELLA M. G., Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects. In Equilibrium and Advanced Transportation Modelling, Kluwer, pp. 1245-281, 1998.
• [20] ZlLIASKOPOULOS A., WARDELL W . , An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays, Elsevier Science, European Journal Of Operational Research, 125, pp. 486-502, 2000.