A Dichotomic Algorithm for Transportation Network and Land Use Problem

Mamadou Koné, Mouhamadou A.M.T. Baldé and Babacar M. Ndiaye

Journal of Mathematics Research, 2019, vol. 11, issue 1, 42-56

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.

Keywords: land use; transportation network; assignment; algorithm; mixed integer programming (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.ccsenet.org/journal/index.php/jmr/article/download/0/0/38247/38944 (application/pdf)
http://www.ccsenet.org/journal/index.php/jmr/article/view/0/38247 (text/html)

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:ibn:jmrjnl:v:11:y:2019:i:1:p:42

Access Statistics for this article

More articles in Journal of Mathematics Research from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().