IDEAS home Printed from https://ideas.repec.org/a/sae/envirb/v20y1993i6p617-643.html
   My bibliography  Save this article

The “Continuous Search Space Design Method†(CSSDM)

Author

Listed:
  • L Virirakis

    (National Technical University of Athens, Odos 28 Octovriou 42, Department of Architecture, 10682 Athens, Greece)

Abstract

In this paper a formal method is presented in which architectural design is considered as a problem-solving activity. The particular feature of the proposed method is that the search space is defined as continuous, without restricting or violating the emergence of qualitative features of a solution. This makes it possible to define architectural design as a problem, in a general way, and to apply a heuristic search strategy capable of overcoming complexity constraints, even in search spaces of large dimensionality. The method is called the “continuous search space design method†or CSSDM. A technique for representing the search space as continuous, a language for formulating the solution-evaluation criterion, and a heuristic technique for producing acceptable solutions, followed by experimental results, are presented.

Suggested Citation

  • L Virirakis, 1993. "The “Continuous Search Space Design Method†(CSSDM)," Environment and Planning B, , vol. 20(6), pages 617-643, December.
    • Handle: RePEc:sae:envirb:v:20:y:1993:i:6:p:617-643
    DOI: 10.1068/b200617
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/b200617
    Download Restriction: no
    File URL: https://libkey.io/10.1068/b200617?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
    ---><---

    References listed on IDEAS

    as
    1. L. R. Foulds, 1983. "Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent," Management Science, INFORMS, vol. 29(12), pages 1414-1426, December.
    2. Deepak Bammi & Dalip Bammi, 1979. "Development of a Comprehensive Land Use Plan by Means of a Multiple Objective Mathematical Programming Model," Interfaces, INFORMS, vol. 9(2-part-2), pages 50-63, February.
    3. Ellis L. Johnson & Michael M. Kostreva & Uwe H. Suhl, 1985. "Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models," Operations Research, INFORMS, vol. 33(4), pages 803-819, August.
    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. Oléron-Evans, Thomas P. & Salhab, Melda, 2021. "Optimal land use allocation for the Heathrow opportunity area using multi-objective linear programming," Land Use Policy, Elsevier, vol. 105(C).
    2. Bagloee, Saeed Asadi & Asadi, Mohsen, 2015. "Prioritizing road extension projects with interdependent benefits under time constraint," Transportation Research Part A: Policy and Practice, Elsevier, vol. 75(C), pages 196-216.
    3. H Briassoulis, 1995. "Land Development in the Vicinity of Hazardous Facilities: A Compromise Assignment Procedure," Environment and Planning B, , vol. 22(5), pages 509-525, October.
    4. Stefan Helber & Daniel Böhme & Farid Oucherif & Svenja Lagershausen & Steffen Kasper, 2016. "A hierarchical facility layout planning approach for large and complex hospitals," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 5-29, June.
    5. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    6. Afsana Haque & Yasushi Asami, 2011. "Optimizing Urban Land-Use Allocation: Case Study of Dhanmondi Residential Area, Dhaka, Bangladesh," Environment and Planning B, , vol. 38(3), pages 388-410, June.
    7. W. Ogryczak & K. Zorychta, 1994. "Modular Optimizer for Mixed Integer Programming MOMIP Version 2.1," Working Papers wp94035, International Institute for Applied Systems Analysis.
    8. Paul D. Dowling & R. F. Love, 1990. "Floor layouts using a multifacility location model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 945-952, December.
    9. Bertsimas, Dimitris & Orlin, James B., 1953-., 1991. "A technique for speeding up the solution of the Lagrangean dual," Working papers 3278-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    10. J T Diamond & J R Wright, 1988. "Design of an Integrated Spatial Information System for Multiobjective Land-Use Planning," Environment and Planning B, , vol. 15(2), pages 205-214, June.
    11. Monique Guignard & Ellis Johnson & Kurt Spielberg, 2005. "Logical Processing for Integer Programming," Annals of Operations Research, Springer, vol. 140(1), pages 263-304, November.
    12. R Sharpe & B S Marksjö, 1985. "Facility Layout Optimization Using the Metropolis Algorithm," Environment and Planning B, , vol. 12(4), pages 443-453, December.
    13. Kurt Spielberg, 2007. "IP over 40+ Years at IBM Scientific Centers and Marketing," Annals of Operations Research, Springer, vol. 149(1), pages 195-208, February.
    14. Gabriel, Steven A. & Faria, Jose A. & Moglen, Glenn E., 2006. "A multiobjective optimization approach to smart growth in land development," Socio-Economic Planning Sciences, Elsevier, vol. 40(3), pages 212-248, September.
    15. Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
    16. 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.
    17. Ellis Johnson, 2007. "My experiences as a student and researcher in OR during the 1960’s and 70’s," Annals of Operations Research, Springer, vol. 149(1), pages 121-135, February.
    18. Xiangyong Li & Y. P. Aneja, 2012. "A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 443-456, August.
    19. Robert E. Bixby & Eva K. Lee, 1998. "Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut," Operations Research, INFORMS, vol. 46(3), pages 355-367, June.
    20. R. Lougee-Heimer & W. Adams, 2005. "A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs," Annals of Operations Research, Springer, vol. 139(1), pages 289-320, October.

    More about this item

    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:sae:envirb:v:20:y:1993:i:6:p:617-643. 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: SAGE Publications (email available below). General contact details of provider: .

    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.