Buscar
Mostrando ítems 1-10 de 852
A review and evaluation on constructive heuristics to optimise product mix based on the Theory of Constraints
(TAYLOR & FRANCIS LTDABINGDON, 2012)
In this paper, we address the problem of defining the product mix in order to maximise a system's throughput. This problem is well known for being NP-Complete and therefore, most contributions to the topic focus on developing ...
Implementation of an AC model for transmission expansion planning considering reliability constraints
(2013-07-18)
In this paper, a hybrid heuristic methodology that employs fuzzy logic for solving the AC transmission network expansion planning (AC-TEP) problem is presented. An enhanced constructive heuristic algorithm aimed at obtaining ...
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
(2015-10-29)
In this paper, we propose a simple but efficient heuristic that combines construction and improvement heuristic ideas to solve multi-level lot-sizing problems. A relax-and-fix heuristic is firstly used to build an initial ...
Heuristic for flow shop sequencing with separated and sequence independent setup times
(Associação Brasileira de Engenharia e Ciências Mecânicas - ABCM, 2011)
This paper deals with the permutation flow shop scheduling problem with separated and sequence-independent machine setup times. A heuristic method with the objective of minimizing the total time to complete the schedule ...
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 ...
Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem
(Univ Nac Colombia, Fac Ingenieria, 2011-04-01)
This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network ...
Accelerating autonomous learning by using heuristic selection of actions
(SPRINGER, 2008)
This paper investigates how to make improved action selection for online policy learning in robotic scenarios using reinforcement learning (RL) algorithms. Since finding control policies using any RL algorithm can be very ...
Worst-case performance of Wong's Steiner tree heuristic
(Elsevier B.V., 2007)
Improving the shift-scheduling problem using non-stationary queueing models with local heuristic and genetic algorithm
(2020-01-01)
We improve the shift-scheduling process by using nonstationary queueing models to evaluate schedules and two heuristics to generate schedules. Firstly, we improved the fitness function and the initial population generation ...
Lagrangian heuristic for a class of the generalized assignment problems
(Pergamon-Elsevier B.V. Ltd, 2010-08-01)
A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy ...