| Article ID: | iaor2009640 |
| Country: | Poland |
| Volume: | 29 |
| Issue: | 3 |
| Start Page Number: | 725 |
| End Page Number: | 740 |
| Publication Date: | Jan 2000 |
| Journal: | Control and Cybernetics |
| Authors: | Salhi Said, Drezner Zvi |
| Keywords: | heuristics: tabu search |
The problem of designing a near optimal configuration 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 problem. These implementations are tested on a set of network problems with encouraging results.