IDEAS home Printed from https://ideas.repec.org/a/sae/inrsre/v37y2014i2p129-148.html
   My bibliography  Save this article

Corridor Location for Infrastructure Development

Author

Listed:
  • F. Antonio Medrano
  • Richard L. Church

Abstract

Corridor location for developing new infrastructure such as transmission lines, roadways, and pipelines over terrain must consider numerous factors when determining the set of optimal route candidates. Previous researchers have cast this problem as a multiobjective least cost path problem, where competing objectives represent cost, environmental impact, and other major noncommensurate objectives. To fully characterize the optimal trade-off solution set, one must be able to generate both supported and unsupported nondominated solutions. Fortunately, the supported, nondominated solutions are relatively easy to identify by using a single-objective shortest path algorithm in conjunction with the noninferior set estimation method of Cohon, Church, and Sheer. But, finding the unsupported nondominated solutions can be nondeterministic polynomial time hard. This article proposes a heuristic approach that is capable of determining a Pareto frontier that is very near exact in polynomial time. This heuristic approach uses gateway node and gateway arc paths to generate a large set of spatially diverse locally optimal candidate solutions with few shortest path solver iterations, which are shown to represent a solution set that approximates to a high degree, the exact Pareto set. The method is described within the context of a bi-objective corridor location problem and applied to several data sets that have been used in past work. A comparison between this new approach and existing exact algorithms is provided. Overall, the new method is shown to be effective at finding a sizable number of the unsupported nondominated solutions in a very small amount of computational time.

Suggested Citation

  • F. Antonio Medrano & Richard L. Church, 2014. "Corridor Location for Infrastructure Development," International Regional Science Review, , vol. 37(2), pages 129-148, April.
    • Handle: RePEc:sae:inrsre:v:37:y:2014:i:2:p:129-148
    DOI: 10.1177/0160017613507772
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/0160017613507772
    Download Restriction: no
    File URL: https://libkey.io/10.1177/0160017613507772?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. Solanki, Rajendra S. & Appino, Perry A. & Cohon, Jared L., 1993. "Approximating the noninferior set in multiobjective linear programming problems," European Journal of Operational Research, Elsevier, vol. 68(3), pages 356-373, 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. Rennen, G. & van Dam, E.R. & den Hertog, D., 2009. "Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets," Other publications TiSEM e2255959-6691-4ef1-88a4-5, Tilburg University, School of Economics and Management.
    2. Gijs Rennen & Edwin R. van Dam & Dick den Hertog, 2011. "Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 493-517, November.
    3. Raimundo, Marcos M. & Ferreira, Paulo A.V. & Von Zuben, Fernando J., 2020. "An extension of the non-inferior set estimation algorithm for many objectives," European Journal of Operational Research, Elsevier, vol. 284(1), pages 53-66.
    4. Janusz Miroforidis, 2021. "Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems," Journal of Global Optimization, Springer, vol. 80(3), pages 617-634, July.
    5. Ehrgott, Matthias & Skriver, Anders J. V., 2003. "Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach," European Journal of Operational Research, Elsevier, vol. 147(3), pages 657-664, June.
    6. Ehrgott, Matthias & Tenfelde-Podehl, Dagmar, 2003. "Computation of ideal and Nadir values and implications for their use in MCDM methods," European Journal of Operational Research, Elsevier, vol. 151(1), pages 119-139, November.
    7. Özgür Özpeynirci & Murat Köksalan, 2010. "An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs," Management Science, INFORMS, vol. 56(12), pages 2302-2315, December.
    8. Skriver, Anders J. V. & Andersen, Kim Allan & Holmberg, Kaj, 2004. "Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives," European Journal of Operational Research, Elsevier, vol. 156(3), pages 541-549, August.
    9. Koenen, Melissa & Balvert, Marleen & Fleuren, H.A., 2023. "A Renewed Take on Weighted Sum in Sandwich Algorithms : Modification of the Criterion Space," Discussion Paper 2023-012, Tilburg University, Center for Economic Research.
    10. Leung, PingSun & Heen, Knut & Bardarson, Hermann, 2001. "Regional economic impacts of fish resources utilization from the Barents Sea: Trade-offs between economic rent, employment and income," European Journal of Operational Research, Elsevier, vol. 133(2), pages 432-446, January.
    11. Koenen, Melissa & Balvert, Marleen & Fleuren, H.A., 2023. "A Renewed Take on Weighted Sum in Sandwich Algorithms : Modification of the Criterion Space," Other publications TiSEM 795b6c0c-c7bc-4ced-9d6b-a, Tilburg University, School of Economics and Management.
    12. Rasmus Bokrantz & Anders Forsgren, 2013. "An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 377-393, May.

    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:inrsre:v:37:y:2014:i:2:p:129-148. 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.