NETWORK DESIGN OF ONE‐WAY STREETS WITH SIMULATED ANNEALING

Chi‐Kang Lee and Kuang‐I Yang

Papers in Regional Science, 1994, vol. 73, issue 2, 119-134

Abstract: ABSTRACT This paper reports on an attempt to use a simulated annealing algorithm to solve a discrete equilibrium network design model for planning one way streets in urban areas. There has been little research on applying network design techniques to the widely used traffic management strategy of one way streets, and there has been an interest in applying global search methods to large scale and difficult problems The paper explains how to develop an algorithm by following the general framework of simulated annealing for a discrete network in which a heuristic and a simulated annealing algorithm may be a useful addition to the arsenal of techniques for researchers and practitioners who wish to tackle discrete equilibrium network design problems.

Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1111/j.1435-5597.1994.tb00606.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:presci:v:73:y:1994:i:2:p:119-134

Access Statistics for this article

Papers in Regional Science is currently edited by Jouke van Dijk

More articles in Papers in Regional Science from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().