Results 41 to 50 of about 64,576 (188)
Jurnal Teknik Industri, 2006 The focus of this research is to solve a complex problem through the system approach. As a study case, we tried to minimize the production time at furniture industry using the appropriate process scheduling.
Natalia Sofyan +2 more
doaj
A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem
IEEE Access, 2021 The minimum weight vertex cover problem (MWVCP) is a fundamental combinatorial optimization problem with various real-world applications. The MWVCP seeks a vertex cover of an undirected graph such that the sum of the weights of the selected vertices is ...
Yang Wang, Zhipeng Lu, Abraham P. Punnen
doaj +1 more source
Heuristics for the traveling repairman problem with profits [PDF]
, 2010 In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists of maximizing the total collected revenue.
Dewilde, Thijs +4 more
core +1 more source
Comparative Performance of Tabu Search and Simulated Annealing Heuristics for the Quadratic Assignment Problem [PDF]
, 2010 For almost two decades the question of whether tabu search (TS) or simulated annealing (SA) performs better for the quadratic assignment problem has been unresolved.
Paul, Gerald
core +1 more source
ITERATED TABU SEARCH: AN IMPROVEMENT TO STANDARD TABU SEARCH
Information Technology And Control, 2006 The goal of this paper is to discuss the tabu search (TS) meta-heuristic and its enhancement for combinatorial optimization problems. Firstly, the issues related to the principles and specific features of the standard TS are concerned. Further, a promising extension to the classical tabu search scheme is introduced. The most important component of this
Alfonsas Misevicius +2 more
openaire +2 more sources
TABU SEARCH MODEL SELECTION FOR SVM [PDF]
International Journal of Neural Systems, 2008 A model selection method based on tabu search is proposed to build support vector machines (binary decision functions) of reduced complexity and efficient generalization. The aim is to build a fast and efficient support vector machines classifier. A criterion is defined to evaluate the decision function quality which blends recognition rate and the ...
Lebrun, Gilles +3 more
openaire +3 more sources
Design and research of automated warehouse simulation platform based on virtual visualization framework [PDF]
PeerJ Computer ScienceThe automated storage and retrieval system (AS/RS) has been developed rapidly and has been widely used in various fields. To achieve the ultimate goal of improving the efficiency of warehouse operation, this article studies the problem of goods location-
Huajun Di
doaj +2 more sources
Identification of Partial Shading Conditions for Photovoltaic Strings
IEEE Access, 2020 Under partial shading conditions (PSC), the power-voltage (P-V) characteristic curve of photovoltaic (PV) strings exhibits multiple peaks. Such mismatching phenomenon brings challenges in controlling the output power.
Ziqiang Bi +5 more
doaj +1 more source
Combining solutions of the optimum satisfiability problem using evolutionary tunneling
Mendel, 2020 The optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true.
Rodrigo Ferreira da Silva +2 more
doaj +1 more source
Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
International Journal of Industrial Engineering and Production Research, 2010 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 ...
M. Yaghini, N. Ghazanfari
doaj +2 more sources