Selecting an Optimum Configuration of One-Way and Two-Way Routes

The problem of designing a near optimal configura­ tion of a system of one-way and two-way routes is investigated. Each arc of the network can be designed as either a two-way arc or a one­ way arc in one of the two directions. The traffic speed on a one-way arc is faster than the speed on a two-way arc by a given factor. The problem is to design a network which minimizes total travel time between all pairs of nodes by the proper selection of one-way and two-way arcs. Efficient implementations of the metaheuristic tabu search are designed for solving this network design problem. These approaches are tested on a set of network problems with encouraging results.

[1]  Robert L. Vecellio.  Traffic Behavior on One-Way Signalized Arterials , 1977 .

[2]  Zheng Chen,et al.  Performance Analysis for Two Manhattan Street Network Routing Algorithms , 1993, Proceedings. IEEE International Symposium on Information Theory.

[3]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Pichai Pamanikabud.  Evaluation of the effect of Bangkok's one-way traffic system on environmental quality , 1987 .

[6]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[7]  Saïd Salhi,et al.  A Tabu Search Approach for the Resource Constrained Project Scheduling Problem , 1998, J. Heuristics.

[8]  H D Ratliff,et al.  Order Picking In An Aisle , 1988 .

[9]  A. J. Hejase.  Optimal path planning for a mobile robot , 1990, Proceedings of the 33rd Midwest Symposium on Circuits and Systems.

[10]  Pius J. Egbelu,et al.  Positioning of automated guided vehicles in a loop layout to improve response time , 1993 .

[11]  Chang Wan Kim,et al.  Operational control of a bidirectional automated guided vehicle system , 1993 .

[12]  Said Salhi,et al.  Heuristic Search Methods , 1998 .

[13]  R. Lo Cigno,et al.  Optimal routing algorithms for the bidirectional Manhattan Street network , 1991, ICC 91 International Conference on Communications Conference Record.

[14]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

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

[16]  S. Salhi,et al.  Local Search Strategies for the Vehicle Fleet Mix Problem , 1996 .

[17]  Stefan Voß,et al.  Dynamic tabu list management using the reverse elimination method , 1993, Ann. Oper. Res..

[18]  Gerald L. Thompson,et al.  A Dynamic Space-Time Network Flow Model for City Traffic Congestion , 1987, Transp. Sci..

[19]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[20]  Averill M. Law,et al.  The art and theory of dynamic programming , 1977 .

[21]  Yuzo Masuya.  INCREASING THE ROAD NETWORK CAPACITY BY INTRODUCING THE ONE-WAY STREET SYSTEM , 1985 .

[22]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[23]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[24]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[25]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[26]  Patrick Rivett,et al.  Principles of Operations Research , 1972 .

[27]  Zvi Drezner,et al.  Location on a One-Way Rectilinear Grid , 1995 .

[28]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..