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

Dan Neiman | 2184028 | 1766257 | 2.7128e-06 | open | – | -1129915.8646* | rfds-4-days.mps.gz |

Flight scheduling model, anonymized. The most prominent aspect of this model is that it attempts to find an optimal schedule for a small (14) fleet of planes over a four day period, broken down into 96 hourly periods. Planes have 14 states (in-flight, or at one of 13 locations). Goal is to satisfy passenger demand with minimal cost and minimal violation of priority requests. Takes a considerable length of time (2+ hours) to find first integer solution using CPLEX.

Detailed explanation of the following tables can be found here.

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

Variables | 2184028 | 1536989 |

Constraints | 1766257 | 1333421 |

Binaries | 190080 | 184943 |

Integers | 0 | 3822 |

Continuous | 1993948 | 1348224 |

Implicit Integers | 0 | 3822 |

Fixed Variables | 27942 | 0 |

Nonzero Density | 2.71280e-06 | 3.19785e-06 |

Nonzeroes | 10464800 | 6553850 |

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

Total | 1766257 | 1333421 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 88071 | 0 |

Aggregations | 1069032 | 1038078 |

Precedence | 3072 | 0 |

Variable Bound | 1746 | 0 |

Set Partitioning | 0 | 0 |

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 | 604336 | 291521 |

General Linear | 0 | 3822 |

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 | |||||

Constraint % | |||||

Variable % | |||||

Score |

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 |
---|---|---|---|---|---|---|---|---|

5 | -1129916 | 0 | 0.0e+00 | 0 | Mars Davletshin | 2024-10-02 | It was obtained by OptVerse using LNS (near the previous incumbent). | |

4 | -1129724 | 0 | 0.0e+00 | 0 | Michael Winkler | 2023-11-14 | new incumbents found with Gurobi 10.0.2 on AMD EPYC 7313P 16-Core Processor with 264075352 kB memory running with default except for MIPGAP=0 | |

3 | -1126397 | 0 | 1.9e-06 | 0 | Edward Rothberg | 2019-12-13 | Obtained with Gurobi 9.0 | |

2 | -1115965 | 0 | 0.0e+00 | 0 | Robert Ashford and Alkis Vazacopoulus | 2019-12-18 | Found using ODH|CPlex | |

1 | -1101301 | 0 | 1.0e-07 | 0 | - | 2018-10-12 | Solution found during MIPLIB2017 problem selection. |

The following instances are most similar to rfds-4-days 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.

`No bibliographic information available`

Last Update 2024 by Julian Manns

generated with R Markdown

© by Zuse Institute Berlin (ZIB)

Imprint