LABELLING METHODS FOR THE GENERAL CASE OF THE MULTI-OBJECTIVE SHORTEST PATH PROBLEMA COMPUTATIONAL STUDY

This paper is devoted to the study of labelling techniques for solving the multi-objective shortest path problem (MSPP) which is an extension of the shortest path problem (SPP) resulting from considering simultaneously more than one cost function (criteria) for the arcs. The generalization of the well known SPP labelling algorithm for the multiobjective situation is studied in detail and several different versions are considered combining two labelling techniques (setting and correcting), with different data structures and ordering operators. The computational experience was carried out making use of a large and representative set of test problems, consisting of around 9000 instances, involving three types of network (random, complete and grid) and a reasonable range for the number of criteria. The computational results show that the labelling algorithm is able to solve large size instances of the MSPP, in a reasonable computing time. The computational experience reported in this paper is complemented by the results presented in a twin paper [22] showing that the label correcting technique proves to be the fastest procedure when the computation of the full set of non-dominated paths is required.

[1]  E. Martins,et al.  A bicriterion shortest path algorithm , 1982 .

[2]  Jose Luis Esteves dos Santos.  Optimização vectorial em redes , 2003 .

[3]  E. Martins.  On a multicriteria shortest path problem , 1984 .

[4]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[5]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[6]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[7]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[8]  U. Pape,et al.  Algorithm 562: Shortest Path Lengths [H] , 1980, TOMS.

[9]  Ernesto de Queirós Vieira Martins,et al.  Ranking multiobjective shortest paths , 2007 .

[10]  José Rui Figueira,et al.  Solving bicriteria 0-1 knapsack problems using a labeling algorithm , 2003, Comput. Oper. Res..

[11]  Kim Allan Andersen,et al.  A label correcting approach for solving bicriterion shortest-path problems , 2000, Comput. Oper. Res..

[12]  H. Moskowitz,et al.  Generalized dynamic programming for multicriteria optimization , 1990 .

[13]  Ishwar Murthy,et al.  Solving min‐max shortest‐path problems on a network , 1992 .

[14]  Rajan Batta,et al.  Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials , 1988, Oper. Res..

[15]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[16]  D. Shier,et al.  An empirical investigation of some bicriterion shortest path algorithms , 1989 .

[17]  Narsingh Deo,et al.  Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

[18]  I. Murthy,et al.  A parametric approach to solving bicriterion shortest path problems , 1991 .

[19]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[20]  R. Musmanno,et al.  Label Correcting Methods to Solve Multicriteria Shortest Path Problems , 2001 .

[21]  Joffre Swait,et al.  New dominance criteria for the generalized permanent labelling algorithm for the shortest path probl , 2000 .

[22]  Maria João Alves,et al.  Interactive decision support for multiobjective transportation problems , 1993 .

[23]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[24]  Walter Habenicht.  Efficient Routes in Vector-Valued Graphs , 1981, WG.

[25]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[26]  Luis Esteves dos,et al.  The labelling algorithm for themultiobjective shortest path problemErnesto de Quer os , 2007 .