Skip to main content
SpringerLink
Log in

Novel Effective Algorithm for Synchronization Problem in Directed Graph

  • Conference paper
  • First Online:
Computational Collective Intelligence (ICCCI 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10448))

Included in the following conference series:

  • 1770 Accesses

Abstract

An effective algorithm for solving synchronization problem in directed graph is presented. The system is composed of vertices and edges. Entities are going through the system by given paths and can leave the vertex if all other entities which are going through this vertex have already arrived. The aim of this research is to create an algorithm for finding an optimal input vector of starting times of entities which gives minimal waiting time of entities in vertices and thus in a whole system. Asymptotic complexity of a given solution and using of brute-force method is discussed and compared. This algorithm is shown on an example from a field of train timetable problem.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Arenas, D., Chevrier, R., Hanafi, S., Rodriguez, J.: Solving the train timetabling problem, a mathematical model and a genetic algorithm solution approach. In: 6th International Conference on Railway Operations Modelling and Analysis (2015)

    Google Scholar 

  2. Binder, S., Maknoon, Y., Bierlaire, M.: The multi-objective railway timetable rescheduling problem. Transp. Res. Part C: Emerg. Technol. 78, 78–94 (2017)

    Article  Google Scholar 

  3. Cacchiani, V., Toth, P.: Nominal and robust train timetabling problems. Eur. J. Oper. Res. 219(3), 727–737 (2012)

    Article  MathSciNet  Google Scholar 

  4. Gavalec, M., Ponce, D., Karel, Z.: The two-sided (max/min, plus) problem is NP-complete. Submitted to: Fuzzy sets and systems (2016)

    Google Scholar 

  5. Kelley, Jr., J.E., Walker, M.R.: Critical-path planning and scheduling. In: Papers presented at the December 1–3, 1959, eastern joint IRE-AIEE-ACM Computer Conference, pp. 160–173. ACM (1959)

    Google Scholar 

  6. Siebert, M., Goerigk, M.: An experimental comparison of periodic timetabling models. Comput. Oper. Res. 40(10), 2251–2259 (2013)

    Article  MathSciNet  Google Scholar 

  7. Sloane, N.J.A.: https://oeis.org/A000292

Download references

Acknowledgment

The support of the Specific Research Project at FIM UHK is gratefully acknowledged.

Author information

Authors and Affiliations

  1. Faculty of Informatics and Management, University of Hradec Kralove, Hradec Kralove, Czech Republic

    Richard Cimler, Dalibor Cimr & Hana Tomaskova

  2. Faculty of Science, University of Hradec Kralove, Hradec Kralove, Czech Republic

    Jitka Kuhnova

Authors
  1. Richard Cimler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dalibor Cimr
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jitka Kuhnova
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hana Tomaskova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Richard Cimler .

Editor information

Editors and Affiliations

  1. Department of Information Systems, Faculty of Computer Science and Management , Wrocław University of Science and Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

  2. Department of Computer Science, University of Cyprus, Nicosia, Cyprus

    George A. Papadopoulos

  3. Department of Information Systems, Gdynia Maritime University, Gdynia, Poland

    Piotr Jędrzejowicz

  4. Department of Information Systems, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Bogdan Trawiński

  5. Department of Information Systems, University of Münster, Münster, Germany

    Gottfried Vossen

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Cimler, R., Cimr, D., Kuhnova, J., Tomaskova, H. (2017). Novel Effective Algorithm for Synchronization Problem in Directed Graph. In: Nguyen, N., Papadopoulos, G., Jędrzejowicz, P., Trawiński, B., Vossen, G. (eds) Computational Collective Intelligence. ICCCI 2017. Lecture Notes in Computer Science(), vol 10448. Springer, Cham. https://doi.org/10.1007/978-3-319-67074-4_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67074-4_51

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67073-7

  • Online ISBN: 978-3-319-67074-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation