نتایج جستجو برای Tabu search

تعداد نتایج: 223935  

2014
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severin,

The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem , current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic m...

Journal: :Comp. Opt. and Appl. 2014
Tamer F. Abdelmaguid, Mohamed A. Shalaby, Mohamed A. Awwad,

In the multiprocessor open shop scheduling problem, jobs are to be processed on a set of processing centers -each having one or more parallel identical machines, while jobs do not have a pre-specified obligatory route. A special case is the proportionate multiprocessor open shop scheduling problem (PMOSP) in which the processing time on a given center is not job-dependent. Applications of the P...

Journal: :Computers & Industrial Engineering 2017
Wojciech Bozejko, Andrzej Gnatowski, Jaroslaw Pempera, Mieczyslaw Wodecki,

In this paper, we consider a cyclic job shop problem, consisting of production of a certain set of elements at fixed intervals. Optimization of the process is reduced to a minimization of a cycle time, i.e. the time, after which the next batch of the same elements may be produced. We introduce a new parallel method for the cost function calculation. The parallelization is not trivial and cannot...

1999
Marcus Randall, David Abramson,

Tabu Search (TS) is a meta-heuristic search algorithm that is easy to parallelise. E cient parallelisation of TS can represent a signi cant saving in the real-time required to solve a problem over an equivalent sequential algorithm. In this study, a general parallel TS algorithm for solving combinatorial optimisation problems (COPs) is presented. The unique feature of our approach is that the T...

Journal: :Informatica, Lith. Acad. Sci. 2006
Gintaras Palubeckis,

Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization problem consists in finding a subset of objects for which the overall profit is maximized. In this paper, an iterated tabu search algorithm for solving this problem is proposed. Computational results for problem instan...

Journal: :J. Heuristics 1998
Jin-Kao Hao, Raphaël Dorne, Philippe Galinier,

The main goal of the Frequency Assignment Problem in mobile radio networks consists of assigning a limited number of frequencies to each radio cell in a cellular network while minimizing electromagnetic interference due to the re-use of frequencies. This problem, known to be NP-hard, is of great importance in practice since better solutions will allow a telecommunications operator to manage lar...

2012
Maha IDRISSI, Olivier ZENDRA,

Reducing energy consumption of embedded systems requires careful memory management. It has been shown that ScratchPad Memories (SPMs) are low size, low cost, efficient (i.e. energy saving) data structures directly managed at the software level. In this paper, the focus is on heuristic methods for SPMs management. A method is efficient if the number of accesses to SPM is as large as possible and...

Journal: :Trans. Emerging Telecommunications Technologies 2012
Hany Kamal, Marceau Coupechoux, Philippe Godlewski,

In this paper, we present and analyze a Tabu Search (TS) algorithm for Dynamic Spectrum Allocation (DSA) in cellular networks. We study a case where an operator is providing packet services to the endusers. The objective of the cellular operator is to maximize its reward while taking into account the trade-off between the spectrum cost and the revenues obtained from end-users. These revenues ar...

1997
E. G. Talbi, Z. Ha,

This paper presents a new approach for parallel tabu search based on adaptive par-allelism. Adaptive parallelism demonstrates that massively parallel computing using a hundred of heterogeneous machines is feasible to solve large optimization problems. The parallel tabu search algorithm includes diierent tabu list sizes and new intensiication/diversiication mechanisms. Encouraging results have b...

2000
George M. White, Bill S. Xie,

The examination scheduling problem has been examined and a four-phase system using a tabu search algorithm, OTTABU, has been implemented. This system uses both recency-based short-term memory and move (or frequency)-based longer-term memory to improve the quality of the solutions found. The system was tested using real data obtained from the University of Ottawa registrar’s office and real exam...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید