Search
Now showing items 21-30 of 426
A constructive heuristic algorithm for multi-stage transmission expansion planning under N-1 security constraints
(2015-04-01)
The transmission expansion planning (TEP) problem in modern power systems is a large-scale, mixed-integer, non-linear, and non-convex problem. The problem becomes even more complicated when the security constraints are ...
Heuristic algorithm to solve the short term transmission network expansion planning
(2007-12-01)
In this paper, a method for solving the short term transmission network expansion planning problem is presented. This is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion ...
Heuristic algorithm to solve the short term transmission network expansion planning
(2007-12-01)
In this paper, a method for solving the short term transmission network expansion planning problem is presented. This is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion ...
A Constructive Heuristic Algorithm for Distribution System Planning
(Institute of Electrical and Electronics Engineers (IEEE), 2014)
Heuristic algorithm to solve the short term transmission network expansion planning
(Ieee, 2007-01-01)
In this paper, a method for solving the short term transmission network expansion planning problem is presented. This is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion ...
A heuristic algorithm based on multi-assignment procedures for nurse scheduling
(2013-04-03)
This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction ...
A heuristic algorithm based on multi-assignment procedures for nurse scheduling
(2013-04-03)
This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction ...
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
(PERGAMON-ELSEVIER SCIENCE LTD, 2009)
The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for ...
Solving the assignment of customers to trucks and visit days in a periodic routing real-world case1
(Pontificia Universidad Javeriana, 2018-01-01)
Introduction: This work proposes a model and two heuristic algorithms to assign customers to trucks and visit days as a first phase in the solution of a real-world routing problem, which is closely related to the PVRP ...