NETWORK DESIGN: SELECTION AND DESIGN OF LINKS AND FACILITY LOCATION

In this paper we introduce new network design problems. A network of potential links is given. Each link can be either constructed or not at a given cost. Also, each constructed link can be constructed either as a one-way or two-way link. The objective is to minimize the total construction and transportation costs. Two different transportation costs are considered: (i) traffic is generated between any pair of nodes and the transportation cost is the total cost for the users and (ii) demand for service is generated at each node and a facility is to be located on a node to satisfy the demand. The transportation cost in this case is the total cost for a round trip from the facility to each node and back. We will consider two options in regard to the links between nodes. They can either be two-way only, or mixed, with both two-way and one-way (in either direction) allowed. When these options are combined with the two objective functions, four basic problems are created. These problems are solved by a descent algorithm, simulated annealing, tabu search, and a genetic algorithm. Extensive computational results are presented.

[1]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[2]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[3]  Rajendra S. Solanki,et al.  Using decomposition in large-scale highway network design with a quasi-optimization heuristic , 1998 .

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

[5]  Hai Yang,et al.  Models and algorithms for road network design: a review and some new developments , 1998 .

[6]  Mark S. Daskin,et al.  AN INTEGRATED MODEL OF FACILITY LOCATION AND TRANSPORTATION NETWORK DESIGN , 2001 .

[7]  Zvi Drezner,et al.  Selecting an Optimum Configuration of One-Way and Two-Way Routes , 1997, Transp. Sci..

[8]  Panos M. Pardalos,et al.  Network Design: Connectivity and Facilities Location , 1998 .

[9]  Zvi Drezner,et al.  Using hybrid metaheuristics for the one‐way and two‐way network design problem , 2002 .

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

[11]  Suh-Wen Chiou.  OPTIMISATION ALGORITHMS FOR EQUILIBRIUM NETWORK DESIGN PROBLEM. , 1999 .

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

[13]  J. MacGregor Smith,et al.  Topological network design of pedestrian networks , 2001 .

[14]  George A. Marcoulides,et al.  Modern methods for business research , 1998 .

[15]  Terry L. Friesz,et al.  Disequilibrium Network Design: A New Paradigm for Transportation Planning and Control , 1998 .

[16]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .