A Dichotomic Algorithm for Transportation Network and Land Use Problem


  •  Mamadou Koné    
  •  Mouhamadou A.M.T. Baldé    
  •  Babacar M. Ndiaye    

Abstract

Redeveloping sites to accommodate housing or new economic activities is a major urban policy challenge. This problem belongs to the class of NP-hard problems. In this paper, we present an attractive mixed integer nonlinear programming formulation for the transportation network and land use problem. We first introduce a new useful nonlinear formulation of this challenging combinatorial optimization problem. Then, an alternative to considering a linearity of the constraints is to reformulate the problem as a new exact, compact discrete linear model. The problem is solved by our new algorithm and numerical results are presented for a number of test problems in academics instances.



This work is licensed under a Creative Commons Attribution 4.0 License.
  • Issn(Print): 1916-9795
  • Issn(Onlne): 1916-9809
  • Started: 2009
  • Frequency: bimonthly

Journal Metrics

Google-based Impact Factor (2018): 3.1

  • h-index (August 2018): 16
  • i10-index (August 2018): 35
  • h5-index (August 2018): 9
  • h5-median (August 2018): 9

( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )

Contact