A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling [PDF]
, 2010 Copyright @ Springer Science + Business Media. All rights reserved.The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in ...
Yang, S +4 more
core +1 more source
Otimização de leiaute usando busca tabu Facility layout optimization using tabu search
Gestão & Produção, 1997 A busca por leiautes de facilidades de alta qualidade pode ser vista como um problema de otimização combinatória que surge numa grande variedade de contextos de planejamento espacial.
João Carlos Furtado +1 more
doaj +1 more source
Tabu search and finite convergence
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fred W. Glover, Saïd Hanafi
openaire +2 more sources
Feature Selection Using Tabu Search with Learning Memory: Learning Tabu Search [PDF]
, 2016 Feature selection in classification can be modeled as a com-binatorial optimization problem. One of the main particularities of this problem is the large amount of time that may be needed to evaluate the quality of a subset of features. In this paper, we propose to solve this problem with a tabu search algorithm integrating a learning mechanism.
Mousin, Lucien +3 more
openaire +2 more sources
Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using tabu search [PDF]
, 2009 Copyright @ 2009 IEEE Computer SocietyThis paper proposes a tabu search (TS) based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network ...
Yang, S +5 more
core +1 more source
FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
Havacılık ve Uzay Teknolojileri Dergisi, 2008 In this study m-identical parallel machine scheduling problem with release date is considered. The objective function of the problem is minimization of the makespan.
Tamer Eren
doaj
An improved hybrid optimization algorithm for the quadratic assignment problem
Mathematical Modelling and Analysis, 2004 In this paper, we present an improved hybrid optimization algorithm, which was applied to the hard combinatorial optimization problem, the quadratic assignment problem (QAP).
A. Misevičius
doaj +1 more source
Design of Sensor Networks for Chemical Plants Based on Meta-Heuristics
Algorithms, 2009 In this work the optimal design of sensor networks for chemical plants is addressed using stochastic optimization strategies. The problem consists in selecting the type, number and location of new sensors that provide the required quantity and quality of
Mabel C. Sánchez +2 more
doaj +1 more source
A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Sumanta Basu, Ghosh, Diptesh
core
Implementing Tabu Search to Exploit Sparsity in ATSP Instances [PDF]
Real life traveling salesman problem (TSP) instances are often large,sparse, and asymmetric. Conventional tabu search implementations for the TSP that have been reported in the literature, almost always deals with small, dense and symmetric instances. In
Sumanta Basu +2 more
core