Filters








909 Hits in 5.2 sec

Genetic Tabu search for robust fixed channel assignment under dynamic traffic data

Hakim Mabed, Alexandre Caminada, Jin-Kao Hao
2010 Computational optimization and applications  
This algorithm combines a problem specific crossover and a Tabu search procedure. The proposed model and hybrid algorithm are evaluated using both artificial and real data.  ...  The contribution of this work is twofold. Firstly, we introduce a new channel assignment model for GSM radio networks.  ...  Acknowledgements We are grateful to the referees for their highly insightful comments and suggestions, which help us to improve the presentation of the paper.  ... 
doi:10.1007/s10589-010-9376-9 fatcat:4ex7gihijndjlhdmlzz576lcjy

Survey of Metaheuristic Algorithms for Combinatorial Optimization

Malti Baghel, Shikha Agrawal, Sanjay Silakari
2012 International Journal of Computer Applications  
Trajectory methods are those that deal with a single solution. These include simulated annealing, tabu search, variable neighborhood search and greedy randomized adaptive search procedure.  ...  Hybrid methods deal with the hybridization of single point search methods and population based methods. These are further categorized into five different types.  ...  Montemanni and Smith (2010) proposed an improved tabu search for solving frequency assignment problem.  ... 
doi:10.5120/9391-3813 fatcat:7ur2f64xvvb6jc4ojsd5jujfeq

Local-Search Based Heuristics for Advertisement Scheduling [article]

Mauro R. C. da Silva, Rafael C. S. Schouery
2021 arXiv   pre-print
This paper presents some algorithms based on meta-heuristics Greedy Randomized Adaptive Search Procedure (GRASP), Variable Neighborhood Search (VNS), Local Search, and Tabu Search for MAXSPACE and MAXSPACE-RDWV  ...  We compare our proposed algorithms with Hybrid-GA proposed by Kumar et al. (2006). We also create a version of Hybrid-GA for MAXSPACE-RDWV and compare it with our meta-heuristics for this problem.  ...  We compare our algorithms with Hybrid-GA, which is the state-of-the-art in heuristics for MAXS-PACE. Our best algorithms are VNS and GRASP + VNS, a GRASP version that uses VNS as a local search.  ... 
arXiv:2006.13432v3 fatcat:u5svrkmjrvhp3b5gro76ltotii

Makespan Minimization in Job Shop Scheduling

K. Sathya Sundari
2021 International Journal of Engineering and Management Research  
In this paper, we used an Improved Ant Colony Optimization and Tabu Search (ACOTS) algorithm to solve this problem by precisely defining the fault occurrence location in order to rollback.  ...  In industries, the completion time of job problems in the manufacturing unit has risen significantly.  ...  TABU SEARCH WITH JOB SHOP SCHEDULING Tabu is one of the heuristic search methods used for an improved solution.  ... 
doi:10.31033/ijemr.11.1.31 fatcat:cadoireyarej3eu2jy2rw4jwpi

Preface

César Rego
2010 Annals of Operations Research  
In several settings this has occurred by forming hybrids of other methods with tabu search, but it has also been brought about entirely independently as other metaheuristics, both well-established methods  ...  The vitality borne of this mix of ideas from multiple realms promises to expand the application of adaptive memory programming and to produce more effective strategies for complex optimization problems  ...  Computational tests on a wide range of problems show that the resulting tabu search and scatter search methods can compete with the most recent and best algorithms for matrix bandwidth minimization, in  ... 
doi:10.1007/s10479-010-0821-z fatcat:aspggi3zfndkfllezwjz46js74

A Tabu search heuristic for the generalized assignment problem

Juan A. Dı́az, Elena Fernández
2001 European Journal of Operational Research  
A Tabu search heuristic for the GAP is proposed. The algorithm uses recent and medium-term memory to dynamically adjust the weight of the penalty incurred for violating feasibility.  ...  This paper considers the generalized assignment problem (GAP).  ...  Acknowledgements Authors are grateful to the anonymous referees for their valuable comments which have helped to improve this paper.  ... 
doi:10.1016/s0377-2217(00)00108-9 fatcat:okfxuukydrf6lli7iiawx7giem

An annotated bibliography of GRASP-Part II: Applications

Paola Festa, Mauricio G. C. Resende
2009 International Transactions in Operational Research  
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  optimum in the neighborhood of the constructed solution is sought.  ...  A hybrid GRASP and tabu search heuristic is proposed for solving a school timetabling problem.  ... 
doi:10.1111/j.1475-3995.2009.00664.x fatcat:wdqwc6xvcnfq3fi5ujy6jy5wtm

Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges [chapter]

Fred Glover
1997 Operations Research/Computer Science Interfaces Series  
Tabu search (TS) has provided advances for solving difficult optimization problems in many domains.  ...  The goal of this paper is to focus on key themes that are given inadequate attention in many treatments of tabu search.  ...  Frequency measures for value assignments can be obtained by summing these solution vectors for problems with 0-1 representations and the critical event control mechanisms can then assure assignments are  ... 
doi:10.1007/978-1-4615-4102-8_1 fatcat:c2mxzmtf7zbxnftbgcy4o7rfoa

Parallel Local Search [chapter]

Philippe Codognet, Danny Munera, Daniel Diaz, Salvador Abreu
2018 Handbook of Parallel Constraint Reasoning  
Local search metaheuristics are a recognized means of solving hard combinatorial problems.  ...  This situation is further compounded by the good adequacy exhibited by this class of search procedures for large-scale parallel operation.  ...  He proposes a neighborhood decomposition strategy applied to the tabu search method for solving large instances of the Quadratic Assignment Problem.  ... 
doi:10.1007/978-3-319-63516-3_10 fatcat:ah7ngeucercjvbbo6qr757boq4

Grasp: An Annotated Bibliography [chapter]

Paola Festa, Mauricio G.C. Resende
2002 Operations Research/Computer Science Interfaces Series  
optimum in the neighborhood of the constructed solution is sought.  ...  A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  The new neighborhood structures defined allow cyclic exchanges of nodes among multiple subtrees simultaneously.  ... 
doi:10.1007/978-1-4615-1507-4_15 fatcat:kvaokik4m5a2bezgzzcfaqjbui

Tabu Search: A Comparative Study [chapter]

Harun Pirim, Engin Bayraktar, Burak Eksioglu
2008 Tabu Search  
Neighborhood functions can be generated based on the structure of the problem at hand.  ...  However, McMullen & Frazier (2000) dealt with the problem of mixed-model sequencing with multiple objectives on a just-in-time line. They used SA for solving the problem.  ...  The book' Chapters identify useful new implementations and ways to integrate and apply the principles of Tabu Search, to hybrid it with others optimization methods, to prove new theoretical results, and  ... 
doi:10.5772/5637 fatcat:taxjflzhebherlapwehn6d6ci4

Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem

Hugues Delmaire, Juan A. Díaz, Elena Fernández, Maruja Ortega
1999 INFOR. Information systems and operational research  
The Tabu Search heuristic provides the framework for the first of the hybrid approaches. It consists of two phases.  ...  The following algorithms are proposed: A Reactive GRASP heuristic; a Tabu Search heuristic; and two different hybrid approaches that combine elements of the GRASP and the Tabu Search methodologies.  ...  The Tabu Search algorithm for SSGRLR proposed here has the same two-phase structure as the TS procedure of Delmaire et al. (1997) .  ... 
doi:10.1080/03155986.1999.11732381 fatcat:44ogl2bawfeelawal7czvbjupq

Towards hybrid evolutionary algorithms

P Preux
1999 International Transactions in Operational Research  
We wish to explain the behavior of search algorithms with this knowledge and provide guidelines in the design of hybrid algorithms.  ...  Then, we discuss hybridization and present a general classification of the way hybridization can be conducted in the light of our knowledge of the structure of search spaces.  ...  A frequency memory stores information relative to all solutions visited during the tabu search.  ... 
doi:10.1016/s0969-6016(99)00019-2 fatcat:cr525zd6hvgg3gfe55642t5jsi

Towards hybrid evolutionary algorithms

P. Preux, E.-G. Talbi
1999 International Transactions in Operational Research  
We wish to explain the behavior of search algorithms with this knowledge and provide guidelines in the design of hybrid algorithms.  ...  Then, we discuss hybridization and present a general classification of the way hybridization can be conducted in the light of our knowledge of the structure of search spaces.  ...  A frequency memory stores information relative to all solutions visited during the tabu search.  ... 
doi:10.1111/j.1475-3995.1999.tb00173.x fatcat:axqcpomtujcx5fd23rsnwqo54m

Strategies for the Parallel Implementation of Metaheuristics [chapter]

Van-Dat Cung, Simone L. Martins, Celso C. Ribeiro, Catherine Roucairol
2002 Operations Research/Computer Science Interfaces Series  
Parallel implementations of metaheuristics appear quite naturally as an effective alternative to speed up the search for approximate solutions of combinatorial optimization problems.  ...  Parallel implementations of tabu search, GRASP, genetic algorithms, simulated annealing, and ant colonies are reviewed and discussed to illustrate the main strategies used in the parallelization of different  ...  Another parallel implementation of a tabu search algorithm for vehicle routing is reported in [184] . The neighborhood structure is based on simple customer shifts.  ... 
doi:10.1007/978-1-4615-1507-4_13 fatcat:syvr7spvynhntdp6ya44ntlimq
« Previous Showing results 1 — 15 out of 909 results