detected train conflicts Sofie Van Thielen* Pieter Vansteenwegen* - - PowerPoint PPT Presentation

▶
detected train conflicts
SMART_READER_LITE
LIVE PREVIEW

detected train conflicts Sofie Van Thielen* Pieter Vansteenwegen* - - PowerPoint PPT Presentation

Jan 12, 2024 40 likes •281 views

Heuristic for solving detected train conflicts Sofie Van Thielen* Pieter Vansteenwegen* Francesco Corman *KU Leuven Leuven Mobility Research Centre (L-Mob) TU Delft Maritime and Transport Technology Department Introduction

slide-1
SLIDE 1

Heuristic for solving detected train conflicts

Sofie Van Thielen* Pieter Vansteenwegen* Francesco Corman°

*KU Leuven – Leuven Mobility Research Centre (L-Mob) °TU Delft – Maritime and Transport Technology Department

slide-2
SLIDE 2

Introduction

  • Motivation
  • Goal
slide-3
SLIDE 3

Motivation

  • Normal situation:
  • Conflict:

3

slide-4
SLIDE 4

Motivation

4

  • In practice:

Real-time management is performed manually.

slide-5
SLIDE 5

Problem description

Given one (or more) conflicts, present different good solutions with the corresponding total delay.

In a tool that is directly accessible for the dispatchers.

5

slide-6
SLIDE 6

Simulation software

slide-7
SLIDE 7

Program

Infrastructure (XML format) Timetable (XML format) Simulation software Output

  • Delay scenarios
  • Conflict prevention techniques
  • Goal function

7

slide-8
SLIDE 8

Characteristics simulation

8

  • 1-hour window: 6-7 AM
  • ± 150 trains
  • Delay scenarios
  • Study area
  • Evaluation criteria
slide-9
SLIDE 9

Study area

  • Brugge-Gent-Denderleeuw (in Belgium)

9

Denderleeuw Brugge Gent Oostende

slide-10
SLIDE 10

Evaluation criteria

10

  • Total/maximal/average train delay
  • Total/maximal/average passenger delay
  • Total/maximal/average exit delay
slide-11
SLIDE 11

Heuristic

slide-12
SLIDE 12

Rerouting

12

  • Limited to station areas:
  • Minimize passenger delays or secondary delays
  • Optimization problem solved using Cplex
slide-13
SLIDE 13

Optimization model for rerouting

13

slide-14
SLIDE 14

Optimization model for rerouting

14

slide-15
SLIDE 15

Optimization model for rerouting

15

slide-16
SLIDE 16

Optimization model for rerouting

16

slide-17
SLIDE 17

If the conflict still exists after rerouting, then rescheduling is performed. Decision is based on heuristic:

17

Conflict prevention technique

  • Minimize the effect of conflicts
  • Investigate the progress during the next hour
  • Choose option with least total secondary delay
slide-18
SLIDE 18

18

Conflict A - B 1st train A then train B 1st train B then train A Total secondary delay of A Total secondary delay of B, given initial delay Total secondary delay of B from A Total secondary delay of B Total secondary delay of A, given initial delay Total secondary delay of B from A

Heuristic

slide-19
SLIDE 19

Results

slide-20
SLIDE 20

Preliminary results

20

Strategy Average secondary delay Maximal secondary delay FCFS – rerouting 45,26 3022 FCFS – passenger rerouting 45,37 3022 FCFS – no rerouting 48,03 3022 Heuristic – rerouting 34,38 3017 Heuristic – passenger rerouting 47,01 3017 Heuristic – no rerouting 43,13 3017

slide-21
SLIDE 21

Average computation time (in s)

21

Strategy Simulation FCFS – rerouting 242,82 FCFS – passenger rerouting 250,29 FCFS – no rerouting 260,56 Heuristic – rerouting 515,52 Heuristic – passenger rerouting 523,70 Heuristic – no rerouting 537,25

slide-22
SLIDE 22

Conclusion & further work

slide-23
SLIDE 23

Conclusion & further work

23

  • Improve heuristic and rerouting procedure
  • Optimize the number of rerouting optimizations
  • Examine differences with second or third order

propagations in heuristic what is the impact? is it possible to limit search area and create a “impact zone”?

slide-24
SLIDE 24

Heuristic for solving detected train conflicts

Sofie Van Thielen* Pieter Vansteenwegen* Francesco Corman°

*KU Leuven – Leuven Mobility Research Centre (L-Mob) °TU Delft – Maritime and Transport Technology Department