A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Network design: selection and design of links and facility location
AbstractIn 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.
Network design: selection and design of links and facility location
AbstractIn 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.
Network design: selection and design of links and facility location
Drezner, Zvi (author) / Wesolowsky, George O (author)
Transportation Research Part A: Policy and Practice ; 37 ; 241-256
2002-04-25
16 pages
Article (Journal)
Electronic Resource
English
Network design: selection and design of links and facility location
| Online Contents | 2003
Solutions to Facility Location–Network Design Problems
| DataCite | 2008
An integrated model of facility location and transportation network design
| Online Contents | 2001
Facility Location-Network Design Problem: Reliability and Investment Budget Constraint
| British Library Online Contents | 2014