× خانه ژورنال ها پست ها ثبت نام ورود

نتایج جستجو برای Tabu Search Algorithm

تعداد نتایج: 771396  
N. Ghazanfari, M. Yaghini,

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

2013
Wojciech Chmiel, Piotr Kadluczka, Joanna Kwiecien, Boguslaw Filipowicz, Przemyslaw Pukocz,

In this paper we introduce a method for optimisation of strategic tasks using an approximation algorithm. We propose the mathematical model and algorithm for solving this problem near optimality. An overall motivation for the development of the proposed algorithm is discussed with detailed e ciency analysis. From the end users' perspective the proposed method has practical application because i...

Journal: :Computers & Chemical Engineering 2004
B. Lin, D. C. Miller,

This paper presents a meta-heuristic optimization algorithm, Tabu Search (TS), and describes how it can be used to solve a wide variety of chemical engineering problems. Modifications to the original algorithm and constraint handling techniques are described and integrated to extend its applicability. All components of TS are described in detail. Initial values for each key parameter of TS are ...

Journal: :CoRR 2014
Andy M. Connor,

Abstract This paper describes a novel refinement to a Tabu search algorithm that has been implemented in an attempt to improve the robustness of the search when applied to particularly complex problems. In this approach, two Tabu searches are carried out in parallel. Each search thread is characterised by it's own short term memory which forces that point out of local optima. However, the two s...

2006
J. Nibecker, D. Taylor, R. Chambers, H. Larsen, K. Cudworth, C. Warren, J. Pohl,

Military deployment and distribution responsibilities call for intelligent collaborative tools in support of strategic and operational planning functions involving the sustainment and movement of military forces. The sustainment requirement is generated at the operational level and is dynamic. It is composed of shifting priorities responding to changes in commander’s intent and changes in the o...

2002
M. A. ABIDO,

This paper presents an e cient and reliable tabu search (TS)–based approach to solve the optimal power ow (OPF) problem. The proposed approach employs TS algorithm for optimal settings of the control variables of the OPF problem. Incorporation of TS as a derivative-free optimization technique in solving OPF problem signiŽcantly reduces the computational burden. One of the main advantages of T...

2010
Tatsuya Hirokata, Masataka Tokumaru, Noriaki Muranaka,

We propose an interactive tabu search (ITS) to be used for the development support of a product that fits a human’s feeling. Interactive evolutionary computation (IEC) is one of the technologies used in the development support of products that fit a human’s feeling using a computer and person undergoing a communication. The interactive generic algorithm (IGA) is generally used in the IEC. A maj...

1999
Fred Glover, Manuel Laguna,

This article explores the meta-heuristic approach called tabu search, which is dramatically changing our ability to solve a host of problems in applied science, business and engineering. Tabu search has important links to evolutionary and “genetic” methods, often overlooked, through its intimate connection with scatter search and path relinking — evolutionary procedures that have recently attra...

Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...

D. Rahmani, , M. Saidi-Mehrabad, , R. Ramezanian, ,

Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...