Sohibjamol I. Valiyev
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sohibjamol I. Valiyev has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Sunnatillo Boltayev
Tashkent State Transport University, Tashkent, Uzbekistan
4 shared publications - Obidjon Muhiddinov
Department of Automation and Remote Control, Tashkent State Transport University, Tashkent 100167, Uzbekistan
3 shared publications - Bobomurod B. Rakhmonov
Department of Automation and Remote Control, Tashkent State Transport University, Tashkent 100167, Uzbekistan
2 shared publications - Egamberdi Joniqulov
Department of Automation and Remote Control, Tashkent State Transport University, Tashkent 100167, Uzbekistan
2 shared publications - Eldor Khujamkulov
Tashkent State Transport University
2 shared publications - Muxammadaziz Y. Xokimjonov
Department of Automation and Remote Control, Tashkent State Transport University, Tashkent 100167, Uzbekistan
2 shared publications
Latest Publications
- Open Access
- 24 March 2026
- Published by MDPI AG in Automation
- Vol. 7 (2) , 54
An Integrated Mathematical Model for Ensuring Train Traffic Safety in a Centralised Dispatching System Based on Control Theory, Based on Finite-State Automata
This paper presents an integrated mathematical model to improve the safety and operational efficiency of train traffic in centralised railway dispatching systems. The proposed approach combines the alternative graph model with a Mealy automaton to synchronously address route planning, delay minimisation, and strict compliance with safety requirements. Formal control theory based on finite-state automata is employed to describe routing logic and signal control through state transitions, while the alternative graph model represents scheduling constraints and resource conflicts. To enhance real-time adaptability, a tabu search algorithm is implemented for train schedule optimisation, enabling dynamic rescheduling under changing operational conditions. The mathematical formulation incorporates blocking time parameters, a system of discrete constraints, and automaton-based safety conditions governing train movements and route authorisation. The integrated model explicitly formalises the processes of block section occupation and release, ensuring consistency between control logic and scheduling decisions. Practical testing and computational experiments demonstrate that the proposed approach effectively reduces train delays, improves the reliability of dispatch control, and increases system resilience to dynamic disturbances. The results confirm that the developed model can be implemented within existing centralised dispatching infrastructures without requiring a complete system overhaul. Overall, the proposed framework expands the functional capabilities of centralised dispatch systems by enabling efficient schedule generation, minimising the propagation of delays, and ensuring reliable command exchange between central control posts and field-level railway infrastructure.
- 24 March 2026
- Published by MDPI AG in Automation
- Vol. 7 (2) , 54
Open AccessAn Integrated Mathematical Model for Ensuring Train Traffic Safety in a Centralised Dispatching System Based on Control Theory, Based on Finite-State Automata
This paper presents an integrated mathematical model to improve the safety and operational efficiency of train traffic in centralised railway dispatching systems. The proposed approach combines the alternative graph model with a Mealy automaton to synchronously address route planning, delay minimisation, and strict compliance with safety requirements. Formal control theory based on finite-state automata is employed to describe routing logic and signal control through state transitions, while the alternative graph model represents scheduling constraints and resource conflicts. To enhance real-time adaptability, a tabu search algorithm is implemented for train schedule optimisation, enabling dynamic rescheduling under changing operational conditions. The mathematical formulation incorporates blocking time parameters, a system of discrete constraints, and automaton-based safety conditions governing train movements and route authorisation. The integrated model explicitly formalises the processes of block section occupation and release, ensuring consistency between control logic and scheduling decisions. Practical testing and computational experiments demonstrate that the proposed approach effectively reduces train delays, improves the reliability of dispatch control, and increases system resilience to dynamic disturbances. The results confirm that the developed model can be implemented within existing centralised dispatching infrastructures without requiring a complete system overhaul. Overall, the proposed framework expands the functional capabilities of centralised dispatch systems by enabling efficient schedule generation, minimising the propagation of delays, and ensuring reliable command exchange between central control posts and field-level railway infrastructure.
- Open Access
- 30 January 2026
- Published by MDPI AG in Preprints.org
An Integrated Mathematical Model for Ensuring Train Traffic Safety in a Centralized Dispatching System Based on Automata Theory
This paper presents an integrated mathematical model aimed at improving the safety and operational efficiency of train traffic in centralized railway dispatching systems. The proposed approach combines the alternative graph model with a Mealy automaton to synchronously address route planning, delay minimization, and strict compliance with safety requirements. Formal automata theory is employed to describe routing logic and signal control through state transitions, while the alternative graph model represents scheduling constraints and resource conflicts. To enhance real-time adaptability, a tabu search algorithm is implemented for train schedule optimization, enabling dynamic rescheduling under changing operational conditions. The mathematical formulation incorporates blocking time parameters, a system of discrete constraints, and automaton-based safety conditions governing train movements and route authorization. The integrated model explicitly formalizes the processes of block section occupation and release, ensuring consistency between control logic and scheduling decisions. Practical testing and computational experiments demonstrate that the proposed approach effectively reduces train delays, improves the reliability of dispatch control, and increases system resilience to dynamic disturbances. The results confirm that the developed model can be implemented within existing centralized dispatching infrastructures without requiring a complete system overhaul. Overall, the proposed framework expands the functional capabilities of centralized dispatch systems by enabling efficient schedule generation, minimizing the propagation of delays, and ensuring reliable command exchange between central control posts and field-level railway infrastructure.
- 30 January 2026
- Published by MDPI AG in Preprints.org
Open AccessAn Integrated Mathematical Model for Ensuring Train Traffic Safety in a Centralized Dispatching System Based on Automata Theory
This paper presents an integrated mathematical model aimed at improving the safety and operational efficiency of train traffic in centralized railway dispatching systems. The proposed approach combines the alternative graph model with a Mealy automaton to synchronously address route planning, delay minimization, and strict compliance with safety requirements. Formal automata theory is employed to describe routing logic and signal control through state transitions, while the alternative graph model represents scheduling constraints and resource conflicts. To enhance real-time adaptability, a tabu search algorithm is implemented for train schedule optimization, enabling dynamic rescheduling under changing operational conditions. The mathematical formulation incorporates blocking time parameters, a system of discrete constraints, and automaton-based safety conditions governing train movements and route authorization. The integrated model explicitly formalizes the processes of block section occupation and release, ensuring consistency between control logic and scheduling decisions. Practical testing and computational experiments demonstrate that the proposed approach effectively reduces train delays, improves the reliability of dispatch control, and increases system resilience to dynamic disturbances. The results confirm that the developed model can be implemented within existing centralized dispatching infrastructures without requiring a complete system overhaul. Overall, the proposed framework expands the functional capabilities of centralized dispatch systems by enabling efficient schedule generation, minimizing the propagation of delays, and ensuring reliable command exchange between central control posts and field-level railway infrastructure.
- 30 June 2025
- Published by Tashkent State Transport University in Вестник транспорта - Transport xabarnomasi
- Vol. 2 (2) , 117-121
Poyezd dispetcheri uchastkasida marshrutlarni avtomatik boshqarishni modellashtirish
Bu ilmiy maqolada poyezd dispetcheri uchastkasida marshrutlarni avtomatik tayyorlash uslubiyatlari ko‘rib chiqilgan. Hozirgi kunda poyezdlar harakatlanayotgan uchastkalardagi, ushbu muammoni hal qilishda poyezd dispetcheri yuqori malakasi hamda, o‘zining tajribasidan foydalangan holda, poyezdlar harakati jadvalini, ya’ni kesishtirish va quvib o‘tish stansiyalarini aniqlashni hisoblash usuli orqali, stansiyalarda poyezdlar uchun marshrutlar tayyorlanmoqda. Ushbu jarayon Petri tarmog‘i yordamida modellashtirilgan. Marshrutlarni tuzish jarayoni poyezdlarni harakatlanayotgan stansiyalarida turib qolish shartlarini tekshirgan holda modellashtirilgan. Marshrut tayyorlashda signallashtirish, markazlashtirish va blokirovkalash qurilmalarining holati, poyezdlar marshrutlarini tayyorlash vaqtlarini inobatga olingan. Qilingan hisob kitob natijalaridan poyezdni stansiyadan jo‘natishga ruxsat beradi yoki taqiqlaydi. Stansiyadan poyezdni jo‘natish uchun, qabul qiluvchi stansiyaga poyezd kelishida hech qanaqa to‘siq bo‘lishi kerak emas.
- 30 June 2025
- Published by Tashkent State Transport University in Вестник транспорта - Transport xabarnomasi
- Vol. 2 (2) , 117-121
Poyezd dispetcheri uchastkasida marshrutlarni avtomatik boshqarishni modellashtirish
Bu ilmiy maqolada poyezd dispetcheri uchastkasida marshrutlarni avtomatik tayyorlash uslubiyatlari ko‘rib chiqilgan. Hozirgi kunda poyezdlar harakatlanayotgan uchastkalardagi, ushbu muammoni hal qilishda poyezd dispetcheri yuqori malakasi hamda, o‘zining tajribasidan foydalangan holda, poyezdlar harakati jadvalini, ya’ni kesishtirish va quvib o‘tish stansiyalarini aniqlashni hisoblash usuli orqali, stansiyalarda poyezdlar uchun marshrutlar tayyorlanmoqda. Ushbu jarayon Petri tarmog‘i yordamida modellashtirilgan. Marshrutlarni tuzish jarayoni poyezdlarni harakatlanayotgan stansiyalarida turib qolish shartlarini tekshirgan holda modellashtirilgan. Marshrut tayyorlashda signallashtirish, markazlashtirish va blokirovkalash qurilmalarining holati, poyezdlar marshrutlarini tayyorlash vaqtlarini inobatga olingan. Qilingan hisob kitob natijalaridan poyezdni stansiyadan jo‘natishga ruxsat beradi yoki taqiqlaydi. Stansiyadan poyezdni jo‘natish uchun, qabul qiluvchi stansiyaga poyezd kelishida hech qanaqa to‘siq bo‘lishi kerak emas.
- 16 November 2022
- Published by Springer Nature
- p. 1119-1129
Improved Method and Algorithm of Railway Crossing Automatic Signaling System
- 16 November 2022
- Published by Springer Nature
- p. 1119-1129
Improved Method and Algorithm of Railway Crossing Automatic Signaling System