Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
From MaRDI portal
Publication:6088241
DOI10.1111/itor.12557OpenAlexW2804679606WikidataQ129735832 ScholiaQ129735832MaRDI QIDQ6088241
Nicolas Dupin, El-Ghazali Talbi
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12557
mixed integer programmingunit commitment problemhybrid heuristicsmatheuristicparallel metaheuristicsvariable fixingkernel searchLP-guided heuristics
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A polyhedral study of production ramping
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Restrict-and-relax search for 0-1 mixed-integer programs
- RENS. The optimal rounding
- Tight MIP formulations of the power-based unit commitment problem
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- Local branching
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Pivot and shift -- a mixed integer programming heuristic
- Min-up/min-down polytopes
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- The summed start-up costs in a unit commitment problem
- A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system
- A feasibility pump heuristic for general mixed-integer problems
- Parametric tabu-search for mixed integer programs
- A primal-proximal heuristic applied to the French unit-commitment problem
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
- New variable neighbourhood search based 0-1 MIP heuristics
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
This page was built for publication: Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
