Disjoint congruence classes and a timetabling application (Q1026128): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:56, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Disjoint congruence classes and a timetabling application |
scientific article |
Statements
Disjoint congruence classes and a timetabling application (English)
0 references
24 June 2009
0 references
The authors consider a combinatorial problem involving disjoint congruence classes which is motivated by an application in subway timetabling in simplified form. More specifically, the problem is to find pairwise disjoint congruence classes modulo certain given integers, where each of these classes corresponds to the arrival times of a subway line of a given frequency. For a large class of instances of the underlying line scheduling problem a characterization is given when such disjoint congruence classes exist and how they can be determined. Then a generalization is considered, where a minimum distance between consecutive trains (i.e., between congruence classes) is required. Finally, a computational method for solving the general case of this line scheduling problem based on integer linear programming is presented. The approach is briefly illustrated by two numerical examples.
0 references
disjoint congruence classes
0 references
timetabling
0 references
packing
0 references