4.7 Article

A meta-heuristic approach for solving the Urban Network Design Problem

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 201, Issue 1, Pages 144-157

Publisher

ELSEVIER
DOI: 10.1016/j.ejor.2009.02.026

Keywords

Network design; Transportation; Scatter Search

Ask authors/readers for more resources

This paper proposes an optimisation model and a meta-heuristic algorithm for solving the urban network design problem. The problem consists in optimising the layout of an urban road network by designing directions of existing roads and signal settings at intersections. A non-linear constrained optimisation model for solving this problem is formulated, adopting a bi-level approach in order to reduce the complexity of solution methods and the computation times. A Scatter Search algorithm based on a random descent method is proposed and tested on a real dimension network. Initial results show that the proposed approach allows local optimal solutions to be obtained in reasonable computation times. (C) 2009 Elsevier B. V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available