Advertisement

Novel Effective Algorithm for Synchronization Problem in Directed Graph

  • Richard Cimler
  • Dalibor Cimr
  • Jitka Kuhnova
  • Hana Tomaskova
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10448)

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.

Keywords

Synchronization Oriented graph Optimization Brute-force 

Notes

Acknowledgment

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

References

  1. 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. 2.
    Binder, S., Maknoon, Y., Bierlaire, M.: The multi-objective railway timetable rescheduling problem. Transp. Res. Part C: Emerg. Technol. 78, 78–94 (2017)CrossRefGoogle Scholar
  3. 3.
    Cacchiani, V., Toth, P.: Nominal and robust train timetabling problems. Eur. J. Oper. Res. 219(3), 727–737 (2012)MathSciNetCrossRefGoogle Scholar
  4. 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. 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. 6.
    Siebert, M., Goerigk, M.: An experimental comparison of periodic timetabling models. Comput. Oper. Res. 40(10), 2251–2259 (2013)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Sloane, N.J.A.: https://oeis.org/A000292

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Richard Cimler
    • 1
  • Dalibor Cimr
    • 1
  • Jitka Kuhnova
    • 2
  • Hana Tomaskova
    • 1
  1. 1.Faculty of Informatics and ManagementUniversity of Hradec KraloveHradec KraloveCzech Republic
  2. 2.Faculty of ScienceUniversity of Hradec KraloveHradec KraloveCzech Republic

Personalised recommendations