NETWORK DESIGN OF ONE‐WAY STREETS WITH SIMULATED ANNEALING

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 42 citations exist upstream.