Pages that link to "Item:Q877631"
From MaRDI portal
The following pages link to A floating-point genetic algorithm for solving the unit commitment problem (Q877631):
Displaying 10 items.
- A hybrid biased random key genetic algorithm approach for the unit commitment problem (Q405676) (← links)
- A memory simulated annealing method to the unit commitment problem with ramp constraints (Q458440) (← links)
- Unit commitment scheduling using binary differential evolution algorithm (Q980523) (← links)
- A modified differential evolution algorithm for the solution of a large-scale unit commitment problem (Q1637784) (← links)
- A strengthened mixed-integer linear programming formulation for combined-cycle units (Q1719619) (← links)
- An intelligent computing technique based on a dynamic-size subpopulations for unit commitment problem (Q2329570) (← links)
- Two-stage network constrained robust unit commitment problem (Q2514777) (← links)
- A polynomial-time algorithm with tight error bounds for single-period unit commitment problem (Q2687676) (← links)
- Unit commitment by a genetic algorithm (Q4378937) (← links)
- An application of genetic and evolutive algorithms to unit commitment problem (Q5957460) (← links)