Instance: catan
- Contents:
- Information
- File downloads
- Solution files
- References
Information:
- Description:
- Strategic / Tactical model of an artificial, yet realistic, underground mine planning model. This problem is a large scale-RCPSP that seeks to maximize the NPV of a project, and where activities are optional. See references for model formulation and details.
- Activity model:
- Number of activities: 8,497
- Number of arcs: 76,473
- Number of time periods: 1,825 days (approx. 5 years)
- Blockfile columns detail:
- <activityid> <objfunction> <duration> <coeff1> <coeff2> <
coeff3> <coeff4> <coeff5> <coeff6> <coeff7> <coeff8>
- Objective function computation
- Column objfunction gives undiscounted profit/cost associated to starting each activity
- Discount rate = 0.0002 (daily)
- Constraints:
- Renewable knapsack constraints limit the resources that can be consumed each period. The coefficient indicates the amount of resource consumed by each activity each time period. Resources are consumed by each activity for each period in which they are being executed (as given in column duration). It is assumed that the right-hand side (resource availability) is the same for all time periods.
- C0 Capacity constraint : Coefficients obtained from column coeff1. Right hand side : 4,700.0
- C1 Capacity constraint : Coefficients obtained from column coeff2. Right hand side : 600.0
- C2 Capacity constraint : Coefficients obtained from column coeff3. Right hand side : 3.0
- C3 Capacity constraint : Coefficients obtained from column coeff4. Right hand side : 1.0
- C4 Capacity constraint : Coefficients obtained from column coeff5. Right hand side : 1.0
- C5 Capacity constraint : Coefficients obtained from column coeff6. Right hand side : 6.0
- C6 Capacity constraint : Coefficients obtained from column coeff7. Right hand side : 1.0
- C7 Capacity constraint : Coefficients obtained from column coeff8. Right hand side : 30.0
File downloads:
- .blocks file: catanTR.blocks.zip
- .prec file: catanTR.prec.zip
Solution files:
LP relaxation solution for 1825 periods:
- Download: catanTR.lp.sol.zip
- Objective value: 958,993.73
LP relaxation solution for 3600 periods:
- Download: catan3600.lp.sol.zip
- Objective value: 976,122.73
Best known solution for 1825 periods:
- Download: catanTR.ijoc.ip.sol.zip
- Objective value: 935,899.32
Best known solution for 3600 periods:
- Download: catan3600.ip.sol.zip
- Objective value: 966,134.78
References:
- Alessandro Hill, Andrea Brickey, Italo Cipriano, Marcos Goycoolea and Alexandra Newman
(2022), Optimization Strategies for Resouce-Constrained Project Scheduling Problems in Underground Mining. INFORMS Journal on Computing,
Accepted.
- Gonzalo Muñoz, Daniel Espinoza, Marcos Goycoolea, Eduardo Moreno, Maurice Queyranne, Orlando Rivera (2018),
A study of the Bienstock-Zuckerberg Algorithm, Applications in Mining and Resource Constrained Project Scheduling. Computational Optimization
and Applications 69(2): 501-534