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

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

Journal: :Computers & OR 2012
Jean-François Cordeau, Mirko Maischberger,

This paper introduces a parallel iterated tabu search heuristic for solving four different routing problems: the classical vehicle routing problem (VRP), the periodic VRP, the multi-depot VRP, and the site-dependent VRP. In addition, it is applicable to the time-window constrained variant of these problems. Using the iterated local search framework, the heuristic combines tabu search with a sim...

Journal: :CoRR 2004
Alejandro Chinea Manrique De Lara,

The generation of meaningless "words" matching certain statistical and/or linguistic criteria is frequently needed for experimental purposes in Psycholinguistics. Such stimuli receive the name of pseudowords or nonwords in the Cognitive Neuroscience literature. The process for building nonwords sometimes has to be based on linguistic units such as syllables or morphemes, resulting in a numerica...

2004
Deacha Puangdownreong, Thanatchai Kulworawanichpong, Sarawut Sujitjorn,

The naïve tabu search (NTS) has been enhanced with two adaptive mechanisms namely back-tracking and adaptive search radius. The proposed search is called adaptive tabu search (ATS). The paper provides convergence and performance analyses of the ATS.

2003
Thiago F. Noronha, Celso C. Ribeiro,

Let G = (V, E) be a non-directed graph, where E is the set of edges and V is the set of nodes. Let also V1, V2, . . . , Vp be a partition of V into q subsets such that V1 ∪ V2 ∪ . . . ∪ Vq = V and Vi ∩ Vj = ∅, ∀i, j = 1, . . . , q with i 6= j. We refer to V1, V2, . . . , Vp as the components of the partition. Then, the Partition Coloring Problem (PCP) consists in finding a subset V p ⊂ V such t...

2006
Frank Jacobsen, Andreas Bortfeldt, Hermann Gehring,

In recent years many solution approaches for different school timetabling problems (TTP) have been tried, among them tabu search, simulated annealing, genetic algorithms, and constraint programming [8]. However, most of the solution methods developed so far have been tested by means of only few (mostly only a handful) problem instances [6]. Further, until today there are nearly no reports on te...

Journal: :Computers & OR 2012
Bahriye Cesaret, Ceyda Oguz, F. Sibel Salman,

Order acceptance and scheduling decisions arise when the limited production capacity entails a manufacturer to select among incoming orders. In this paper, we consider an order acceptance and scheduling problem in a single machine environment where the orders are processed without preemption and a sequence dependent setup time is incurred between processing of every consecutive order. The probl...

Journal: :Artif. Intell. 2003
Jean-Paul Watson, J. Christopher Beck, Adele E. Howe, L. Darrell Whitley,

Tabu search algorithms are among the most effective approaches for solving the job-shop scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so well, and under what conditions. We develop a model of problem difficulty for tabu search in the JSP, borrowing from similar models developed for SAT and other NP-complete problems. We show that the mean distance betw...

2009
Anant Oonsivilai, Wichai Srisuruk, Boonruang Marungsri, Thanatchai Kulworawanichpong,

Optimal routing in communication networks is a major issue to be solved. In this paper, the application of Tabu Search (TS) in the optimum routing problem where the aim is to minimize the computational time and improvement of quality of the solution in the communication have been addressed. The goal is to minimize the average delays in the communication. The effectiveness of Tabu Search method ...

2001
Jean-François Cordeau, Gilbert Laporte,

This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighbourhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed by computational results and the conclusion.

2014
Fadi K. Dib, Peter Rodgers,

This paper describes an automated tabu search based method for drawing general simple graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing. We formulated the task as a multi-criteria optimization problem with a number of metrics which are used in a weighted fitness function to measure the aesthetic quality of the graph layou...

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

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