An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions

Abstract In many network routing problems several conflicting objectives must be considered. Even for the bi-objective shortest path problem, generating and presenting the whole set of nondominated solutions (paths) to a decision maker, in general, is not effective because the number of these paths can be very large. Interactive procedures are adequate to overcome these drawbacks. Current et al. [1] proposed an interactive approach based on a NISE-like procedure to search for nondominated supported solutions and using auxiliar constrained shortest path problems to carry out the search inside the duality gaps. In this paper we propose a new interactive approach to search for unsupported nondominated solutions (lying inside duality gaps) based on a k-shortest path procedure. Both approaches are compared. Scope and purpose Network routing problems are generally multidimensional in nature, and in many cases the explicit consideration of multiple objectives is adequate. Objectives related to cost, time, accessibility, environmental impact, reliability and risk are appropriated for selecting the most satisfactory (“best compromise”) route in many problems. In general there is no single optimal solution in a multiobjective problem but rather, a set of nondominated solutions from which the decision maker must select the most satisfactory. However, generating and presenting the whole set of nondominated paths to a decision maker, in general, is not effective because the number of these paths can be very large. Interactive procedures are adequate to overcome these drawbacks. This paper introduces an interactive procedure to assist the decision maker in identifying the “best compromise” solution for the bi-objective shortest path problem. The procedure incorporates an efficient k-shortest path algorithm to identify nondominated solutions lying inside duality gaps. Test problem results indicate that the procedure can be readily executed on a PC for large-scale instances of problems.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..

[3]  Gunnar G. Løvs.  Models of wayfinding in emergency evacuations , 1998, Eur. J. Oper. Res..

[4]  E. Martins,et al.  An algorithm for the ranking of shortest paths , 1993 .

[5]  J. Current,et al.  The Minimum‐Covering/Shortest‐Path Problem* , 1988 .

[6]  D. Halder,et al.  A METHOD FOR SELECTING OPTIMUM NUMBER OF STATIONS FOR A RAPID TRANSIT LINE : AN APPLICATION IN CALCUTTA TUBE RAIL , 1981 .

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

[8]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[9]  R. Dial.  A MODEL AND ALGORITHM FOR MULTICRITERIA ROUTE-MODE CHOICE , 1979 .

[10]  Ernesto de Queirós Vieira Martins,et al.  A Shortest Paths Ranking Algorithm , 1990 .

[11]  D. J. White,et al.  The set of efficient solutions for multiple objective shortest path problems , 1982, Comput. Oper. Res..

[12]  João C. N. Clímaco,et al.  A PC-BASED INTERACTIVE DECISION SUPPORT SYSTEM FOR TWO OBJECTIVE DIRECT DELIVERY PROBLEMS. , 1994 .

[13]  E. Martins,et al.  A computational improvement for a shortest paths ranking algorithm , 1994 .

[14]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[15]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[16]  Y. H. Chin,et al.  The quickest path problem , 1990, Comput. Oper. Res..

[17]  A. A. Elimam,et al.  Two engineering applications of a constrained shortest-path model , 1997 .

[18]  M. I. Henig.  The shortest path problem with two objective functions , 1986 .

[19]  J. Current,et al.  The maximum covering/shortest path problem: A multiobjective network design and routing formulation , 1985 .

[20]  Jared L. Cohon,et al.  An interactive approach to identify the best compromise solution for two objective shortest path problems , 1990, Comput. Oper. Res..

[21]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[22]  Y. Aneja,et al.  BICRITERIA TRANSPORTATION PROBLEM , 1979 .

[23]  John R. Current,et al.  Multiobjective transportation network design and routing problems: Taxonomy and annotation , 1993 .

[24]  Jared L. Cohon,et al.  THE MEDIAN SHORTEST PATH PROBLEM : A MULTIOBJECTIVE APPROACH TO ANALYZE COST VS. ACCESSIBILITY IN THE DESIGN OF TRANSPORTATION NETWORKS , 1987 .

[25]  H. G. Daellenbach,et al.  Note on Multiple Objective Dynamic Programming , 1980 .