A algorithm for finding the route minimizing the time of travel and minimizing the cost of travel additionally

Jacek Widuch, Daniel Wicher

Abstract


The routing problem is one of the studied transportation problems. In the paper the communication networks routing problem is presented, in which the goal is to find a route from the start stop to the final stop minimizing the time of travel, where the time of starting travel at the start stop is given. If there are more routes with minimal the time of travel, among them the route with minimal the cost of travel should be determined. In the paper the algorithm for solving the communication networks routing problem is presented. Apart from that a sample results of experimental tests using the real communication network are presented.

Keywords


transportation problem; directed weighted graph; variable weights; shortest path; relational database; stored procedure

Full Text:

PDF (Polski)

References


Barker R.: CASE*Method – modelowanie związków encji. WNT, Warszawa 1996.

Bellman R.: On a routing problem. Quarterly of Applied Mathematics, Vol. 16(1), p. 87–90, 1958.

Brumbaugh–Smith J., Shier S.: An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research, Vol. 43, p. 216–224, 1989.

Climaco J. C., Martins E. Q. V.: A bicriterion shortest path algorithm. European Journal of Operational Research, Vol. 11, No. 4, p. 399–404, 1982.

Coello Coello C. A., van Veldhuizen D. A., Lamont G. B.: Evolutionary algorithms for solving multi–objective problems. Kluwer Academic Publishers, New York, 2002.

Corley H. W., Moon I. D.: Shortest paths in networks with vector weights. Journal of Optimization Theory and Application, Vol. 46, No. 1, p. 79–86, 1985.

Cormen T. H., Leiserson Ch. E., Rivest R. L.: Wprowadzenie do algorytmów. WNT, Warszawa 2000.

Daellenbach H. G., De Kluyver C. A.: Note on multiple objective dynamic programming. Journal of the Operational Research Society, Vol. 31, No. 7, p. 591–594, 1980.

Date C.J.: Wprowadzenie do baz danych. WNT, Warszawa 1981.

Dell'Olmo P., Gentili M., Scozzari A.: On finding dissimilar Pareto–optimal paths. European Journal of Operational Research, Vol. 162, No. 1, p. 70–82, 2005.

Dijkstra E. W.: A note on two problems in connexion with graphs. Numerical Mathematics, Vol. 1, p. 269–271, 1959.

Ford L. R.: Network Flow Theory. Report P–923, The Rand Corporation, Santa Monica, CA, USA, 1956.

Floyd R.: Algorithm 97: Shortest path. Communications of the ACM, Vol. 5(6), p. 345, 1962.

Hansen P.: Bicriterion path problems. Multiple Criteria Decision Making: Theory and Application, Springer–Verlag , Berlin, Germany, p. 109–127 , 1980.

Jaszkiewicz A.: Inżynieria oprogramowania. Wydawnictwo HELION, Gliwice 1997.

Johnson D. B.: Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, Vol. 24(1), p. 1–13, 1977.

Lipski W.: Kombinatoryka dla programistów. WNT, Warszawa 1989.

Machuca E., Mandow L., Pérez de la Cruz J. L.: An Evaluation of Heuristic Functions for Bicriterion Shortest Path Problems. Proceedings of the XIV Portuguese Conference on Artificial Inteligence (EPIA 2009), Universidade de Aveiro, p. 205–216, 2009.

Mandow L., Pérez de la Cruz J. L.: Frontier search for Bicriterion Shortest Path Problems. Proceeding of the 2008 conference on ECAI 2008 18th European Conference on Artificial Intelligence, p. 480–484, IOS Press, 2008.

Mandow L., Pérez de la Cruz J. L.: Path recovery in frontier search for multiobjective shortest path problems. Journal of Intelligent Manufacturing, Vol. 21, No. 1, p. 89–99, 2008.

Martins E. Q. V.: On a multicriteria shortest path problem. European Journal of Operational Research, Vol. 16, No. 2, p. 236–245, 1982.

Martins E. Q. V.: On a multicriteria shortest path problem. European Journal of Operational Research, Vol. 16, No. 2, p. 236–245, 1982.

Martí R., González Velarde J. L., Duarte A.: Heuristics for the bi–objective path dissimilarity problem. Computers & Operations Research, Vol. 36, No. 11, p. 2905–2912, 2009.

Mote J., Murthy I., Olson D. L.: A parametric approach to solving bicriterion shortest path problems. European Journal of Operational Research, Vol. 53, No. 1, p. 81–92, 1991.

Pareto V.: Course d'Economie Politique, F. Rouge, Lausanne, 1896.

Peschel M., Riedel C.: Polioptymalizacja. Metody podejmowania decyzji kompromisowych w zagadnieniach inżynieryjno-technicznych. WNT, Warszawa 1979.

Raith A., Ehrgott M.: A comparison of solution strategies for biobjective shortest path problems. Journal Computers and Operations Research, Vol. 36, No. 4, p. 1299–1331, 2009.

Reingold E. M., Nievergelt J., Deo N.: Algorytmy kombinatoryczne. PWN, Warszawa 1985.

Skriver A. J. V., Andersen K.A.: A label correcting approach for solving bicriterion shortest-path problems. Computers & Operations Research, Vol. 27, p. 507–524, 2000.

Stadler W.: A survey of Multicriteria Otimization or the Vector Maximum Problem. Part I: 1776–1960, Journal of Optimization Theory & Aplication, Vol. 29, No. 1, p. 1–52, 1979.

Tung C. T., Chew K. L.: A bicriterion Pareto–optimal path algorithm. Asia–Pacific Journal of Operational Research, Vol. 5, p. 166–172, 1988.

Ulungu E. L., Teghem J.: Multi–objective combinatorial optimization problems: a survey. Journal of Multi-Criteria Decision Analysis, Vol. 3, No. 2, p. 83–104, 1994.

Voorneveld M.: Characterization of Pareto dominance. Operations Research Letters, Vol. 31, No. 1, p. 7–11, 2003.

Warshall S.: A theorem on Boolean matrices. Journal of the ACM, Vol. 9(1), p. 11–12, 1962.

Widuch J.: Problem wyznaczania połączeń w sieciach komunikacyjnych. Studia Informatica, Vol. 22, nr 4(46), p. 117–134, Gliwice 2001.

Widuch J.: Wyznaczanie połączeń w sieciach komunikacyjnych o zmiennych wagach. Studia Informatica, Vol. 23, nr 4(51), p. 85–104, Gliwice 2002.

Widuch J.: Algorytmy optymalizacji wielokryterialnej w problemach komunikacyjnych. Rozprawa doktorska, Politechnika Śląska, Gliwice 2008.

Widuch J.: Rozwiązanie problemu wyznaczania połączeń w sieciach komunikacyjnych za pomocą zmodyfikowanego algorytmu wyznaczania K najkrótszych ścieżek. Studia Informatica, Vol. 31, nr 1(88), p. 55–70, Gliwice 2010.

Widuch J.: Rozwiązanie problemu wyznaczania połączeń w sieciach komunikacyjnych z zastosowaniem metody skalaryzacji. Studia Informatica, Vol. 32, nr 4A(100), p. 57–81, Gliwice 2011.

Widuch J.: Algorytmy optymalizacji tras przejazdu pojazdów. Studia Informatica, Vol. 32, nr 4A(100), p. 83–111, 2011.

Yourdon E.: Współczesna analiza strukturalna. WNT, Warszawa 1996.

Strona domowa przewoźnika KZK GOP: http://www.kzkgop.com.pl/




DOI: http://dx.doi.org/10.21936/si2012_v33.n4.93