Популярное

Музыка Кино и Анимация Автомобили Животные Спорт Путешествия Игры Юмор

Интересные видео

2025 Сериалы Трейлеры Новости Как сделать Видеоуроки Diy своими руками

Топ запросов

смотреть а4 schoolboy runaway турецкий сериал смотреть мультфильмы эдисон
dTub
Скачать

[Scheduling seminar] Hoogeveen, J.A. (Utrecht Uni) | Planning shunting operations at railway hubs

Автор: Scheduling seminar

Загружено: 2025-11-26

Просмотров: 121

Описание:

Keywords: Shunt yard planning, AI, Local Search, Constraint Programming, Linear Programming, Data analysis, Logistic Regression, Decomposition, Synchronization, Technician Routing

At night, trains are parked on shunting yards. Here cleaning and small maintenance takes place, after which the trains have to leave in the morning at the planned departure time and in the desired composition, which may require splitting and coupling during their stay at the yard. As NS (Dutch Railways) continues to expand its fleet while the available yard space remains fixed, the shunting yards are becoming increasingly congested, with occupation rates reaching up to 90%. Consequently, planning all train movements and related activities has become a complex challenge. In this talk, I will discuss the main challenges encountered in planning the shunting yards and the algorithms that we have designed to tackle these problems. First, I want to discuss the shunting problem on a single yard. We solve this problem using local search; our algorithm is the first one that is capable of solving real-world problem instances of the complete shunting and scheduling problem. Next, I want to extend the problem to the entire station area, which requires that we distribute the trains over two (or more) shunting yards, while avoiding interference with through traffic and respecting the capacity of the separate shunting yards. The main difficulty here is that the capacity of the shunting yard is not known; we use data analysis to estimate it. Finally, I want to discuss the problem of assigning shunting tasks to train drivers. This is a variant of the technician routing problem without skills, but with synchronization. We have developed an algorithm for this that is based on a novel decomposition approach.

Organized by Zdenek Hanzalek (CTU in Prague), Michael Pinedo (New York University), and Guohua Wan (Shanghai Jiao Tong).

Seminar's webpage: https://schedulingseminar.com/

[Scheduling seminar] Hoogeveen, J.A. (Utrecht Uni)  | Planning shunting operations at railway hubs

Поделиться в:

Доступные форматы для скачивания:

Скачать видео mp4

  • Информация по загрузке:

Скачать аудио mp3

Похожие видео

[Scheduling seminar] Zhi-Long Chen (Univ of Maryland) | Online Integrated Production Scheduling

[Scheduling seminar] Zhi-Long Chen (Univ of Maryland) | Online Integrated Production Scheduling

Lec-9: Introduction to Decision Tree 🌲 with Real life examples

Lec-9: Introduction to Decision Tree 🌲 with Real life examples

[Scheduling seminar] Changhyun Kwon (KAIST/Omelet, Inc.) | Learning-Based Approaches to Comb. Prob.

[Scheduling seminar] Changhyun Kwon (KAIST/Omelet, Inc.) | Learning-Based Approaches to Comb. Prob.

[Scheduling seminar] André Rossi (Universite PSL) | Maximizing stability of assembly line...

[Scheduling seminar] André Rossi (Universite PSL) | Maximizing stability of assembly line...

[Scheduling seminar] Philippe Laborie (Hexaly) | Hexaly Optimizer for Scheduling

[Scheduling seminar] Philippe Laborie (Hexaly) | Hexaly Optimizer for Scheduling

Анализ неопределенности крупномасштабных инвестиционных планов — запись вебинара

Анализ неопределенности крупномасштабных инвестиционных планов — запись вебинара

Think Like an Economist: Financial Literacy and Economic Understanding in An Age of Complexity

Think Like an Economist: Financial Literacy and Economic Understanding in An Age of Complexity

[Scheduling seminar] Ender Ozcan (Uni of Nottingham) | Machine Learning meets Sel. Hyper-heuristic

[Scheduling seminar] Ender Ozcan (Uni of Nottingham) | Machine Learning meets Sel. Hyper-heuristic

[Scheduling seminar] Maciej Drozdowski (Poznan UT) | Scheduling divisible loads

[Scheduling seminar] Maciej Drozdowski (Poznan UT) | Scheduling divisible loads

Екатерина Шульман: как изменилось отношение россиян к войне в 2025 году

Екатерина Шульман: как изменилось отношение россиян к войне в 2025 году

[Scheduling seminar] Pieter Smet (KU Leuven) | Robustness in personnel rostering

[Scheduling seminar] Pieter Smet (KU Leuven) | Robustness in personnel rostering

[Scheduling seminar] Laurent Perron (Google France) | The CP-SAT solver

[Scheduling seminar] Laurent Perron (Google France) | The CP-SAT solver

Vintage Floral Free Tv Art Wallpaper Screensaver Home Decor Samsung Oil Painting Digital Wildflower

Vintage Floral Free Tv Art Wallpaper Screensaver Home Decor Samsung Oil Painting Digital Wildflower

К чему готовиться? Останемся без денег? Что делать, когда заблокируют всё? || Дмитрий Потапенко*

К чему готовиться? Останемся без денег? Что делать, когда заблокируют всё? || Дмитрий Потапенко*

После Купянска Путину не верят даже свои. Руслан Левиев

После Купянска Путину не верят даже свои. Руслан Левиев

[Scheduling seminar] Defeng Sun (DAO lab, NEU China) | Combinatorial Benders approach to solve...

[Scheduling seminar] Defeng Sun (DAO lab, NEU China) | Combinatorial Benders approach to solve...

1. Introduction and Scope

1. Introduction and Scope

[Scheduling Seminar] Daniele Vigo (Unibo CIRI-ICT) | One Million ... and Beyond! Solving Huge VRPs

[Scheduling Seminar] Daniele Vigo (Unibo CIRI-ICT) | One Million ... and Beyond! Solving Huge VRPs

[Scheduling seminar] Rachel R. Chen (UC Davis) | Outpatient Appointment Scheduling

[Scheduling seminar] Rachel R. Chen (UC Davis) | Outpatient Appointment Scheduling

[Scheduling seminar] Zijie Zhou (IEDA, HKUST) | Efficient and Robust LLM Scheduling

[Scheduling seminar] Zijie Zhou (IEDA, HKUST) | Efficient and Robust LLM Scheduling

© 2025 dtub. Все права защищены.



  • Контакты
  • О нас
  • Политика конфиденциальности



Контакты для правообладателей: [email protected]