[go: up one dir, main page]

IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v274y2019i3p1125-1137.html
   My bibliography  Save this article

Integer programming for urban design

Author

Listed:
  • Hua, Hao
  • Hovestadt, Ludger
  • Tang, Peng
  • Li, Biao
Abstract
We present an integer program (IP) for urban design that (1) maximizes the floor area; (2) fills building volume with room templates; (3) encodes translational symmetry in urban layout; and (4) constructs economical urban routes. Regardless that integer programming is intensively studied in operational research (OR), its role in solving geometrical and topological problems in urban design was overlooked. Based on a regular grid, our 0–1 IP formulates the sunlight-gain rules, which give urban sites their shapes, especially for residential projects. With predefined plot templates, the gross floor area (volume) within a given site can be maximized under various sunlight requirements. Subsequently, the IP fills each building volume with 2D/3D room templates. Finally, an IP-based algorithm constructs routes that connect all plots and the site’s entrances to public transportation. Both the classical Steiner tree model and the latest coverage network model are extended to create reasonable routes. In addition, this work extends the concept of special ordered sets (SOS) to encode translational symmetry in urban layouts. Encoding layout symmetry can benefit from the solvers’ SOS2 mechanism in the Branch-and-Bound search algorithm. The results indicate that traditional decision making for cities could be partially automated by IP and an abundance of valid solutions are available for designers.

Suggested Citation

  • Hua, Hao & Hovestadt, Ludger & Tang, Peng & Li, Biao, 2019. "Integer programming for urban design," European Journal of Operational Research, Elsevier, vol. 274(3), pages 1125-1137.
  • Handle: RePEc:eee:ejores:v:274:y:2019:i:3:p:1125-1137
    DOI: 10.1016/j.ejor.2018.10.055
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718309238
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2018.10.055?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Friedrich, Christian & Klausnitzer, Armin & Lasch, Rainer, 2018. "Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance," European Journal of Operational Research, Elsevier, vol. 270(3), pages 837-851.
    2. Heragu, Sunderesh S. & Kusiak, Andrew, 1991. "Efficient models for the facility layout problem," European Journal of Operational Research, Elsevier, vol. 53(1), pages 1-13, July.
    3. Friedrich, C. & Klausnitzer, A. & Lasch, R., 2018. "Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 94867, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2003. "A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems," Management Science, INFORMS, vol. 49(9), pages 1268-1273, September.
    5. Samaniego, Horacio & Moses, Melanie E., 2008. "Cities as Organisms: Allometric Scaling of Urban Road Networks," The Journal of Transport and Land Use, Center for Transportation Studies, University of Minnesota, vol. 1(1), pages 21-39.
    6. André R. S. Amaral, 2008. "An Exact Approach to the One-Dimensional Facility Layout Problem," Operations Research, INFORMS, vol. 56(4), pages 1026-1033, August.
    7. Li, Jinhua & Smith, Alice E., 2018. "Block layout for attraction-based enterprises," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1100-1112.
    8. Juan Pablo Vielma & Shabbir Ahmed & George Nemhauser, 2010. "Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions," Operations Research, INFORMS, vol. 58(2), pages 303-315, April.
    9. Hammad, Ahmed W A & Akbarnezhad, Ali & Rey, David, 2017. "Sustainable urban facility location: Minimising noise pollution and network congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 38-59.
    10. Amaral, Andre R.S., 2006. "On the exact solution of a facility layout problem," European Journal of Operational Research, Elsevier, vol. 173(2), pages 508-518, September.
    11. Kothari, Ravi & Ghosh, Diptesh, 2012. "Sensitivity Analysis for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    12. Kothari, Ravi & Ghosh, Diptesh, 2012. "Scatter Search Algorithms for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    13. Coutinho-Rodrigues, João & Tralhão, Lino & Alçada-Almeida, Luís, 2012. "A bi-objective modeling approach applied to an urban semi-desirable facility location problem," European Journal of Operational Research, Elsevier, vol. 223(1), pages 203-213.
    14. Ploskas, Nikolaos & Samaras, Nikolaos, 2015. "Efficient GPU-based implementations of simplex type algorithms," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 552-570.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rodrigues, Eugénio & Fernandes, Marco S. & Gomes, Álvaro & Gaspar, Adélio Rodrigues & Costa, José J., 2019. "Performance-based design of multi-story buildings for a sustainable urban environment: A case study," Renewable and Sustainable Energy Reviews, Elsevier, vol. 113(C), pages 1-1.
    2. Jacke, Christian O. & Heck-Großek, Nicholas, 2020. "HIV-Report: Epidemiologische und gesundheitsökonomische Entwicklungen bei Privatversicherten," WIP-Analysen 2/2020, WIP – Wissenschaftliches Institut der PKV.
    3. Ahmed WA Hammad & Ali Akbarnezhad & Assed Haddad & Elaine Garrido Vazquez, 2019. "Sustainable Zoning, Land-Use Allocation and Facility Location Optimisation in Smart Cities," Energies, MDPI, vol. 12(7), pages 1-23, April.
    4. Yang, Yuwen & Bidkhori, Hoda & Rajgopal, Jayant, 2021. "Optimizing vaccine distribution networks in low and middle-income countries," Omega, Elsevier, vol. 99(C).
    5. Leibowicz, Benjamin D., 2020. "Urban land use and transportation planning for climate change mitigation: A theoretical framework," European Journal of Operational Research, Elsevier, vol. 284(2), pages 604-616.

    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. Palubeckis, Gintaras, 2015. "Fast local search for single row facility layout," European Journal of Operational Research, Elsevier, vol. 246(3), pages 800-814.
    2. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank, 2020. "Decorous combinatorial lower bounds for row layout problems," European Journal of Operational Research, Elsevier, vol. 286(3), pages 929-944.
    3. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    4. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank & Hungerländer, Philipp & Maier, Kerstin, 2023. "Exact approaches for the combined cell layout problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 530-546.
    5. Mariem Besbes & Marc Zolghadri & Roberta Costa Affonso & Faouzi Masmoudi & Mohamed Haddar, 2020. "A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search," Journal of Intelligent Manufacturing, Springer, vol. 31(3), pages 615-640, March.
    6. Uma Kothari & Diptesh Ghosh, 2012. "A Competitive Genetic Algorithm for Single Row Facility Layout," Working Papers id:4915, eSocialSciences.
    7. Kothari, Ravi & Ghosh, Diptesh, 2013. "Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods," European Journal of Operational Research, Elsevier, vol. 224(1), pages 93-100.
    8. Anjos, Miguel F. & Vieira, Manuel V.C., 2017. "Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions," European Journal of Operational Research, Elsevier, vol. 261(1), pages 1-16.
    9. Guan, Jian & Lin, Geng, 2016. "Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem," European Journal of Operational Research, Elsevier, vol. 248(3), pages 899-909.
    10. Philipp Hungerländer & Franz Rendl, 2013. "A computational study and survey of methods for the single-row facility layout problem," Computational Optimization and Applications, Springer, vol. 55(1), pages 1-20, May.
    11. Anjos, Miguel F. & Fischer, Anja & Hungerländer, Philipp, 2018. "Improved exact approaches for row layout problems with departments of equal length," European Journal of Operational Research, Elsevier, vol. 270(2), pages 514-529.
    12. Hungerländer, Philipp & Anjos, Miguel F., 2015. "A semidefinite optimization-based approach for global optimization of multi-row facility layout," European Journal of Operational Research, Elsevier, vol. 245(1), pages 46-61.
    13. Kothari, Ravi & Ghosh, Diptesh, 2012. "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    14. Ramazan Şahin & Sadegh Niroomand & Esra Duygu Durmaz & Saber Molla-Alizadeh-Zavardehi, 2020. "Mathematical formulation and hybrid meta-heuristic solution approaches for dynamic single row facility layout problem," Annals of Operations Research, Springer, vol. 295(1), pages 313-336, December.
    15. Datta, Dilip & Amaral, André R.S. & Figueira, José Rui, 2011. "Single row facility layout problem using a permutation-based genetic algorithm," European Journal of Operational Research, Elsevier, vol. 213(2), pages 388-394, September.
    16. Christensen, Tue R.L. & Labbé, Martine, 2015. "A branch-cut-and-price algorithm for the piecewise linear transportation problem," European Journal of Operational Research, Elsevier, vol. 245(3), pages 645-655.
    17. Ghosh, Diptesh, 2011. "An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem," IIMA Working Papers WP2011-08-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    18. Ghosh, Diptesh & Kothari, Ravi, 2012. "Population Heuristics for the Corridor Allocation Problem," IIMA Working Papers WP2012-09-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    19. André R. S. Amaral, 2008. "An Exact Approach to the One-Dimensional Facility Layout Problem," Operations Research, INFORMS, vol. 56(4), pages 1026-1033, August.
    20. Mehmet Burak Şenol & Ekrem Alper Murat, 2023. "A sequential solution heuristic for continuous facility layout problems," Annals of Operations Research, Springer, vol. 320(1), pages 355-377, January.

    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:eee:ejores:v:274:y:2019:i:3:p:1125-1137. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.