Results 11 to 20 of about 2,512 (160)
Optimal Power Flow Using Tabu Search Algorithm [PDF]
Electric Power Components and Systems, 2002 This paper presents an efficient and reliable tabu search (TS)-based approach to solve the optimal power flow (OPF) problem. The proposed approach employs TS algorithm for optimal settings of the control variables of the OPF problem. Incorporation of TS as a derivative-free optimization technique in solving OPF problem significantly reduces the ...
openaire +3 more sources
Single-machine scheduling with periodic maintenance and learning effect
Scientific Reports, 2023 This paper discusses a single-machine scheduling problem with periodic maintenance activities and position-based learning effect to minimize the makespan.
Hui Wu, Hongmei Zheng
doaj +1 more source
TABU SEARCH WITH ASPIRATION CRITERION FOR THE TIMETABLING PROBLEM
Revista de Matemática: Teoría y Aplicaciones, 2015 The aspiration criterion is an imperative element in the Tabu Search, with aspiration-by-default and the aspiration-by-objective the mainly used criteria in the literature.
Oscar Chávez-Bosquez +2 more
doaj +1 more source
Self-organization in cooperative tabu search algorithms [PDF]
SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), 2002 The search history of memory based heuristics like tabu search can be used to design a category of parallel algorithms, called cooperative search. These algorithms execute in parallel several search programs on the same optimization problem instance. At run time, the data gathered in the memory by one sequential search program need not be used only by ...
M. Toulouse +3 more
openaire +1 more source
IEEE Access, 2022 Buffer allocation is an important research issue in the design and optimization of manufacturing systems. One objective of buffer allocation is to maximize the throughput subject to the total buffer capacity in manufacturing systems.
Sixiao Gao
doaj +1 more source
Application of Heuristic Combinations within a Hyper-Heuristic Framework for Exam Timetabling
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi), 2020 Examination Timetabling Problem is one of the optimization and combinatorial problems. It is proved to be a non-deterministic polynomial (NP)-hard problem.
Gabriella Icasia +2 more
doaj +1 more source
Tabu search algorithms for water network optimization [PDF]
European Journal of Operational Research, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cunha, Maria da Conceição +1 more
openaire +3 more sources
Tabu Search and an Exact Algorithm for the Solutions of Resource-constrained Project Scheduling Problems [PDF]
International Journal of Computational Intelligence Systems, 2011 When the project is scheduled with a given set of resources, it is difficult to find the optimal solution. Resourceconstrained scheduling problems (RCPSP) are generally NP-hard.
Omer Atli
doaj +1 more source
Large-scale timetabling problems with adaptive tabu search
Journal of Intelligent Systems, 2022 Timetabling problems are specific types of scheduling problems that deal with assigning certain events to the timeslots. This assigning is subject to certain hard constraints that should be achieved to get a feasible timetable and soft constraints that ...
Awad Fouad H. +2 more
doaj +1 more source
Silva Fennica, 2002 As both spatial and temporal characteristics of desired future conditions are becoming important measures of forest plan success, forest plans and forest planning goals are becoming complex.
Bettinger, Pete +4 more
doaj +1 more source