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

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

Journal: :INFORMS Journal on Computing 2004
Sadan Kulturel-Konak, Bryan A. Norman, David W. Coit, Alice E. Smith,

T paper puts forth a general method to optimize constrained problems effectively when using tabu search. An adaptive penalty approach is used that exploits the short-term memory structure of the tabu list along with the long-term memory of the search results. It is shown to be effective on a variety of combinatorial problems with different degrees and numbers of constraints. The approach requir...

Journal: :Australasian J. Combinatorics 1995
Patric R. J. Östergård,

The problem of finding multiple coverings words) of the space is considered. of upper and lower bounds for such codes were et aI., Bounds for multiple covering codes, Des. Codes Cryptogr. 3 (1993), The new codes found in this work improve on 27 upper bounds in those tables. The codes were found using tabu search. The of this method is and it is shown how it also can be used to search for large ...

2004
João Pedro Pedroso,

This paper introduces tabu search for the solution of general linear integer problems. Search is done on integer variables; if there are continuous variables, their corresponding value is determined through the solution of a linear program, which is also used to evaluate the integer solution. The complete tabu search procedure includes an intensification and diversification procedure, whose eff...

Journal: :INFORMS Journal on Computing 2004
Jacek Blazewicz, Fred Glover, Marta Kasprzak,

1. Biochemical Preliminaries and Problem Formulation DNA sequencing is one of the most important problems in computational molecular biology. The goal is to determine a sequence of nucleotides of a DNA fragment. Such a fragment is usually written as a sequence of the letters A, C, G, and T, representing four nucleotides composing the fragment, i.e., adenine, cytosine, guanine, and thymine, resp...

Journal: :European Journal of Operational Research 2010
Zhipeng Lü, Jin-Kao Hao,

This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general framework composed of three phases: initialization, intensification and diversification. The initialization phase constructs a feasible initial timetable using a fast greedy heuristic. Then an adaptively combined intensific...

2003
Kevin Smyth, Holger H. Hoos, Thomas Stützle,

MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in AI and other areas of computing science. In this paper, we present a new stochastic local search (SLS) algorithm for MAXSAT that combines Iterated Local Search and Tabu Search, two well-known SLS methods that have been...

1994
Ivanoe De Falco, Renato Del Balio, Ernesto Tarantino, Roberto Vaccaro,

Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively parallel systems constitutes an opportunity to be considered for solving significant applications in reasonable times. In this paper, starting from Tabu Search, a general optimization methodology, a parallel version, ...

Journal: :CoRR 2014
Andy M. Connor,

Abstract This paper describes a novel refinement to a Tabu search algorithm that has been implemented in an attempt to improve the robustness of the search when applied to particularly complex problems. In this approach, two Tabu searches are carried out in parallel. Each search thread is characterised by it's own short term memory which forces that point out of local optima. However, the two s...

2006
J. Nibecker, D. Taylor, R. Chambers, H. Larsen, K. Cudworth, C. Warren, J. Pohl,

Military deployment and distribution responsibilities call for intelligent collaborative tools in support of strategic and operational planning functions involving the sustainment and movement of military forces. The sustainment requirement is generated at the operational level and is dynamic. It is composed of shifting priorities responding to changes in commander’s intent and changes in the o...

2008
Isabelle Devarenne, Hakim Mabed, Alexandre Caminada,

Optimization methods based on complete neighborhood exploration such as Tabu Search are impractical against large neighborhood problems. Strategies of candidate list propose a solution to reduce the neighborhood exploration complexity. We propose in this paper a generic Tabu Search algorithm using adaptive candidate list strategy based on two alternate candidate lists. Each candidate list strat...

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

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