Efficient light rail turnaround planning and assignment to parking spots are essential to optimize urban public transport systems. This paper analyzes heuristic algorithms for light rail vehicle parking developed for DSW21, a public transport company in Dortmund, Germany, to automate the previously manual process of assigning light rails to accessible parking spots while meeting a given timetable. During the development of the automated software, user-friendly functionality and adherence to company standards and design conventions were considered by involving users in the process. The developed tool takes timetable data as input and generates schedules using a First Come, First Served (FCFS) heuristic that constructively assigns light rails to accessible parking spots. The tool reduces the need for manual schedule readjustments, consistently achieving placement rates of 95 % to 100 % for routine timetables with the heuristics.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Developing Heuristic Software for Track Occupation in Vehicle Parking Areas

  • Patrick Buhle,
  • Benedikt Kordus,
  • Christin Schumacher,
  • Uwe Clausen

摘要

Efficient light rail turnaround planning and assignment to parking spots are essential to optimize urban public transport systems. This paper analyzes heuristic algorithms for light rail vehicle parking developed for DSW21, a public transport company in Dortmund, Germany, to automate the previously manual process of assigning light rails to accessible parking spots while meeting a given timetable. During the development of the automated software, user-friendly functionality and adherence to company standards and design conventions were considered by involving users in the process. The developed tool takes timetable data as input and generates schedules using a First Come, First Served (FCFS) heuristic that constructively assigns light rails to accessible parking spots. The tool reduces the need for manual schedule readjustments, consistently achieving placement rates of 95 % to 100 % for routine timetables with the heuristics.