نتایج جستجو برای: tabu search
تعداد نتایج: 295057 فیلتر نتایج به سال:
This paper investigates the capabilities of tabu search for solving the global path planning problem in grid maps. Accordingly, a tabu search system model is designed and a tabu search planner algorithm for solving the path planning problem is proposed. A comprehensive simulation study is conducted using the proposed model and algorithm, in terms of solution quality and execution time. A compar...
In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequenceand machinedependent setup times to minimize the schedule’s makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm...
We describe a tabu search approach to the scheduling problem of minimizing the makespan on n tasks on m equivalent processors. This problem is isomorphic to a variant of the multiple bin packing problem. We make use of a candidate list strategy that generates only a small subset of all possible moves, and employ a dynamic tabu list for handling tabu restrictions. We also introduce an innuential...
This paper presents a packing algorithm to solve an irregular shape strip packing problem. The polygons are packed in strip material, which limits a bin width but not limits a bin length. The objective of a packing algorithm is to minimize a bin length. This paper proposes a hybrid method of genetic algorithms and tabu search to solve a packing problem. Initially, a hybrid method behaves like r...
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 ...
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical results indicate that the proposed TS implementation outperforms other metaheuristic methods, including Simulated Annealing, a previous version of Tabu Search and a recent implementation of a Greedy Randomized Adaptive Searc...
This paper describes the application of tabu search, a recent heuristic technique for combinatorial optimization problems, to the assembly line balancing problems. Computational experiments with different search strategies have been performed for some assembly ine problems from literature. Computational results show that except for few cases tabu search always finds optimal solutions.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید