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

Steffen Weider | 174997 | 1042 | 2.53552e-02 | open | – | 247.91666363* | ds-big.mps.gz |

Bus driver duty scheduling problem

Imported from MIPLIB2010. Solution was computed with 12 Threads in 12 hours, using the approach of giving highest priority to the variables with the most edges in the conflic graph

Detailed explanation of the following tables can be found here.

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

Variables | 174997 | 174997 |

Constraints | 1042 | 1042 |

Binaries | 174997 | 174997 |

Integers | 0 | 0 |

Continuous | 0 | 0 |

Implicit Integers | 0 | 0 |

Fixed Variables | 0 | 0 |

Nonzero Density | 0.0253552 | 0.0253552 |

Nonzeroes | 4623440 | 4623440 |

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

Total | 1042 | 1042 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 0 | 0 |

Aggregations | 0 | 0 |

Precedence | 0 | 0 |

Variable Bound | 0 | 0 |

Set Partitioning | 1042 | 1042 |

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.

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

2 | 247.9167 | 0 | 0 | 0 | Ed Klotz | 2019-08-21 | “Computed with 12 Threads in 12 hours, using the approach of giving highest priority to the variables with the most edges in the conflic graph.” | |

1 | 325.0937 | 325.0937 | 0 | 0 | 0 | - | 2018-10-12 | Solution found during MIPLIB2017 problem selection. |

The following instances are most similar to ds-big 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 |
---|---|---|---|---|---|---|---|---|---|---|---|

ivu06 | open | 787239 | 787239 | 0 | 0 | 1177 | 8032300 | S. Weider | ivu | 146.70099942* | binary set_partitioning |

nw04 | easy | 87482 | 87482 | 0 | 0 | 36 | 636666 | MIPLIB submission pool | – | 16862 | benchmark binary benchmark_suitable set_partitioning |

ivu06-big | open | 2277736 | 2277736 | 0 | 0 | 1177 | 23125800 | S. Weider | ivu | 146.70099942* | binary set_partitioning |

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

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

```
@incollection{GroetschelBorndoerferLoebel2003,
author = {Martin Gr{\"o}tschel and Ralf Bornd{\"o}rfer and Andreas L{\"o}bel},
booktitle = {{MATHEMATICS} -- {K}ey {T}echnology for the {F}uture},
editor = {Willi J{\"a}ger and Hans-Joachim Krebs},
language = {English},
pages = {653--674},
publisher = {Springer-Verlag},
title = {Duty Scheduling in Public Transit},
year = {2003}
}
```

Last Update Okt 02, 2019 by Gregor Hendel

generated with R Markdown

© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)

Imprint