Abstract

Our paper deals with the Transportation Network and Land Use (TNLU) problem. It consists in finding, simultaneously, the best location of urban area activities, as well as of the road network design that may minimize the moving cost in the network, and the network costs. We propose a new mixed integer programming formulation of the problem, and a new heuristic method for the resolution of TNLU. Then, we give a methodology to find locations or relocations of some Dakar region amenities (home, shop, work and leisure places), that may reduce travel time or travel distance. The proposed methodology mixes multi-agent simulation with combinatorial optimization techniques; that is individual agent strategies versus global optimization using Geographical Information System. Numerical results which show the effectiveness of the method, and simulations based on the scenario of Dakar city are given.

Highlights

  • The Transportation Network and Land Use (TNLU) problem is a combination of transportation network optimization problem and land use planning or quadratic assignment problem

  • The heuristics that we propose are based on Shortest Path (SP), Location of Activity (LA) and Network Design (ND) problems

  • For real life simulation of Dakar we could get from the DGTC (Direction des Travaux Geographiques et Cartographiques), a zonal division of the region into zones corresponding to the 2000 Census Report information with projection to 2015

Read more

Summary

Introduction

The Transportation Network and Land Use (TNLU) problem is a combination of transportation network optimization problem and land use planning or quadratic assignment problem This model appear, for example, if we decided to find locations or relocations of some Dakar region amenities (home, shop, work, leisure places), that may reduce travel time or travel distance. Among the researchers who are interested in the combined problem we can cite Marc Los and more recently Lin and Feng (2003) They have considered a more complex model in the sense that their formulation allows the location of several activities in the same area.

Formulation of the Model
Lower Bound Based on Distances
Numerical Simulations on Test Problems
Tests on Academic Instances
Tests on Dakar City
20 Bar restaurant
Multi-agent Simulations
SDO computations on Dakar City
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.