Evolutionary Computation in Combinatorial Optimization

DOI10.1007/B107115zbMATH Open1101.90089OpenAlexW1533372799MaRDI QIDQ5706017FDOQ5706017

Authors: T. Aruldoss Albert Victoire, A. Ebenezer Jeyakumar 

Publication date: 10 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b107115

Recommendations

• Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm
• A memory simulated annealing method to the unit commitment problem with ramp constraints
• A hybrid neural network and simulated annealing approach to the unit commitment problem
• VNS based heuristic for solving the unit commitment problem
• A modified differential evolution algorithm for the solution of a large-scale unit commitment problem

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (6)

• A modified differential evolution algorithm for the solution of a large-scale unit commitment problem
• A memory simulated annealing method to the unit commitment problem with ramp constraints
• A hybrid neural network and simulated annealing approach to the unit commitment problem
• Feasible modified subgradient method for solving the thermal unit commitment problem as a new approach
• Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm
• A simulated annealing genetic algorithm for the electrical power districting problem

This page was built for publication: Evolutionary Computation in Combinatorial Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706017)