IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v30y1996i4p291-307.html
   My bibliography  Save this article

A multiobjective programming approach for selecting non-independent transportation investment alternatives

Author

Listed:
  • Teng, Junn-Yuan
  • Tzeng, Gwo-Hshiung

Abstract

This article presents a new method for SElecting Non-independent TRansportation investment Alternatives (SENTRA). This method utilizes effective distance heuristic algorithm which attempts to maximize the achieved objectives needed to satisfy available resources. Since transportation investment planning cannot avoid dealing with issues of interdependence among alternatives, this paper will consider four types of investment alternatives: independence, complementarity, substitution and common complementary substitution. Transportation investment alternative selection problem can be formulated in terms of the 0-1 multiobjective multidimensional knapsack problem. Possessing the characteristics of NP-completeness, strict computation is not necessary for the optimal solution, but simple computation for near-optimal solution is expected. The method is proposed in this paper so as to attain the near-optimal solution, which, aside from ranking the selected transportation investment alternatives, can easily perform sensitivity analysis. Finally, an example is presented to illustrate the method.

Suggested Citation

  • Teng, Junn-Yuan & Tzeng, Gwo-Hshiung, 1996. "A multiobjective programming approach for selecting non-independent transportation investment alternatives," Transportation Research Part B: Methodological, Elsevier, vol. 30(4), pages 291-307, August.
    • Handle: RePEc:eee:transb:v:30:y:1996:i:4:p:291-307
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(95)00032-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yoshiaki Toyoda, 1975. "A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems," Management Science, INFORMS, vol. 21(12), pages 1417-1427, August.
    2. Azis, Iwan J., 1990. "Analytic Hierarchy Process in the benefit-cost framework: A post-evaluation of the Trans-Sumatra highway project," European Journal of Operational Research, Elsevier, vol. 48(1), pages 38-48, September.
    3. Roy, B. & Present, M. & Silhol, D., 1986. "A programming method for determining which Paris metro stations should be renovated," European Journal of Operational Research, Elsevier, vol. 24(2), pages 318-334, February.
    4. Leinbach, Thomas R. & Cromley, Robert G., 1983. "A goal programming approach to public investment decisions: A case study of rural roads in Indonesia," Socio-Economic Planning Sciences, Elsevier, vol. 17(1), pages 1-10.
    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. C-C Chang & R-S Chen, 2007. "Project advancement and its applications to multi-air-route quality budget allocation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(8), pages 1008-1020, August.
    2. Xu, Wangtu & Lin, Weihua, 2016. "Selecting the public transit projects with PCA-DP technique: The example of Xiamen City," Transport Policy, Elsevier, vol. 46(C), pages 56-71.
    3. Qiu, Guo & Xu, Wangtu (Ato) & Li, Ling, 2018. "Key factors to annual investment in public transportation sector: The case of China," Transportation Research Part A: Policy and Practice, Elsevier, vol. 107(C), pages 1-19.
    4. Ghoseiri, Keivan & Szidarovszky, Ferenc & Asgharpour, Mohammad Jawad, 2004. "A multi-objective train scheduling model and solution," Transportation Research Part B: Methodological, Elsevier, vol. 38(10), pages 927-952, December.
    5. Liu, Fuh-Hwa Franklin & Huang, Chueng-Chiu & Yen, Yu-Lee, 2000. "Using DEA to obtain efficient solutions for multi-objective 0-1 linear programs," European Journal of Operational Research, Elsevier, vol. 126(1), pages 51-68, October.
    6. Chang, Yu-Hern & Yeh, Chung-Hsing & Shen, Ching-Cheng, 2000. "A multiobjective model for passenger train services planning: application to Taiwan's high-speed rail line," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 91-106, February.
    7. Nopadon Kronprasert & Antti Talvitie, 2015. "Use of reasoning maps in evaluation of transport alternatives: inclusion of uncertainty and “I Don’t Know”: demonstration of a method," Transportation, Springer, vol. 42(2), pages 389-406, March.
    8. Gomes da Silva, Carlos & Figueira, Jose & Climaco, Joao, 2007. "Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1656-1677, March.
    9. Klamroth, Kathrin & Wiecek, Margaret M., 2001. "A time-dependent multiple criteria single-machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 135(1), pages 17-26, November.
    10. Sushant Sharma & Tom V Mathew, 2011. "Multiobjective Network Design for Emission and Travel-Time Trade-off for a Sustainable Large Urban Transportation Network," Environment and Planning B, , vol. 38(3), pages 520-538, June.
    11. Karimi Dehnavi, Hadi & Rezvan, Mohammad Taghi & Shirmohammadli, Abdolmatin & Vallée, Dirk, 2013. "A solution for urban road selection and construction problem using simulation and goal programming—Case study of the city of Isfahan," Transport Policy, Elsevier, vol. 29(C), pages 46-53.
    12. José Figueira & Luís Paquete & Marco Simões & Daniel Vanderpooten, 2013. "Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem," Computational Optimization and Applications, Springer, vol. 56(1), pages 97-111, September.
    13. Rabello Quadros, Saul Germano & Nassi, Carlos David, 2015. "An evaluation on the criteria to prioritize transportation infrastructure investments in Brazil," Transport Policy, Elsevier, vol. 40(C), pages 8-16.

    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. Banai, Reza, 2010. "Evaluation of land use-transportation systems with the Analytic Network Process," The Journal of Transport and Land Use, Center for Transportation Studies, University of Minnesota, vol. 3(1), pages 85-112.
    2. Zanakis, Stelios H. & Mandakovic, Tomislav & Gupta, Sushil K. & Sahay, Sundeep & Hong, Sungwan, 1995. "A review of program evaluation and fund allocation methods within the service and government sectors," Socio-Economic Planning Sciences, Elsevier, vol. 29(1), pages 59-79, March.
    3. Ezbakhe, Fatine & Pérez-Foguet, Agustí, 2021. "Decision analysis for sustainable development: The case of renewable energy planning under uncertainty," European Journal of Operational Research, Elsevier, vol. 291(2), pages 601-613.
    4. Kadziński, Miłosz & Wójcik, Michał & Ciomek, Krzysztof, 2022. "Review and experimental comparison of ranking and choice procedures for constructing a univocal recommendation in a preference disaggregation setting," Omega, Elsevier, vol. 113(C).
    5. N. Cherfi & M. Hifi, 2010. "A column generation method for the multiple-choice multi-dimensional knapsack problem," Computational Optimization and Applications, Springer, vol. 46(1), pages 51-73, May.
    6. Hokkanen, Joonas & Salminen, Pekka, 1997. "Choosing a solid waste management system using multicriteria decision analysis," European Journal of Operational Research, Elsevier, vol. 98(1), pages 19-36, April.
    7. Jorge A. Sefair & Oscar Guaje & Andrés L. Medaglia, 2021. "A column-oriented optimization approach for the generation of correlated random vectors," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(3), pages 777-808, September.
    8. Roy, B. & Figueira, J.R. & Almeida-Dias, J., 2014. "Discriminating thresholds as a tool to cope with imperfect knowledge in multiple criteria decision aiding: Theoretical results and practical issues," Omega, Elsevier, vol. 43(C), pages 9-20.
    9. Jaeyoung Yang & Yong-Hyuk Kim & Yourim Yoon, 2022. "A Memetic Algorithm with a Novel Repair Heuristic for the Multiple-Choice Multidimensional Knapsack Problem," Mathematics, MDPI, vol. 10(4), pages 1-15, February.
    10. Thomas R. Leinbach & Robert G. Cromley, 1989. "Modeling Integrated Development Investments in Rural Areas: An Indonesian Illustration," International Regional Science Review, , vol. 12(2), pages 229-243, August.
    11. Gabriel, Steven A. & Kumar, Satheesh & Ordonez, Javier & Nasserian, Amirali, 2006. "A multiobjective optimization model for project selection with probabilistic considerations," Socio-Economic Planning Sciences, Elsevier, vol. 40(4), pages 297-313, December.
    12. G. Edward Fox & Christopher J. Nachtsheim, 1990. "An analysis of six greedy selection rules on a class of zero‐one integer programming models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 299-307, April.
    13. Yalçın Akçay & Haijun Li & Susan Xu, 2007. "Greedy algorithm for the general multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 150(1), pages 17-29, March.
    14. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    15. Contreras, Francisco & Hanaki, Keisuke & Aramaki, Toshiya & Connors, Stephen, 2008. "Application of analytical hierarchy process to analyze stakeholders preferences for municipal solid waste management plans, Boston, USA," Resources, Conservation & Recycling, Elsevier, vol. 52(7), pages 979-991.
    16. Yanhong Feng & Hongmei Wang & Zhaoquan Cai & Mingliang Li & Xi Li, 2023. "Hybrid Learning Moth Search Algorithm for Solving Multidimensional Knapsack Problems," Mathematics, MDPI, vol. 11(8), pages 1-28, April.
    17. Ang, James S.K. & Cao, Chengxuan & Ye, Heng-Qing, 2007. "Model and algorithms for multi-period sea cargo mix problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1381-1393, August.
    18. Sabah Bushaj & İ. Esra Büyüktahtakın, 2024. "A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack," Journal of Global Optimization, Springer, vol. 89(3), pages 655-685, July.
    19. M Hifi & M Michrafy & A Sbihi, 2004. "Heuristic algorithms for the multiple-choice multidimensional knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1323-1332, December.
    20. Hasan Pirkul, 1987. "A heuristic solution procedure for the multiconstraint zero‐one knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 161-172, April.

    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:eee:transb:v:30:y:1996:i:4:p:291-307. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.