IDEAS home Printed from https://ideas.repec.org/a/ibn/jmrjnl/v11y2019i1p42.html
   My bibliography  Save this article

A Dichotomic Algorithm for Transportation Network and Land Use Problem

Author

Listed:
  • 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.

Suggested Citation

  • Mamadou Koné & Mouhamadou A.M.T. Baldé & Babacar M. Ndiaye, 2019. "A Dichotomic Algorithm for Transportation Network and Land Use Problem," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 11(1), pages 42-56, February.
    • Handle: RePEc:ibn:jmrjnl:v:11:y:2019:i:1:p:42
    as

    Download full text from publisher

    File URL: http://www.ccsenet.org/journal/index.php/jmr/article/download/0/0/38247/38944
    Download Restriction: no
    File URL: http://www.ccsenet.org/journal/index.php/jmr/article/view/0/38247
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jen-Jia Lin & Cheng-Min Feng, 2003. "A bi-level programming model for the land use – network design problem," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 37(1), pages 93-105, February.
    2. Duranton, Gilles & Puga, Diego, 2015. "Urban Land Use," Handbook of Regional and Urban Economics, in: Gilles Duranton & J. V. Henderson & William C. Strange (ed.), Handbook of Regional and Urban Economics, edition 1, volume 5, chapter 0, pages 467-560, Elsevier.
    3. Lawrence J. Watters, 1967. "Letter to the Editor—Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems," Operations Research, INFORMS, vol. 15(6), pages 1171-1174, December.
    4. Fred Glover, 1975. "Improved Linear Integer Programming Formulations of Nonlinear Integer Problems," Management Science, INFORMS, vol. 22(4), pages 455-460, December.
    5. Alain Billionnet & Sourour Elloumi & Amélie Lambert, 2013. "An efficient compact quadratic convex reformulation for general integer quadratic programs," Computational Optimization and Applications, Springer, vol. 54(1), pages 141-162, January.
    6. Eugene L. Lawler, 1963. "The Quadratic Assignment Problem," Management Science, INFORMS, vol. 9(4), pages 586-599, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rostami, Borzou & Chassein, André & Hopf, Michael & Frey, Davide & Buchheim, Christoph & Malucelli, Federico & Goerigk, Marc, 2018. "The quadratic shortest path problem: complexity, approximability, and solution methods," European Journal of Operational Research, Elsevier, vol. 268(2), pages 473-485.
    2. Yang Wang & Wei Yang & Abraham P. Punnen & Jingbo Tian & Aihua Yin & Zhipeng Lü, 2021. "The Rank-One Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 979-996, July.
    3. Warren P. Adams & Stephen M. Henry, 2012. "Base-2 Expansions for Linearizing Products of Functions of Discrete Variables," Operations Research, INFORMS, vol. 60(6), pages 1477-1490, December.
    4. Sven Mallach, 2018. "Compact linearization for binary quadratic problems subject to assignment constraints," 4OR, Springer, vol. 16(3), pages 295-309, September.
    5. M. Hosein Zare & Juan S. Borrero & Bo Zeng & Oleg A. Prokopyev, 2019. "A note on linearized reformulations for a class of bilevel linear integer problems," Annals of Operations Research, Springer, vol. 272(1), pages 99-117, January.
    6. Warren Adams & Hanif Sherali, 2005. "A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems," Annals of Operations Research, Springer, vol. 140(1), pages 21-47, November.
    7. Frank Meijer & Renata Sotirov, 2020. "The quadratic cycle cover problem: special cases and efficient bounds," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 1096-1128, May.
    8. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
    9. David Bergman, 2019. "An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 477-492, July.
    10. Mouhamadou A. M. T. Baldé & Serigne Gueye & Babacar M. Ndiaye, 2021. "A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem," Operational Research, Springer, vol. 21(3), pages 1663-1690, September.
    11. Jingyang Zhou & Peter E.D. Love & Kok Lay Teo & Hanbin Luo, 2017. "An exact penalty function method for optimising QAP formulation in facility layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2913-2929, May.
    12. Hausman, Catherine & Stolper, Samuel, 2021. "Inequality, information failures, and air pollution," Journal of Environmental Economics and Management, Elsevier, vol. 110(C).
    13. Buchheim, Christoph & Crama, Yves & Rodríguez-Heck, Elisabeth, 2019. "Berge-acyclic multilinear 0–1 optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 102-107.
    14. Erich Battistin & Lorenzo Neri, 2017. "School Performance, Score Inflation and Economic Geography," Working Papers 837, Queen Mary University of London, School of Economics and Finance.
    15. Yokoyama, Ryohei & Kitano, Hiroyuki & Wakui, Tetsuya, 2017. "Optimal operation of heat supply systems with piping network," Energy, Elsevier, vol. 137(C), pages 888-897.
    16. Tian, Xueyu & You, Fengqi, 2019. "Carbon-neutral hybrid energy systems with deep water source cooling, biomass heating, and geothermal heat and power," Applied Energy, Elsevier, vol. 250(C), pages 413-432.
    17. Céline Grislain-Letrémy & Bertrand Villeneuve, 2019. "Natural disasters, land-use, and insurance," The Geneva Papers on Risk and Insurance Theory, Springer;International Association for the Study of Insurance Economics (The Geneva Association), vol. 44(1), pages 54-86, March.
    18. Dingel, Jonathan I. & Miscio, Antonio & Davis, Donald R., 2021. "Cities, lights, and skills in developing economies," Journal of Urban Economics, Elsevier, vol. 125(C).
    19. Venables, Anthony & Duranton, Gilles, 2018. "Place-Based Policies for Development," CEPR Discussion Papers 12889, C.E.P.R. Discussion Papers.
    20. Albouy, David & Behrens, Kristian & Robert-Nicoud, Frédéric & Seegert, Nathan, 2019. "The optimal distribution of population across cities," Journal of Urban Economics, Elsevier, vol. 110(C), pages 102-113.

    More about this item

    Keywords

    land use; transportation network; assignment; algorithm; mixed integer programming;
    All these keywords.

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ibn:jmrjnl:v:11:y:2019:i:1:p:42. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.