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

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

2017
Jean-Yves Potvin,

This chapter presents the fundamental concepts of tabu search (TS) in a tutorial fashion. Special emphasis is put on showing the relationships with classical local search methods and on the basic elements of any TS heuristic, namely the definition of the search space, the neighborhood structure, and the search memory. Other sections cover other important concepts such as search intensification ...

1997
Jiefeng Xu, Steve Y. Chiu, Fred Glover,

This paper presents a tabu search approach for optimizing the link capacities in a dynamic routing telecommunications network. The traac between any two nodes in the network is routed over a one-link direct path or, if no direct capacity is available, over a two-link alternate path. The alternate routing paths can be changed dynamically from hour to hour as the traac between pairs of nodes may ...

1995
Fred Glover,

Tabu search has achieved widespread successes in solving practical optimization problems. Applications are rapidly growing in areas such as resource management, process design, logistics, technology planning, and general combinatorial optimization. Hybrids with other procedures, both heuristic and algorithmic, have also produced productive results. We examine some of the principal features of t...

2007
Mostafa Jafari,

Fuzzy Cognitive Maps (FCMs) is a causal graph, which shows the relations between essential components in complex systems. Experts who are familiar with the system components and their relations can generate a related FCM. There is a big gap when human experts cannot produce FCM or even there is no expert to produce the related FCM. Therefore, a new mechanism must be used to bridge this gap. In ...

1995
Roberto Battiti,

A novel algorithm for the global optimization of functions (C-RTS) is presented, in which a combinato-rial optimization method cooperates with a stochastic local minimizer. The combinatorial optimization component, based on the Reactive Tabu Search recently proposed by the authors, locates the most promising \boxes," where starting points for the local minimizer are generated. In order to cover...

1998
Sadiq M. Sait, Habib Youssef, Munir M. Zahra,

In this paper we address the problem of optimizing mixed CMOS/BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an tabu search algorithm. Only gates on the critical sensitizable paths are considered for optimization. Such a strategy leads to sizable circuit speed improvement with minimum increase in the overall circuit capacitance. C...

2016
Lucien Mousin, Laetitia Vermeulen-Jourdan, Marie-Éléonore Kessaci-Marmion, Clarisse Dhaenens,

Feature selection in classification can be modeled as a combinatorial 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. To do so, we adapt to the feature selection proble...

2008
Susana Fernandes, Helena R. Lourenço,

This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the valid inequalities are used to guide the reconstruction of a complete solution. An application of the new method to the Job-Shop Scheduling proble...

2006
Nicolas Zufferey, Martin Studer, Edward A. Silver,

The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was proposed by the automobile manufacturer Renault. The first objective of the car industry is to assign a production day to each customer-ordered car and the second one consists of scheduling the order of cars to be put on the...

2001
Maria J. Blesa, Lluís Hernàndez, Fatos Xhafa,

In this paper we present two generic parallel skeletons for Tabu Search method –a well known meta-heuristic for approximately solving combinatorial optimization problems. The first skeleton is based on independent runs while the second in the classical master-slave model. Our starting point is the design and implementation of a sequential skeleton that is used later as basis for the two paralle...

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

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