Search
Now showing items 61-70 of 1345
Genetic local search for multi-objective flowshop scheduling problems
(Elsevier Science BvAmsterdamHolanda, 2005)
Domain reduction using GRASP construction phase for transmission expansion planning problem
(2012-04-03)
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed ...
Domain reduction using GRASP construction phase for transmission expansion planning problem
(2012-04-03)
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed ...
Neural approach for solving several types of optimization problems
(Springer, 2014)
Comparative studies on non-convex optimization methods for transmission network expansion planning
(Institute of Electrical and Electronics Engineers (IEEE), 1998-08-01)
We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu ...
Comparative studies on non-convex optimization methods for transmission network expansion planning
(1997-12-01)
We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu ...
Comparative studies on non-convex optimization methods for transmission network expansion planning
(Institute of Electrical and Electronics Engineers (IEEE), 1998-08-01)
We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu ...
Comparative studies on non-convex optimization methods for transmission network expansion planning
(1997-12-01)
We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu ...