Skip to main content
SpringerLink
Log in

Locating key stations of a metro network using bi-objective programming: discrete and continuous demand mode

  • Original Paper
  • Published:
Public Transport Aims and scope Submit manuscript

Abstract

This study proposes two bi-objective optimization problems for locating key stations of a metro network in both discrete and continuous demand modes. Traditionally, designing a metro network based on optimization techniques consists of two approaches. The first approach locates a number of alignments and their stations simultaneously, while the second approach involves locating key stations, designing a core network, and locating secondary stations. In locating key stations processed by a single objective model, the number of produced and attracted trips to the key stations is maximized. This paper considers a second objective for this stage to maximize the coverage of key stations on origin/destination (OD) trips. A fuzzy goal programming model is established to solve the bi-objective model and provide some Pareto-optimal solutions. The previous single objective model and the proposed model with continuous demand mode are applied to a real network. Results show that the proposed model significantly increases the coverage of key stations on OD trips with only a slight reduction in the number of produced and attracted trips.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Abbreviations

\(S\) :

The set of proposed stations

\(D\) :

The set of demand points

\(C\) :

The set of demand areas

\(L\) :

The set of catchment levels

\(s,s^{\prime}\) :

The index for proposed stations

\(i,j\) :

The index for demand points/areas

\(l,l^{\prime}\) :

The index for catchment levels

\(w_{s}\) :

The coverage of station s of network demand points

\(w_{ij}^{{ss^{\prime}}}\) :

The coverage of stations s and \(s^{\prime}\) of demand flow i to j where s and \(s^{\prime}\) are situated around the demand points/areas i and j, respectively

\(w^{{ss^{\prime}}}\) :

The coverage of stations s and \(s^{\prime}\) of total demand flows

\(P\) :

The number of key stations in the network

\(\theta_{l}\) :

The cover intensity at the catchment level l

\(v_{i}\) :

The total number of trip production and attraction in the demand point i

\(v_{ij}\) :

The demand flow from point/area i to point/area j

\(\delta_{isl}\) :

A binary input parameter, which is equal to one, if station i belongs to catchment level l of station s, and zero, otherwise

\(d_{{ss^{\prime}}}\) :

The Euclidian distance between stations s and \(s^{\prime}\)

\(d_{min}\) :

The minimum permitted Euclidian distance between two key stations

\(\beta\) :

A constant value based on the gravity model

\(a_{i}\) :

The total area of demand area i

\(a_{isl}\) :

The common area of demand area i and catchment area l of station s

\(Z_{s}\) :

A binary decision variable; it is equal to one if station s is selected as key station; otherwise it is equal to zero

\(Y^{{ss^{\prime}}}\) :

A binary decision variable; it is equal to one if both stations s and \(s^{\prime}\) are selected as key stations; otherwise it is equal to zero

References

  • Alexandris G, Giannikos I (2010) A new model for maximal coverage exploiting GIS capabilities. Eur J Oper Res 202(2):328–338

    Article  Google Scholar 

  • Amid A, Ghodsypour S, O’Brien C (2011) A weighted max–min model for fuzzy multi-objective supplier selection in a supply chain. Int J Prod Econ 131(1):139–145

    Article  Google Scholar 

  • Bay P (1985) Determining cost-effectiveness of transit systems. Transportation Research Board state-of-the-art report, pp 9–12

  • Berman O, Krass D (2002) The generalized maximal covering location problem. Comput Oper Res 29(6):563–581

    Article  Google Scholar 

  • Berman O, Krass D, Drezner Z (2003) The gradual covering decay location problem on a network. Eur J Oper Res 151(3):474–480

    Article  Google Scholar 

  • Blackledge D, Humphreys E (1984) The West Midland rapid transit study. In: Proceedings of the Planning and Transport Research and Computation Ltd., Sussex, pp 71–84

  • Bruno G, Ghiani G, Improta G (1998) A multi-modal approach to the location of a rapid transit line. Eur J Oper Res 104(2):321–332

    Article  Google Scholar 

  • Bruno G, Gendreau M, Laporte G (2002) A heuristic for the location of a rapid transit line. Comput Oper Res 29(1):1–12

    Article  Google Scholar 

  • Chen L-H, Tsai F-C (2001) Fuzzy goal programming with different importance and priorities. Eur J Oper Res 133(3):548–556

    Article  Google Scholar 

  • Curtin KM, Biba S (2011) The transit route arc-node service maximization problem. Eur J Oper Res 208(1):46–56

    Article  Google Scholar 

  • Dufourd H, Gendreau M, Laporte G (1996) Locating a transit line using tabu search. Location Sci 4(1):1–19

    Article  Google Scholar 

  • Escudero L, Muñoz S (2009) An approach for solving a modification of the extended rapid transit network design problem. Top 17(2):320–334

    Article  Google Scholar 

  • Gutiérrez-Jarpa G, Obreque C, Laporte G, Marianov V (2013) Rapid transit network design for optimal cost and origin–destination demand capture. Comput Oper Res 40(12):3000–3009

    Article  Google Scholar 

  • Gutiérrez-Jarpa G, Laporte G, Marianov V (2018) Corridor-based metro network design with travel flow capture. Comput Oper Res 89:58–67

    Article  Google Scholar 

  • Hannan EL (1981a) Linear programming with multiple fuzzy goals. Fuzzy Sets Syst 6(3):235–248

    Article  Google Scholar 

  • Hannan EL (1981b) On fuzzy goal programming. Decision Sci 12(3):522–531

    Article  Google Scholar 

  • Hwang CL, Masud ASM (1979) Multiple objective decision making—methods and applications: a state-of-the-art survey, Lecture notes in economics and mathematical systems, vol 164. Springer, Berlin

    Book  Google Scholar 

  • Isfahan University of Technology (2014) Report of comprehensive transportation study in Isfahan city. Transportation Deputy of Isfahan Municipality, Isfahan

    Google Scholar 

  • Jones K, Simmons J (1993) Location, location, location: analyzing the retail environment, 2nd edn. Routledge, London

    Google Scholar 

  • Karlaftis MG (2004) A DEA approach for evaluating the efficiency and effectiveness of urban transit systems. Eur J Oper Res 152(2):354–364

    Article  Google Scholar 

  • Laporte G, Mesa JA (2015) The design of rapid transit networks. In: Laporte G, Nickel S, Saldanha da Gama F (eds) Location science. Springer, Cham, pp 581–594

    Google Scholar 

  • Laporte G, Pascoal MM (2015) Path based algorithms for metro network design. Comput Oper Res 62:78–94

    Article  Google Scholar 

  • Laporte G, Mesa JA, Ortega FA (2002) Locating stations on rapid transit lines. Comput Oper Res 29(6):741–759

    Article  Google Scholar 

  • Laporte G, Mesa JA, Ortega FA, Sevillano I (2005) Maximizing trip coverage in the location of a single rapid transit alignment. Ann Oper Res 136(1):49–63

    Article  Google Scholar 

  • Laporte G, Marín Á, Mesa JA, Ortega FA (2007) An integrated methodology for the rapid transit network design problem. In Algorithmic methods for railway optimization. Springer, Berlin, pp 187–199

    Book  Google Scholar 

  • Lee JM, Lee YH (2010) Tabu based heuristics for the generalized hierarchical covering location problem. Comput Ind Eng 58(4):638–645

    Article  Google Scholar 

  • Mesa JA, Ortega FA (2001) Park-and-ride station catchment areas in metropolitan rapid transit systems. In: Pursula M, Niittymäki J (eds) Mathematical methods on optimization in transportation systems. Applied optimization, vol 48. Springer, Boston, pp 81–93

    Chapter  Google Scholar 

  • Miettinen K (2012) Nonlinear multiobjective optimization. Springer, Berlin

    Google Scholar 

  • Murray AT, Tong D, Kim K (2010) Enhancing classic coverage location models. Int Regional Sci Rev 33(2):115–133

    Article  Google Scholar 

  • Narasimhan R (1980) Goal programming in a fuzzy environment. Decision Sci 11(2):325–336

    Article  Google Scholar 

  • Rhode M (2014) World Metro Database. http://www.mic-ro.com/metro/table.html. Accessed 30 Jul 2014

  • Sadigh AN, Mozafari M, Kashan AH (2010) A mixed integer linear program and tabu search approach for the complementary edge covering problem. Adv Eng Softw 41(5):762–768

    Article  Google Scholar 

  • Schabas M (1988) Quantitative analysis of rapid transit alignment alternatives. Transp Q 42(3):403–416

    Google Scholar 

  • Siegel S (1980) Major obstacles to effective LRT surface operations. A report on light rail transit: surface operations. Transportation Research Board, pp 20–25

  • Straus P (1980) Issues relating to effective LRT surface operations. A report on light rail transit: surface operations. Transportation Research Board, pp 7–15

  • Tiwari R, Dharmar S, Rao J (1987) Fuzzy goal programming—an additive model. Fuzzy Sets Syst 24(1):27–34

    Article  Google Scholar 

  • Wulkan A, Henry L (1985) Evaluation of light rail transit for Austin, Transportation Research Board state-of-the-art report, vol 2, Texas, pp 82–90

  • Zimmermann H-J (1978) Fuzzy programming and linear programming with several objective functions. Fuzzy Sets Syst 1(1):45–55

    Article  Google Scholar 

Download references

Acknowledgements

The authors are grateful for the helpful comments of two anonymous referees that have allowed us to improve upon the original version. The authors also acknowledge the help of Dr. Hossein Haghshenas from the Isfahan University of Technology for making the data set available for this study.

Author information

Authors and Affiliations

  1. Department of Transportation Engineering, Isfahan University of Technology, Isfahan, Iran

    Seyed Sina Mohri & Meisam Akbarzadeh

Authors
  1. Seyed Sina Mohri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meisam Akbarzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyed Sina Mohri.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mohri, S.S., Akbarzadeh, M. Locating key stations of a metro network using bi-objective programming: discrete and continuous demand mode. Public Transp 11, 321–340 (2019). https://doi.org/10.1007/s12469-019-00205-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12469-019-00205-0

Keywords

Search

Navigation