IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v208y2011i1p46-56.html
   My bibliography  Save this article

The Transit Route Arc-Node Service Maximization problem

Author

Listed:
  • Curtin, Kevin M.
  • Biba, Steve

Abstract

This article presents a new method for determining optimal transit routes. The Transit Route Arc-Node Service Maximization model is a mathematical model that maximizes the service value of a route, rather than minimizing cost. Cost (distance) is considered as a budget constraint on the extent of the route. The mathematical formulation modifies and exploits the structure of linear programming problems designed for the traveling salesman problem. An innovative divide-and-conquer solution procedure is presented that not only makes the transit routing problem tractable, but also provides a range of high-quality alternate routes for consideration, some of which have substantially varying geometries. Variant formulations are provided for several common transit route types. The model is tested through its application to an existing street network in Richardson, TX. Optimal numeric results are obtained for several problem instances, and these results demonstrate that increased route cost is not correlated with increased service provision.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:208:y:2011:i:1:p:46-56
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00536-9
    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. Zhao, Fang & Zeng, Xiaogang, 2008. "Optimization of transit route network, vehicle headways and timetables for large-scale transit networks," European Journal of Operational Research, Elsevier, vol. 186(2), pages 841-855, April.
    2. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    3. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    4. Lownes, Nicholas E. & Machemehl, Randy B., 2010. "Exact and heuristic methods for public transit circulator design," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 309-318, February.
    5. Kulkarni, R. V. & Bhave, P. R., 1985. "Integer programming formulations of vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 20(1), pages 58-67, April.
    6. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Christos T., 2009. "A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 195(3), pages 729-743, June.
    7. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    8. Matisziw, Timothy C. & Murray, Alan T. & Kim, Changjoo, 2006. "Strategic route extension in transit networks," European Journal of Operational Research, Elsevier, vol. 171(2), pages 661-673, June.
    9. Current, J. R. & Re Velle, C. S. & Cohon, J. L., 1985. "The maximum covering/shortest path problem: A multiobjective network design and routing formulation," European Journal of Operational Research, Elsevier, vol. 21(2), pages 189-199, August.
    10. Current, John R. & Schilling, David A., 1994. "The median tour and maximal covering tour problems: Formulations and heuristics," European Journal of Operational Research, Elsevier, vol. 73(1), pages 114-126, February.
    11. Modarres, Ali, 2003. "Polycentricity and transit service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(10), pages 841-864, December.
    12. John R. Current & Charles S. Revelle & Jared L. Cohon, 1987. "The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks," Transportation Science, INFORMS, vol. 21(3), pages 188-197, August.
    13. Ying Zhou & Hong Kim & Paul Schonfeld & Eungcheol Kim, 2008. "Subsidies and welfare maximization tradeoffs in bus transit systems," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 42(3), pages 643-660, September.
    14. 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.
    15. Merrill M. Flood, 1956. "The Traveling-Salesman Problem," Operations Research, INFORMS, vol. 4(1), pages 61-75, February.
    16. George B. Dantzig, 1957. "Discrete-Variable Extremum Problems," Operations Research, INFORMS, vol. 5(2), pages 266-288, April.
    17. Murray, Alan T., 2001. "Strategic analysis of public transport coverage," Socio-Economic Planning Sciences, Elsevier, vol. 35(3), pages 175-188, September.
    18. Quadrifoglio, Luca & Li, Xiugang, 2009. "A methodology to derive the critical demand density for designing and operating feeder transit services," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 922-935, December.
    19. 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.
    20. Ceder, Avishai & Wilson, Nigel H. M., 1986. "Bus network design," Transportation Research Part B: Methodological, Elsevier, vol. 20(4), pages 331-344, August.
    21. Alan Murray, 2003. "A Coverage Model for Improving Public Transit System Accessibility and Expanding Access," Annals of Operations Research, Springer, vol. 123(1), pages 143-156, October.
    22. Shrivastava, Prabhat & O'Mahony, Margaret, 2006. "A model for development of optimized feeder routes and coordinated schedules--A genetic algorithms approach," Transport Policy, Elsevier, vol. 13(5), pages 413-425, September.
    23. G. F. Newell, 1979. "Some Issues Relating to the Optimal Design of Bus Routes," Transportation Science, INFORMS, vol. 13(1), pages 20-35, February.
    24. Steven I. Chien * & Zhaoqiong Qin, 2004. "Optimization of bus stop locations for improving transit accessibility," Transportation Planning and Technology, Taylor & Francis Journals, vol. 27(3), pages 211-227, June.
    25. 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.
    26. John R. Current & David A. Schilling, 1989. "The Covering Salesman Problem," Transportation Science, INFORMS, vol. 23(3), pages 208-213, August.
    27. Bowerman, Robert & Hall, Brent & Calamai, Paul, 1995. "A multi-objective optimization approach to urban school bus routing: Formulation and solution method," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 107-123, March.
    28. Rui Jiang & Mao-Bin Hu & Bin Jia & Qing-Song Wu, 2003. "Realistic bus route model considering the capacity of the bus," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 34(3), pages 367-372, August.
    29. John Current & Hasan Pirkul & Erik Rolland, 1994. "Efficient Algorithms for Solving the Shortest Covering Path Problem," Transportation Science, INFORMS, vol. 28(4), pages 317-327, November.
    30. Rodrigo Fernandez & Nick Tyler, 2005. "Effect of Passenger--Bus--Traffic Interactions on Bus Stop Operations," Transportation Planning and Technology, Taylor & Francis Journals, vol. 28(4), pages 273-292, July.
    31. List, George F., 1990. "Toward optimal sketch-level transit service plans," Transportation Research Part B: Methodological, Elsevier, vol. 24(5), pages 325-344, October.
    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. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
    2. Seyed Sina Mohri & Meisam Akbarzadeh, 2019. "Locating key stations of a metro network using bi-objective programming: discrete and continuous demand mode," Public Transport, Springer, vol. 11(2), pages 321-340, August.
    3. Wang, David Z.W. & Nayan, Ashish & Szeto, W.Y., 2018. "Optimal bus service design with limited stop services in a travel corridor," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 70-86.
    4. Madanat, Samer & Horvath , Arpad & Mao, Chao & Cheng, Han, 2016. "Potential Greenhouse Gas Emission Reductions from Optimizing Urban Transit Networks," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt25x1b693, Institute of Transportation Studies, UC Berkeley.
    5. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    6. Yu, Yao & Machemehl, Randy B. & Xie, Chi, 2015. "Demand-responsive transit circulator service network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 76(C), pages 160-175.
    7. Mahmoud Owais & Abdou S. Ahmed & Ghada S. Moussa & Ahmed A. Khalil, 2020. "An Optimal Metro Design for Transit Networks in Existing Square Cities Based on Non-Demand Criterion," Sustainability, MDPI, vol. 12(22), pages 1-28, November.
    8. Philine Gattermann & Jonas Harbering & Anita Schöbel, 2017. "Line pool generation," Public Transport, Springer, vol. 9(1), pages 7-32, July.
    9. Linzhong Liu & Haibo Mu & Juhua Yang, 2017. "Toward algorithms for multi-modal shortest path problem and their extension in urban transit network," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 767-781, March.
    10. Pternea, Moschoula & Kepaptsoglou, Konstantinos & Karlaftis, Matthew G., 2015. "Sustainable urban transit network design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 77(C), pages 276-291.

    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. 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.
    2. Matisziw, Timothy C. & Murray, Alan T. & Kim, Changjoo, 2006. "Strategic route extension in transit networks," European Journal of Operational Research, Elsevier, vol. 171(2), pages 661-673, June.
    3. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
    4. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    5. Fischer, Vera & Pacheco Paneque, Meritxell & Legrain, Antoine & Bürgy, Reinhard, 2024. "A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection," European Journal of Operational Research, Elsevier, vol. 315(1), pages 338-353.
    6. Orlando Barraza & Miquel Estrada, 2021. "Battery Electric Bus Network: Efficient Design and Cost Comparison of Different Powertrains," Sustainability, MDPI, vol. 13(9), pages 1-28, April.
    7. Luo, Sida & Nie, Yu (Marco), 2019. "Impact of ride-pooling on the nature of transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 175-192.
    8. Arbex, Renato Oliveira & da Cunha, Claudio Barbieri, 2015. "Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 355-376.
    9. Russell Halper & S. Raghavan, 2011. "The Mobile Facility Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 413-434, August.
    10. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    11. Cancela, Héctor & Mauttone, Antonio & Urquhart, María E., 2015. "Mathematical programming formulations for transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 17-37.
    12. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    13. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    14. Ibarra-Rojas, O.J. & Delgado, F. & Giesen, R. & Muñoz, J.C., 2015. "Planning, operation, and control of bus transport systems: A literature review," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 38-75.
    15. Liu, Yining & Ouyang, Yanfeng, 2021. "Mobility service design via joint optimization of transit networks and demand-responsive services," Transportation Research Part B: Methodological, Elsevier, vol. 151(C), pages 22-41.
    16. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    17. 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.
    18. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    19. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    20. Luo, Sida & Nie, Yu (Marco), 2020. "Paired-line hybrid transit design considering spatial heterogeneity," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 320-339.

    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:ejores:v:208:y:2011:i:1:p:46-56. 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/locate/eor .

    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.