Interactive Design of Sustainable Cities with a Distributed Local Search Solver

  • Bruno Belin
  • Marc Christie
  • Charlotte Truchet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8451)


Within the last decades, the design of more sustainable cities has emerged as a central society issue. A city, in the early stage of its design process, is modeled as a balanced set of urban shapes (residential, commercial, or industrial units, together with infrastructures, schools, parks) that need to be spatially organized following complex rules. To assist urban planners and decision makers in this largely manual and iterative endeavor, we propose the design of a computer-aided decision tool which first automatically organizes urban shapes over a given empty territory, and then offer interactive manipulators that allow the experts to modify the spatial organization, while maintaining relations between shapes and informing experts of the impact of their choices. We cast the problem as a Local Search optimization in which we perform a sequence of swaps between urban shapes, starting from a random initial assignment. We extend the algorithm with novel heuristics to improve computational costs and propose an efficient distributed version. The same algorithm is used for the automated and interactive stages of the design process. The benefits of our approach are highlighted by examples and feedbacks from experts in the domain.


Interactive Design Urban Designer Urban Planner Adaptive Search Individual House 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    United-Nations: Urban and rural areas, world urbanization prospects: The, revision (2007)Google Scholar
  2. 2.
    Mars, N., Hornsby, A., Foundation, D.C.: The Chinese Dream: A Society Under Construction. 010 Publishers (2008)Google Scholar
  3. 3.
    Waddell, P.: Urbansim: Modeling urban development for land use, transportation, and environmental planning. Journal of the American Planning Association 68(3), 297–314 (2002)CrossRefGoogle Scholar
  4. 4.
    Dury, A., Le Ber, F., Chevrier, V.: A reactive approach for solving constraint satisfaction problems. In: Papadimitriou, C., Singh, M.P., Müller, J.P. (eds.) ATAL 1998. LNCS (LNAI), vol. 1555, pp. 397–411. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  5. 5.
    Parish, Y.I., Müller, P.: Procedural modeling of cities. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, pp. 301–308. ACM (2001)Google Scholar
  6. 6.
    Watson, B., Muller, P., Wonka, P., Sexton, C., Veryovka, O., Fuller, A.: Procedural urban modeling in practice. IEEE Computer Graphics and Applications 28(3), 18–26 (2008)CrossRefGoogle Scholar
  7. 7.
    Lechner, T., Ren, P., Watson, B., Brozefski, C., Wilenski, U.: Procedural modeling of urban land use. In: ACM SIGGRAPH 2006 Research posters, SIGGRAPH 2006. ACM, New York (2006)Google Scholar
  8. 8.
    Vanegas, C.A., Aliaga, D.G., Wonka, P., Müller, P., Waddell, P., Watson, B.: Modelling the appearance and behaviour of urban spaces. In: Computer Graphics Forum, vol. 29, pp. 25–42. Wiley Online Library (2010)Google Scholar
  9. 9.
    Kwartler, M., Bernard, R.: Communityviz: an integrated planning support system. In: Planning Support Systems (November 2001)Google Scholar
  10. 10.
    Antoni, J.: Modéliser la ville: Formes urbaines et politiques de transport, Collection “Méthodes et approches”. Economica (2010)Google Scholar
  11. 11.
    Moujahed, S., Simonin, O., Koukam, A.: Location problems optimization by a self-organizing multiagent approach. Multiagent and Grid Systems 5(1), 59–74 (2009)MATHGoogle Scholar
  12. 12.
    Jussien, N., Rochart, G., Lorca, X.: Choco: An Open Source Java Constraint Programming Library. In: CPAIOR 2008 Workshop on Open-Source Software for Integer and Contraint Programming (CPAIOR 2008), pp. 1–10 (2008)Google Scholar
  13. 13.
    Codognet, P., Díaz, D.: Yet another local search method for constraint solving. In: Steinhöfel, K. (ed.) SAGA 2001. LNCS, vol. 2264, pp. 73–89. Springer, Heidelberg (2001)Google Scholar
  14. 14.
    Caniou, Y., Codognet, P., Diaz, D., Abreu, S.: Experiments in parallel constraint-based local search. In: Merz, P., Hao, J.-K. (eds.) EvoCOP 2011. LNCS, vol. 6622, pp. 96–107. Springer, Heidelberg (2011)Google Scholar
  15. 15.
    Diaz, D., Abreu, S., Codognet, P.: Targeting the cell/be for constraint-based local search. Concurrency and Computation: Practice and Experience 24(6), 647–660 (2012)CrossRefGoogle Scholar
  16. 16.
    Talbi, E.: Metaheuristics: From Design to Implementation. Wiley Series on Parallel and Distributed Computing. Wiley (2009)Google Scholar
  17. 17.
    Gaspero, L.D., Schaerf, A.: Easylocal++: An object-oriented framework for the flexible design of local-search algorithms. Softw. Pract. Exper. 33(8), 733–765 (2003)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Bruno Belin
    • 1
  • Marc Christie
    • 2
  • Charlotte Truchet
    • 1
  1. 1.Laboratoire d’Informatique de Nantes AtlantiqueUniversity of NantesNantesFrance
  2. 2.IRISA/INRIA Rennes Bretagne AtlantiqueUniversity of Rennes 1RennesFrance

Personalised recommendations