Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|

R. Borndörfer | 73885 | 551 | 8.0001e-03 | open | – | 158260* | t1717.mps.gz |

Vehicle scheduling set partitioning problem from Berlin’s Telebus handicapped people’s transportation system Imported from MIPLIB2010. Solution was computed with 12 Threads in 20 hours, by giving highest priority to variables with most edges in conflict graph.

Detailed explanation of the following tables can be found here.

Original | Presolved | |
---|---|---|

Variables | 73885 | 73885 |

Constraints | 551 | 551 |

Binaries | 73885 | 73885 |

Integers | 0 | 0 |

Continuous | 0 | 0 |

Implicit Integers | 0 | 0 |

Fixed Variables | 0 | 0 |

Nonzero Density | 0.0080001 | 0.0080001 |

Nonzeroes | 325689 | 325689 |

Original | Presolved | |
---|---|---|

Total | 551 | 551 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 0 | 0 |

Aggregations | 0 | 0 |

Precedence | 0 | 0 |

Variable Bound | 0 | 0 |

Set Partitioning | 551 | 551 |

Set Packing | 0 | 0 |

Set Covering | 0 | 0 |

Cardinality | 0 | 0 |

Invariant Knapsack | 0 | 0 |

Equation Knapsack | 0 | 0 |

Bin Packing | 0 | 0 |

Knapsack | 0 | 0 |

Integer Knapsack | 0 | 0 |

Mixed Binary | 0 | 0 |

General Linear | 0 | 0 |

Indicator | 0 | 0 |

Available nonzero structure and decomposition information. Further information can be found here.

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

value | min | median | mean | max | |
---|---|---|---|---|---|

Components | 0.30103 | ||||

Constraint % | 100 | 100 | 100 | 100 | |

Variable % | 100 | 100 | 100 | 100 | |

Score | 0.00000 |

Find solutions below. Download the archive containing all solutions from the Download page.

`## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion`

ID | Objective | Exact | Int. Viol | Cons. Viol | Obj. Viol | Submitter | Date | Description |
---|---|---|---|---|---|---|---|---|

8 | 158260 | 158260 | 0 | 0 | 0 | Yuji Shinano | 2020-06-24 | Obtained with ParaSCIP in 2016. |

7 | 158820 | 158820 | 0 | 0 | 0 | Edward Rothberg | 2020-06-11 | Obtained with Gurobi 9.0 using the solution improvement heuristic |

6 | 161330 | 161330 | 0 | 0 | 0 | Yuji Shinano | 2020-04-16 | Obtained with ParaSCIP in 2014 |

5 | 162717 | 0 | 0 | 0 | Edward Rothberg | 2020-02-17 | Obtained with Gurobi 9.0 using the solution improvement heuristic | |

4 | 164713 | 0 | 0 | 0 | Kengo Nakamura | 2020-02-06 | Obtained with weighting local search with exploiting variable associations (WLS) ([1]) [1] Umetani, Shunji. “Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs.” European Journal of Operational Research 263.1 (2017): 72-81. | |

3 | 174253 | 0 | 0 | 0 | Edward Rothberg | 2019-12-13 | Obtained with Gurobi 9.0 | |

2 | 180966 | 0 | 0 | 0 | Ed Klotz | 2019-08-21 | Computed with 12 Threads in 20 hours, by giving highest priority to variables with most edges in conflict graph | |

1 | 184271 | 184271 | 0 | 0 | 0 | - | 2018-10-11 | Solution found during MIPLIB2017 problem selection. |

The following instances are most similar to t1717 in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

Instance | Status | Variables | Binaries | Integers | Continuous | Constraints | Nonz. | Submitter | Group | Objective | Tags |
---|---|---|---|---|---|---|---|---|---|---|---|

t1722 | open | 36630 | 36630 | 0 | 0 | 338 | 133096 | R. Borndörfer | – | 108953.0* | binary set_partitioning |

eil33-2 | easy | 4516 | 4516 | 0 | 0 | 32 | 44243 | J. Linderoth | eil | 934.007915999999 | benchmark binary benchmark_suitable set_partitioning |

h80x6320 | easy | 12640 | 6320 | 0 | 6320 | 79 | 6320 | MIPLIB submission pool | fixed-cost-network-flow | 3700 | binary decomposition set_partitioning |

eilC76-2 | easy | 28599 | 28599 | 0 | 0 | 75 | 314837 | J. Linderoth | eil | 762.514781999996 | binary benchmark_suitable set_partitioning |

ds | hard | 67732 | 67732 | 0 | 0 | 656 | 1024059 | MIPLIB submission pool | – | 93.52 | binary set_partitioning |

```
@book{Borndoerfer1998,
address = {Aachen},
author = {Ralf Bornd{\"o}rfer},
instance = {t1717},
language = {English},
note = {Ph.D. thesis, Technische Universit{\"a}t Berlin},
publisher = {Shaker Verlag},
title = {Aspects of Set Packing, Partitioning, and Covering},
year = {1998}
}
@inproceedings{BorndoerferGroetschelKlostermeierKuettner1999,
address = {Berlin},
author = {Ralf Bornd{\"o}rfer and Martin Gr{\"o}tschel and
Fridolin
Klostermeier and Christian K{\"u}ttner},
booktitle = {Proceedings of the 7th International Workshop on
Computer-Aided Transit Scheduling},
editor = {Nigel Wilson},
language = {English},
pages = {391--422},
publisher = {Springer Verlag},
series = {Lecture Notes in Economics and Mathematical Systems},
title = {Telebus {B}erlin: Vehicle Scheduling in a Dial-a-Ride
System},
volume = {471},
year = {1999}
}
```

Last Update Mar 04, 2024 by Julian Manns

generated with R Markdown

© 2023 by Zuse Institute Berlin (ZIB)

Imprint