نتایج جستجو برای: tucker conditions tabu search algorithm

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

Journal: :journal of advances in computer research 0

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

Journal: :Computers & Industrial Engineering 2011
Nilgün Fescioglu-Ünver Mieczyslaw M. Kokar

This paper addresses the application of the principles of feedback and self-controlling software to the tabu search algorithm. We introduce two new reaction strategies for the tabu search algorithm. The first strategy treats the tabu search algorithm as a target system to be controlled and uses a control-theoretic approach to adjust the algorithm parameters that affect search intensification. T...

Journal: :International Journal of Advanced Research in Artificial Intelligence 2014

N Salmasi

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

Journal: :journal of optimization in industrial engineering 2012
ragheb rahmaniani abdosalam ghaderi mohammad saidi mehrabad

in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...

2001
Christopher R. Houck Jeffrey A. Joines Michael G. Kay

A large number of heuristic search algorithms are available for function optimization. Each of these heuristics, e.g., simulated annealing, genetic algorithms, tabu search, etc., has been shown to be effective at finding good solutions efficiently. However, little work has been directed at determining what are the important problem characteristics for which one algorithm is more efficient than ...

Journal: :Electric Power Components and Systems 2002

Journal: :J. Intelligent Manufacturing 2013
Miguel A. González Camino R. Vela Inés González Rodríguez Ramiro Varela

We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search...

The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...

In this paper, a (photovoltaic-wind-battery) hybrid system is designed to provide a network-independent pattern. The purpose of this paper is to provide the necessary energy and minimize production total costs over the life of the system. By using a new algorithm called "particle swarm optimization algorithm with constriction factor", which has advantages like high convergence speed, the optima...

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

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