Tabu Search for the Single Row Facility Layout Problem Using Exhaustive 2-Opt and Insertion Neighborhoods [PDF]
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard.
Ghosh, Diptesh, Kothari, Ravi
core
Using tabu search and genetic algorithms in mathematics research [PDF]
, 2004 This paper discusses an ongoing project which uses computational heuristic search techniques such as tabu search and genetic algorithms as a tool for mathematics research.
Johnson, Colin G.
core
Implementing Tabu Search to Exploit Sparsity in ATSP Instances [PDF]
Real life traveling salesman problem (TSP) instances are often large,sparse, and asymmetric. Conventional tabu search implementations for the TSP that have been reported in the literature, almost always deals with small, dense and symmetric instances. In
Ghosh, Diptesh +2 more
core
Otimização de leiaute usando busca tabu Facility layout optimization using tabu search
Gestão & Produção, 1997 A busca por leiautes de facilidades de alta qualidade pode ser vista como um problema de otimização combinatória que surge numa grande variedade de contextos de planejamento espacial.
João Carlos Furtado +1 more
doaj +1 more source
A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Ghosh, Diptesh, Sumanta Basu
core
A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments [PDF]
, 2004 The efficient scheduling of independent computational jobs in a heterogeneous computing (HC) environment is an important problem in domains such as grid computing.
Levine, J., Ritchie, G.
core
Annals of Operations Research, 2006 The setting could have come from a Hollywood science fiction movie. A dozen figures, a handful in uniforms of the U.S. Strategic Air Command (SAC) and a slightly larger contingent variously in business suits and in shirtsleeves, were gathered around a large mainframe computer whose blinking lights signaled a run in progress.
openaire +1 more source
Design of Sensor Networks for Chemical Plants Based on Meta-Heuristics
Algorithms, 2009 In this work the optimal design of sensor networks for chemical plants is addressed using stochastic optimization strategies. The problem consists in selecting the type, number and location of new sensors that provide the required quantity and quality of
Mabel C. Sánchez +2 more
doaj +1 more source
TABU SEARCH SEBAGAI LOCAL SEARCH PADA ALGORITMA ANT COLONY UNTUK PENJADWALAN FLOWSHOP
Jurnal Teknik Industri, 2009 Ant colony optimization (ACO) is one of the meta-heuristic methods developed for finding solutions to optimization problems such as scheduling. Local search method is one part of the ACO which determines the quality of the resulting solution.
Iwan Halim Sahputra +2 more
doaj
An improved hybrid optimization algorithm for the quadratic assignment problem
Mathematical Modelling and Analysis, 2004 In this paper, we present an improved hybrid optimization algorithm, which was applied to the hard combinatorial optimization problem, the quadratic assignment problem (QAP).
A. Misevičius
doaj +1 more source