Results File
Dataset
File Header
Author(s):Petr Vil?m
Reference:Vil?m, P. (2011). Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources. International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, 16. https://doi.org/10.1007/978-3-642-21311-3_22
Date:2011
Hardware / software:Intel(R) Core(TM)2 Duo CPU T9400 on 2.53GHz
Stop criteria:time limit for each improvement step is 60 seconds
Submission date:2021
Statistics
New results:
1 new lower bounds
1 previous closed instances analysed
1 open instances updates (upper and lower bounds)
Results saved in sites/default/files/datasets/J90.csv
BKS saved in sites/default/files/datasets/J90_BKS.csv
Instances: 34
Lower Bounds: 34
- Average deviations:
- over CPM: 43.31%
- below best LB: 0.88%
- below best UB: 5.71%
- Best Known: 13 (38.24%)
- Closed (using best UBs): 0 (0.00%)
- Sum of time units: 4173
- Open time units:
- to LBs: 39 (0.93%)
- to UBs: 260 (5.87%)
1 new lower bounds
1 previous closed instances analysed
1 open instances updates (upper and lower bounds)
Results saved in sites/default/files/datasets/J90.csv
BKS saved in sites/default/files/datasets/J90_BKS.csv
Instances: 34
Lower Bounds: 34
- Average deviations:
- over CPM: 43.31%
- below best LB: 0.88%
- below best UB: 5.71%
- Best Known: 13 (38.24%)
- Closed (using best UBs): 0 (0.00%)
- Sum of time units: 4173
- Open time units:
- to LBs: 39 (0.93%)
- to UBs: 260 (5.87%)
Date