Skip to main content
SpringerLink
Log in

Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem

  • Conference paper
  • First Online:
Variable Neighborhood Search (ICVNS 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12559))

Included in the following conference series:

  • 335 Accesses

Abstract

This paper considers a fast solving the practical problem in railway planning and scheduling. i.e., the problem of assigning given arrival and departure railway paths to routs. This problem is to execute as fully as possible the train traffic across the railway station, using a fixed amount of the resources. It appears that the problem may be solved by using any efficient maximum Independent set algorithm, which is known to be \(\mathcal {NP}\)–hard. On the other hand, Simplicial vertex test is known heuristic that gives good quality solutions on sparse graphs. So, for solving the maximum independent set on sparse graphs, we propose an efficient heuristic based on the extended simplicial vertex test.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Lazarev, A., Pravdivets, N., Nekrasov, I.: Evaluating typical algorithms of combinatorial optimization to solve continuous-time based scheduling problem. Algorithms 11(4), 1–13 (2018)

    Article  MathSciNet  Google Scholar 

  2. Matyukhin, V., Shabunin, A., Kuznetsov, N., Takmazian, A.: Rail transport control by combinatorial optimization approach. In: 11th IEEE International Conference on Application of Information and Communication Technologies, pp. 419–422. IEEE Communications Society (2017)

    Google Scholar 

  3. Piu, F., Speranza, M.: The locomotive assignment problem: a survey on optimization models. Int. Trans. Oper. Res. 21, 327–352 (2014)

    Article  MathSciNet  Google Scholar 

  4. Ivanov, S.V., Kibzun, A.I., Osokin, A.V.: Stochastic optimization model of locomotive assignment to freight trains. Autom. Remote Control 77(11), 1944–1956 (2016). https://doi.org/10.1134/S0005117916110059

    Article  MathSciNet  MATH  Google Scholar 

  5. Lazarev, A.A., Musatova, E.G.: The problem of trains formation and scheduling: integer statements. Autom. Remote Control 74(12), 2064–2068 (2013)

    Article  MathSciNet  Google Scholar 

  6. Azanov, V.M., Buyanov, M.V., Gaynanov, D.N., Ivanov, S.V.: Algorithm and software development to allocate locomotives for transportation of freight trains. Bull. South Ural State Univ. Ser. Math. Model. Program. Comput. Softw. 9(4), 73–85 (2016)

    MATH  Google Scholar 

  7. Tomita, E., Imamatsu, K., Kohata, Y., Wakatsuki, M.: A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations. Syst. Comput. Japan 28, 60–67 (1997)

    Article  Google Scholar 

  8. Abello, J., Pardalos, P.M., Resende, M.: On maximum clique problems in very large graphs. In: External Memory Algorithms, pp. 119–130 (1999)

    Google Scholar 

  9. Gainanov, D., Mladenović, N., Rasskazova, V., Urošević, D.: Heuristic algorithm for finding the maximum independent set with absolute estimate of the accuracy. In: CEUR-Workshop Proceedings, vol. 2098, pp. 141–149 (2018)

    Google Scholar 

  10. Hansen, P., Mladenović, N., Urošević, D.: Variable neighborhood search for the maximum clique. Discret. Appl. Math. 145(1), 117–125 (2004)

    Article  MathSciNet  Google Scholar 

  11. Gainanov, D., Rasskazova, V.: An inference algorithm for monotone Boolean functions associated with undirected graphs. Bull. South Ural State Univ. Ser. Math. Model. Program. Comput. Softw. 9(3), 17–30 (2016)

    MATH  Google Scholar 

  12. Hertz, A., Friden, C., De Werra, D.: Tabaris: an exact algorithm based on tabu search for finding a maximum independent set in a graph. Comput. Oper. Res. 17, 437–445 (1990)

    Article  Google Scholar 

  13. Gainanov, D., Mladenović, N., Rasskazova, V.: Maximum independent set in planning freight railway transportation. Front. Eng. Manag. 5(4), 499–506 (2018)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ural Federal University, Yekaterinburg, Russia

    Damir Gainanov

  2. Khalifa University, Abu Dhabi, United Arab Emirates

    Nenad Mladenović

  3. Moscow Aviation Institute, Moscow, Russia

    Varvara Rasskazova

Authors
  1. Damir Gainanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nenad Mladenović
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Varvara Rasskazova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Varvara Rasskazova .

Editor information

Editors and Affiliations

  1. Khalifa University, Abu Dhabi, United Arab Emirates

    Nenad Mladenovic

  2. Khalifa University, Abu Dhabi, United Arab Emirates

    Andrei Sleptchenko

  3. University of Macedonia, Thessaloniki, Greece

    Angelo Sifaleras

  4. Khalifa University, Abu Dhabi, United Arab Emirates

    Mohammed Omar

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gainanov, D., Mladenović, N., Rasskazova, V. (2021). Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem. In: Mladenovic, N., Sleptchenko, A., Sifaleras, A., Omar, M. (eds) Variable Neighborhood Search. ICVNS 2021. Lecture Notes in Computer Science(), vol 12559. Springer, Cham. https://doi.org/10.1007/978-3-030-69625-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-69625-2_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-69624-5

  • Online ISBN: 978-3-030-69625-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation