A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem
Sign Up to like & getrecommendations! Published in 2018 at "Networks"
DOI: 10.1002/net.21827
Abstract: Funding information Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq/Brazil), Grant/Award Number: 132610/2014-0, 132789/2015-9, 305223/2015-1, 428549/2016-0, GDE 201222/2014-0 Abstract This article deals with the bi-objective pollution-routing problem (bPRP), a vehicle routing variant that arises in… read more here.
Keywords: phase; local search; pareto local; pareto ... See more keywords
Local search methods for the solution of implicit inverse problems
Sign Up to like & getrecommendations! Published in 2018 at "Soft Computing"
DOI: 10.1007/s00500-017-2670-z
Abstract: In this paper, we propose two local search algorithms based on the Tabu Search and the Simulated Annealing methods, respectively, for the solution of implicit inverse problems. In general, the proposed methods work as follows:… read more here.
Keywords: search; local search; solution implicit; inverse ... See more keywords
Deep CNN with Hybrid Binary Local Search and Particle Swarm Optimizer for Exudates Classification from Fundus Images
Sign Up to like & getrecommendations! Published in 2022 at "Journal of Digital Imaging"
DOI: 10.1007/s10278-021-00534-2
Abstract: Diabetic retinopathy is a chronic condition that causes vision loss if not detected early. In the early stage, it can be diagnosed with the aid of exudates which are called lesions. However, it is arduous… read more here.
Keywords: cnn; classification; particle swarm; binary local ... See more keywords
A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems
Sign Up to like & getrecommendations! Published in 2020 at "Annals of Operations Research"
DOI: 10.1007/s10479-019-03159-5
Abstract: Given a graph G(V, E) and a value $$s \in {\mathbb {N}}$$s∈N, an s-plex S is a subset of V such that each vertex $$v \in S$$v∈S has at least $$|S|-s$$|S|-s adjacent vertices in the subgraph… read more here.
Keywords: gpu based; local search; algorithm unweighted; based local ... See more keywords
Utilizing the advantages of both global and local search strategies for finding a small subset of features in a two-stage method
Sign Up to like & getrecommendations! Published in 2018 at "Applied Intelligence"
DOI: 10.1007/s10489-018-1159-5
Abstract: Feature selection (FS) is one of the pre-processing methods that are widely used in the fields of Data Mining and Pattern Recognition. Elimination of redundant/irrelevant features of large data sets and finding a suitable feature… read more here.
Keywords: stage method; local search; search; two stage ... See more keywords
Parallel heuristic local search algorithm on OTIS hyper hexa-cell and OTIS mesh of trees optoelectronic architectures
Sign Up to like & getrecommendations! Published in 2018 at "Applied Intelligence"
DOI: 10.1007/s10489-018-1283-2
Abstract: Heuristic local search algorithms have achieved good results in tackling combinatorial optimization problems, such as Travelling Salesman Problem (TSP). One of the well-known local search algorithms is the 2-opt algorithm. As a local search algorithm,… read more here.
Keywords: heuristic local; algorithm; local search; optoelectronic architectures ... See more keywords
An adaptive GP-based memetic algorithm for symbolic regression
Sign Up to like & getrecommendations! Published in 2020 at "Applied Intelligence"
DOI: 10.1007/s10489-020-01745-w
Abstract: Symbolic regression is a process to find a mathematical expression that represents the relationship between a set of explanatory variables and a measured variable. It has become a best-known problem for GP (genetic programming), as… read more here.
Keywords: symbolic regression; local search; regression; based memetic ... See more keywords
Iterative local search for preserving data privacy
Sign Up to like & getrecommendations! Published in 2024 at "Applied Intelligence"
DOI: 10.1007/s10489-024-05909-w
Abstract: k-Anonymization is a popular approach for sharing datasets while preserving the privacy of personal and sensitive information. It ensures that each individual is indistinguishable from at least k-1 others in the anonymized dataset through data… read more here.
Keywords: information; privacy; local search; information loss ... See more keywords
Leveraging special-purpose hardware for local search heuristics
Sign Up to like & getrecommendations! Published in 2022 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-022-00354-2
Abstract: As we approach the physical limits predicted by Moore's law, a variety of specialized hardware is emerging to tackle specialized tasks in different domains. Within combinatorial optimization, adiabatic quantum computers, CMOS annealers, and optical parametric… read more here.
Keywords: special purpose; purpose hardware; optimization; hardware ... See more keywords
The spherical k-means++ algorithm via local search scheme
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-021-00737-x
Abstract: The spherical k-means problem (SKMP) is an important variant of the k-means clustering problem (KMP). In this paper, we consider the SKMP, which aims to divide the n points in a given data point set… read more here.
Keywords: local search; algorithm via; means algorithm; spherical means ... See more keywords
Multiobjective memetic algorithm based on adaptive local search chains for vehicle routing problem with time windows
Sign Up to like & getrecommendations! Published in 2019 at "Evolutionary Intelligence"
DOI: 10.1007/s12065-019-00224-7
Abstract: This paper presents a multiobjective memetic algorithm based on adaptive local search chains (MMA-ALSC) for vehicle routing problem with time window (VRPTW) which is an important research area in logistics. As shown in most previous… read more here.
Keywords: multiobjective memetic; problem; mma alsc; local search ... See more keywords