IDEAS home Printed from https://ideas.repec.org/a/sae/envira/v10y1978i11p1287-1305.html
   My bibliography  Save this article

Optimum Facility Location by Accessibility Maximizing

Author

Listed:
  • G Leonardi

    (Istituto di Scienza dei Sistemi Architettonici e Territoriali, Facoltá di Architettura, Politecnico di Torino, Turin, Italy)

Abstract

A mathematical-programming approach to facility location is developed. The objective function assumed for optimization is an accessibility measure. It is shown that, by suitably defining this measure, one can get solutions closely related to, if not identical with, the ones given in many current formulations of the location problem. This is believed to be an interesting result in itself, as it shows how the programming approach can unify different strands of research in this field. Moreover the mathematical-programming tools allow a deep analysis of the properties of the solution points, which can be difficult with other methods. Also the interpretation of facility location as an optimization problem not only gives theoretical support to some well-known location algorithms but also shows how to generalize and improve them.

Suggested Citation

  • G Leonardi, 1978. "Optimum Facility Location by Accessibility Maximizing," Environment and Planning A, , vol. 10(11), pages 1287-1305, November.
    • Handle: RePEc:sae:envira:v:10:y:1978:i:11:p:1287-1305
    DOI: 10.1068/a101287
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/a101287
    Download Restriction: no
    File URL: https://libkey.io/10.1068/a101287?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. Willard I. Zangwill, 1969. "Convergence Conditions for Nonlinear Programming Algorithms," Management Science, INFORMS, vol. 16(1), pages 1-13, September.
    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. Aura Reggiani, 2012. "Accessibility, connectivity and resilience in complex networks," Chapters, in: Karst T. Geurs & Kevin J. Krizek & Aura Reggiani (ed.), Accessibility Analysis and Transport Planning, chapter 2, pages 15-36, Edward Elgar Publishing.
    2. Cascetta, Ennio & Cartenì, Armando & Montanino, Marcello, 2016. "A behavioral model of accessibility based on the number of available opportunities," Journal of Transport Geography, Elsevier, vol. 51(C), pages 45-58.
    3. repec:elg:eechap:14395_20 is not listed 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. Jochen Gorski & Frank Pfeuffer & Kathrin Klamroth, 2007. "Biconvex sets and optimization with biconvex functions: a survey and extensions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(3), pages 373-407, December.
    2. Sunil Dutta & Stefan J. Reichelstein, 2019. "Capacity Rights and Full Cost Transfer Pricing," CESifo Working Paper Series 7968, CESifo.
    3. Jan Leeuw & Forrest Young & Yoshio Takane, 1976. "Additive structure in qualitative data: An alternating least squares method with optimal scaling features," Psychometrika, Springer;The Psychometric Society, vol. 41(4), pages 471-503, December.
    4. Ferrari, Paolo, 2005. "Road pricing and users' surplus," Transport Policy, Elsevier, vol. 12(6), pages 477-487, November.
    5. Raoul Pietersz & Patrick Groenen, 2004. "Rank reduction of correlation matrices by majorization," Quantitative Finance, Taylor & Francis Journals, vol. 4(6), pages 649-662.

    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:envira:v:10:y:1978:i:11:p:1287-1305. 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.