scholar.google.com › citations
Distributed localized bi-objective search - ScienceDirect
www.sciencedirect.com › article › abs › pii
In this paper, we describe a new simple and effective generic scheme dedicated to bi-objective heuristic search in distributed/parallel environments. Our ...
Dec 16, 2014 · A new distributed heuristic approach is designed for approximating the Pareto set of bi-objective optimization problems (DLBS).
Feb 15, 2024 · PDF | We propose a new distributed heuristic for approximating the Pareto set of bi-objective optimization problems.
We propose a new distributed heuristic for approximating the Pareto set of bi-objective optimization problems. Our approach is at the crossroads of parallel ...
Sep 10, 2021 · The proposed distributed localized bi-objective search (Dlbs) algorithm is illustrated in the high-level pseudo-code of Algorithm 1 ...
We propose a new distributed heuristic for approximating the Pareto set of bi-objective optimization problems. Our approach is at the crossroads of parallel ...
We propose a new distributed heuristic for approximating the Pareto set of bi-objective optimization problems. Our approach is at the crossroads of parallel ...
People also ask
What is an example of a local search algorithm?
What is multi-objective algorithm?
May 31, 2020 · To solve this problem, we propose a distributed-elite local search based on a genetic algorithm that uses local improvement strategies based on ...
Missing: localized | Show results with:localized
Feb 16, 2022 · This paper proposes a novel workflow to solve bi-objective optimization problems using the distributed quasi-Newton (DQN) method, which is a ...
Missing: localized | Show results with:localized
We analyze the effects of including local search techniques into a multi-objective evolutionary algorithm for solving a bi-objective orienteering problem ...
Missing: localized | Show results with:localized