|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
The problem of gathering and scheduling a freight trainдоклад на конференции
- Авторы: Мусатова Е.Г., Хуснуллин Н.Ф., Лазарев А.А.
- Международная Конференция : EURO-INFORMS 26th European Conference on Operational Research (Rome, 2013)
- Даты проведения конференции: 2013
- Тип доклада: не указан
- Докладчик: не указан
- Место проведения: Рим, Италия, Italy
-
Аннотация доклада:
A polynomial dynamic programming algorithm was suggested to construct orders delivery schedule for one locomotive in a 3 station circuit. An approach to exact solution was proposed and the steps were represented to gather a freight train and build destination routing in order to minimize the total completion time. A point-to-point and a triangle shapes of railways are considered. Computational results are reported to conrfim the strength of our approach. The complexity of this algorithm is O(n8) operations.
- Добавил в систему: Лазарев Александр Алексеевич