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

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

2002
Daniel A. Finke, D. J. Medeiros, Mark T. Traband,

An important goal in scheduling products through a manufacturing facility is to assure that the work is completed as close as possible to its due date. Work that is late creates downstream delays, while early completion can be detrimental if storage space is limited. This paper reports initial results in developing a scheduling procedure for an automated steel plate fabrication facility. The ap...

Journal: :JDIM 2005
Ahamad Tajudin Abdul Khader, Ang Siew See,

A feasible exam timetable is generated using a method based on constraint satisfaction and heuristics. We investigate the usage of tabu search to further improve the quality of the exam timetable. Different length of short term tabu list and the long term tabu list is examined. Short term tabu list without long term tabu list and vice versa is also tested. Different search iteration based on ma...

1997
Michael Pilegaard Hansen,

This paper presents the multiobjective tabu search method, MOTS. Being an adaptation of the well known tabu search, it is used heuristically to generate non-dominated alternatives to multiobjective combinatorial optimization problems. MOTS works with a set of current solutions which, through manipulation of weights, are optimized towards the nondominated frontier while at the same time seek to ...

Journal: :APJOR 2013
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz,

Tabu Search (TS) has always been a very popular algorithm for graph coloring, both as a stand-alone optimizer as well as a subroutine inside population-based hybrid methods. We present two TS extensions that could allow previous TS algorithms to improve their behavior at almost no additional computational cost. First, we integrate two new evaluation functions which employ supplementary (structu...

1990
Fred Glover,

This paper examines some of the characteristics of Al-based heuristic procedures that have emerged as frameworks for solving difficult optimization problems. Consideration of attributes shared to some degree by human prohlem solvers leads to focusing in greater detail on one of the more -ituccessful procedures, tabu search, which employs a flexible memory system (in contrast to 'memoryless^ sys...

Journal: :European Journal of Operational Research 2006
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano,

Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to solve large scale problems, softwares implementing simple heuristics are still the most commonly used tools in industry. Some metaheuristics have also been proposed and shown to improve on classical heuristics but, to ou...

Journal: :Pattern Recognition 2002
Hongbin Zhang, Guangyu Sun,

Selecting an optimal subset from original large feature set in the design of pattern classi"er is an important and di$cult problem. In this paper, we use tabu search to solve this feature selection problem and compare it with classic algorithms, such as sequential methods, branch and boundmethod, etc., and most other suboptimal methods proposed recently, such as genetic algorithm and sequential...

2005
João Pedro Pedroso, Mikio Kubo,

This paper presents a hybrid tabu search strategy for lot sizing problems. This strategy allows the exploitation of the quality of the well-known relax-and-fix heuristic, inside a tabu search framework which enforces diversity. The computational results show an advantage of this strategy when compared to a version of the relax-and-fix heuristic and to time constrained branch-and-bound.

Journal: :European Journal of Operational Research 2004
Maria da Conceição Cunha, Luisa Ribeiro,

In this paper we propose a tabu search algorithm to find the least-cost design of looped water distribution networks. The mathematical nature of this optimization problem, a nonlinear mixed integer problem, is at the origin of a multitude of contributions to the literature in the last 25 years. In fact, exact optimization methods have not been found for this type of problem, and, in the past, c...

Journal: :Computers & Chemical Engineering 2005
Bao Lin, Sunitha Chavali, Kyle V. Camarda, David C. Miller,

A detailed implementation of the Tabu Search (TS) algorithm for computer-aided molecular design (CAMD) of transition metal catalysts is presented in this paper. Previous CAMD research has applied deterministic methods or genetic algorithms to the solution of the optimization problems which arise from the search for a molecule satisfying a set of property targets. In this work, properties are es...

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

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