IDEAS home Printed from https://ideas.repec.org/a/igg/joris0/v12y2021i4p1-13.html
   My bibliography  Save this article

Bus Transit Network Structure Selection With Multiple Objectives

Author

Listed:
  • K. Ramacandra Rao

    (Indian Institute of Technology, Delhi, India)

  • Subhro Mitra

    (University of North Texas at Dallas, USA)

  • Joseph Szmerekovsky

    (North Dakota State University, USA)

Abstract

Bus transportation is the essential mode of public transportation available for intra-district movements in India. The planning of different stages of bus transportation planning is usually done in an ad-hoc manner on the basis of the experience of the operators. For a rational design of the bus transit system, it is essential to take into account the objectives of different interest groups. Selection of an appropriate network structure is an essential part of the planning process. In this paper, a model developed for generating a number of alternative network structures using link deletion concept is presented. One of these alternatives can be selected on the basis of the trade-off between the user and operator objectives. The model has been applied to a case study of bus transit network of Visakhapatnam region in Andhra Pradesh.

Suggested Citation

  • K. Ramacandra Rao & Subhro Mitra & Joseph Szmerekovsky, 2021. "Bus Transit Network Structure Selection With Multiple Objectives," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 12(4), pages 1-13, October.
  • Handle: RePEc:igg:joris0:v:12:y:2021:i:4:p:1-13
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJORIS.20211001.oa5
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Current, John & Marsh, Michael, 1993. "Multiobjective transportation network design and routing problems: Taxonomy and annotation," European Journal of Operational Research, Elsevier, vol. 65(1), pages 4-19, February.
    2. John W. Billheimer & Paul Gray, 1973. "Network Design with Fixed and Variable Cost Elements," Transportation Science, INFORMS, vol. 7(1), pages 49-74, February.
    3. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    4. Current, John & Min, HoKey, 1986. "Multiobjective design of transportation networks: Taxonomy and annotation," European Journal of Operational Research, Elsevier, vol. 26(2), pages 187-201, 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. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
    2. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    3. Giulio Cantarella & Antonino Vitetta, 2006. "The multi-criteria road network design problem in an urban area," Transportation, Springer, vol. 33(6), pages 567-588, November.
    4. Granat, Janusz & Guerriero, Francesca, 2003. "The interactive analysis of the multicriteria shortest path problem by the reference point method," European Journal of Operational Research, Elsevier, vol. 151(1), pages 103-118, November.
    5. Volha Yakavenka & Ioannis Mallidis & Dimitrios Vlachos & Eleftherios Iakovou & Zafeiriou Eleni, 2020. "Development of a multi-objective model for the design of sustainable supply chains: the case of perishable food products," Annals of Operations Research, Springer, vol. 294(1), pages 593-621, November.
    6. Mingue SUn, 2010. "A Branch-and-Bound Algorithm for Representative Integer Efficient Solutions in Multiple Objective Network Programming Problems," Working Papers 0007, College of Business, University of Texas at San Antonio.
    7. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
    8. Jenn-Rong Lin & Linda Nozick & Mark Turnquist, 2006. "Strategic design of distribution systems with economies of scale in transportation," Annals of Operations Research, Springer, vol. 144(1), pages 161-180, April.
    9. F. Guerriero & R. Musmanno, 2001. "Label Correcting Methods to Solve Multicriteria Shortest Path Problems," Journal of Optimization Theory and Applications, Springer, vol. 111(3), pages 589-613, December.
    10. Gallo, Mariano & D'Acierno, Luca & Montella, Bruno, 2010. "A meta-heuristic approach for solving the Urban Network Design Problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 144-157, February.
    11. Moradi, Siamak & Raith, Andrea & Ehrgott, Matthias, 2015. "A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 369-378.
    12. Soroush, H.M., 2008. "Optimal paths in bi-attribute networks with fractional cost functions," European Journal of Operational Research, Elsevier, vol. 190(3), pages 633-658, November.
    13. Coutinho-Rodrigues, João & Tralhão, Lino & Alçada-Almeida, Luís, 2012. "Solving a location-routing problem with a multiobjective approach: the design of urban evacuation plans," Journal of Transport Geography, Elsevier, vol. 22(C), pages 206-218.
    14. Mina, Hokey & Jayaraman, Vaidyanathan & Srivastava, Rajesh, 1998. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, Elsevier, vol. 108(1), pages 1-15, July.
    15. Hamacher, Horst W. & Pedersen, Christian Roed & Ruzika, Stefan, 2007. "Multiple objective minimum cost flow problems: A review," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1404-1422, February.
    16. de Lima Pinto, Leizer & Bornstein, Cláudio Thomás & Maculan, Nelson, 2009. "The tricriterion shortest path problem with at least two bottleneck objective functions," European Journal of Operational Research, Elsevier, vol. 198(2), pages 387-391, October.
    17. Dung-Ying Lin & Chi Xie, 2011. "The Pareto-optimal Solution Set of the Equilibrium Network Design Problem with Multiple Commensurate Objectives," Networks and Spatial Economics, Springer, vol. 11(4), pages 727-751, December.
    18. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    19. Minghe Sun, 2003. "Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems," Transportation Science, INFORMS, vol. 37(2), pages 139-152, May.
    20. M-G Yoon & J Current, 2008. "The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 80-89, January.

    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:igg:joris0:v:12:y:2021:i:4:p:1-13. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.