Novel Effective Algorithm for Synchronization Problem in Directed Graph
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.
KeywordsSynchronization Oriented graph Optimization Brute-force
The support of the Specific Research Project at FIM UHK is gratefully acknowledged.
- 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
- 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
- 7.Sloane, N.J.A.: https://oeis.org/A000292