IDEAS home Printed from https://ideas.repec.org/a/taf/conmgt/v26y2008i5p433-446.html
   My bibliography  Save this article

A compromise programming model for site selection of borrow pits

Author

Listed:
  • John-Paris Pantouvakis
  • Odysseus George Manoliadis

Abstract

Road fill construction requires soil for filling low areas; this soil is obtained from temporary mineral workings known as 'borrow pits' (BP). Between a number of possible BPs, the appropriate site should be selected based upon conflicting econo-technical and environmental criteria aiming at achieving optimal BP performance while minimizing the adverse impacts to human and natural resources. For solving this problem a model for BP selection has been developed by this research using compromise programming (CP). The model incorporates a hierarchical structure integrating criteria and sub-criteria whose relative importance is set by the decision makers. Possible alternative BP sites are subsequently assessed on all these sub-criteria. Based upon this analysis, the model determines the distance of each of the possible alternatives from the utopia (ideal) point; the option with the minimum distance is considered the best compromise. The relevant concepts are exemplified through the presentation of a case study concerning the BP site selection for an Egnatia Motorway section in northwest Greece. The main conclusion that can be drawn from this work is that the CP approach is appropriate and valid for BP selection and, furthermore, it may also be used for other multiple objective construction-related site selection problems.

Suggested Citation

  • John-Paris Pantouvakis & Odysseus George Manoliadis, 2008. "A compromise programming model for site selection of borrow pits," Construction Management and Economics, Taylor & Francis Journals, vol. 26(5), pages 433-446.
    • Handle: RePEc:taf:conmgt:v:26:y:2008:i:5:p:433-446
    DOI: 10.1080/01446190801953299
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/01446190801953299
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01446190801953299?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.

    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:taf:conmgt:v:26:y:2008:i:5:p:433-446. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RCME20 .

    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.