Results 31 to 40 of about 3,220 (157)

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem

open access: yesIEEE 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

Tabu search—Uncharted domains

open access: yesAnnals 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 and research of automated warehouse simulation platform based on virtual visualization framework [PDF]

open access: yesPeerJ Computer Science
The 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

open access: yesIEEE 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

A user's guide to tabu search [PDF]

open access: yesAnnals of Operations Research, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Glover, Fred   +2 more
openaire   +1 more source

Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach

open access: yesInternational 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

Combining solutions of the optimum satisfiability problem using evolutionary tunneling

open access: yesMendel, 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

Análisis de proximidades métrico usando búsqueda tabú

open access: yesRevista de Matemática: Teoría y Aplicaciones, 2009
We apply tabu search (TS) in metric multidimensional scaling, obtaining good results comparable to those obtained with simulated annealing. A state in TS is a configuration of n points in a p dimensional space, and a neighbour is defined by the ...
Mario A. Villalobos   +1 more
doaj   +1 more source

Feature Selection Using Tabu Search with Learning Memory: Learning Tabu Search [PDF]

open access: yes, 2016
Feature selection in classification can be modeled as a com-binatorial optimization problem. One of the main particularities of this problem is the large amount of time that may be needed to evaluate the quality of a subset of features. In this paper, we propose to solve this problem with a tabu search algorithm integrating a learning mechanism.
Mousin, Lucien   +3 more
openaire   +2 more sources

Ship Collision Avoidance by Distributed Tabu Search [PDF]

open access: yesTransNav, 2015
More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical.
Dong-Gyun Kim   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy