Minimum-cost strong network orientation problems : classification, complexity, and algorithms

In the minimum-cost strong network orientation problem (MCSO), we are given an undirected graph G = (V, E) with nonnegative edge lengths (e) and a transportation schedule T = {(s 1 , t 1 , w 1 ), ..., (s k , t k , w k )}, where w i units of weight have to be transported from the source vertex s i to the target vertex t i for i = 1,..., k. Let G σ be a strongly connected orientation of G and let L σ i be the length of the shortest (directed) path from S i to t i in G σ . The goal in the MCSO is to find a strongly connected orientation G σ such that the overall cost of the orientation given by Σ k i=1 w i L σ i (sum case) or max i=1, … ,k w i L σ i (bottleneck case) is minimized. The strong network orientation problem is motivated by the practical problem of designing the optimal unidirectional flow path of automated guided vehicles. In this paper, we investigate the MCSO from the algorithmic and complexity points of view and propose a classification scheme. In the first part of the paper, we identify several efficiently solvable cases of the MCSO with sum and bottleneck objective functions which arise if additional restrictions are imposed on the structure of the graph G, the edge lengths (e), and/or the transportation schedule T. In the second part, we identify special cases of the MCSO which are NP-hard.

[1]  M. A. Venkataramanan,et al.  A branch‐and‐bound algorithm for flow‐path design of automated guided vehicle systems , 1991 .

[2]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[3]  R. Duffin.  Topology of series-parallel networks , 1965 .

[4]  Eugene L. Lawler,et al.  The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[5]  Fred S. Roberts,et al.  On the Optimal Strongly Connected Orientations of City Street Graphs IV: Four East-West Avenues or North-South Streets , 1994, Discret. Appl. Math..

[6]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[7]  Wen-Chyuan Chiang,et al.  Heuristic unidirectional flowpath design approaches for automated guided vehicle systems , 1992 .

[8]  Eng Guan Tay,et al.  On optimal orientations of Cartesian products of even cycles and paths , 1997, Networks.

[9]  Gregory Gutin,et al.  Minimizing and maximizing the diameter in orientations of graphs , 1994, Graphs Comb..

[10]  J. Tanchoco,et al.  Optimal flow path design of unidirectional AGV systems , 1990 .

[11]  Fred S. Roberts,et al.  On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids , 1988, SIAM J. Discret. Math..

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

[13]  Wen-Chyuan Chiang,et al.  Simulated annealing and tabu search approaches to unidirectional flowpath design for Automated Guided Vehicle Systems , 1994, Ann. Oper. Res..

[14]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[15]  Fred S. Roberts,et al.  On the optimal strongly connected orientations of city street graphs. III. Three east-west avenues or north-south streets , 1989, Networks.

[16]  Carsten Thomassen,et al.  Distances in orientations of graphs , 1975, J. Comb. Theory, Ser. B.

[17]  J. M. A. Tanchoco,et al.  Flow path design for automated guided vehicle systems , 1987 .

[18]  H. Robbins.  A Theorem on Graphs, with an Application to a Problem of Traffic Control , 1939 .