نتایج جستجو برای: guided tabu search

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

2010
Siddhartha Jain Matthew Mallozzi

We analyze the possibility of parallelizing the Traveling Salesman Problem over the MapReduce architecture. We present the serial and parallel versions of two algorithms Tabu Search and Large Neighborhood Search. We compare the best tour length achieved by the Serial version versus the best achieved by the MapReduce version. We show that Tabu Search and Large Neighborhood Search are not well su...

2002
BRUNO PINAUD

In this paper we present a Genetic Algorithm (GA) with problem-specific operators for the layered digraph drawing problem and compare it with two very different meta-heuristics: Tabu search and Multi-start descents. Tabu search has previously proved to be better than the classical deterministic local heuristic often employed in graph drawing. Here, we show on a set of 282 medium-sized graphs th...

Journal: :JCP 2013
Partha Pratim Das Sriyankar Acharyya

Now-a-days different meta-heuristic approaches, their variants and hybrids are being applied for solving Combinatorial Optimization Problems (COP). In this paper Resource Constrained Project Scheduling Problem (RCPSP) has been presented as a COP. This is a common problem for many construction projects. It is highly constrained and is categorized as a NP-hard problem. In our earlier work Simulat...

2002
Michel Gagnon Fayez Boctor

This paper presents a new and efficient Tabu search procedure to solve the Resource-Constrained, Project-Scheduling problem with either single or multiple execution modes and with variable resource availability. It investigates the efficiency of some neighborhood structures and of bounds used to reduce the computational time. Results show that the proposed Tabu search provides the bestknown sol...

1997
Bertrand Mazure Lakhdar Sais Éric Grégoire

In this paper tabu search for SAT is investi gated from an experimental point of view To this end TSAT a basic tabu search algorithm for SAT is introduced and compared with Selman et al Random Walk Strategy GSAT procedure in short RWS GSAT TSAT does not involve the ad ditional stochastic process of RWS GSAT This should facilitate the understanding of why simple local search methods for SAT work...

Journal: :J. UCS 2008
Adam Janiak Wladyslaw A. Janiak Maciej Lichtenstein

Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of the CPU and can be increased by proper use of the GPGPU, i.e. General-Purpose Computation Using Graphics Hardware. Modern graphics hardware, initially developed for computer graphics generation, appeared to be flexible...

Journal: :INFORMS Journal on Computing 1994
Roberto Battiti Giampietro Tecchiolli

We propose an algorithm for combinatorial optimization where an explicit check for the repetition of configurations is added to the basic scheme of Tabu search. In our Tabu scheme the appropriate size of the list is learned in an automated way by reacting to the occurrence of cycles. In addition, if the search appears to be repeating an excessive number of solutions excessively often, then the ...

Journal: :European Journal of Operational Research 2013
Ravi Kothari Diptesh Ghosh

The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper, we present two tabu search implementations, one involving an exhaustive search of the 2-opt neighborhood and the other involving an exhaustive search of the i...

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

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