Solving an MO-DCOP is to find the Pareto front which is a set of cost vectors obtained by Pareto optimal solutions. In MO-DCOPs, even if a constraint graph has ...

Abstract. Many real world optimization problems involve multiple cri- teria that should be considered separately and optimized simultaneously.

A novel approximate MO-DCOP algorithm called Distributed Iterated Pareto Local Search (DIPLS) is developed and empirically show that DIPLS outperforms the ...

Solving an MO-DCOP is to find the Pareto front which is a set of cost vectors obtained by Pareto optimal solutions. In MO-DCOPs, even if a constraint graph has ...

Moreover, our continuous version of CoCoA, which we call C-CoCoA, is an approximate local search algorithm that can solve C-DCOPs without any restriction on ...

Local search based approximate algorithm for Multi-Objective DCOPs. M Wack, T Okimoto, M Clement, K Inoue. PRIMA 2014: Principles and Practice of Multi-Agent ...

In this paper, we propose a novel approximation MO-DCOP algorithm called Distributed Pareto Local Search (DPLS) that uses a local search approach to find an ...

The comparative experiments are conducted on six instances from the real-life MOSCC problems, and the results show that ELSrank performs better than other start ...

Distributed Pareto Local Search Algorithm In this section, we propose a novel approximation algorithm for MO-DCOPs called Distributed Pareto Local Search (DPLS) ...

Dec 1, 2017 · In this paper, we propose a novel approximation MO-DCOP algorithm called Distributed Pareto Local Search (DPLS) that uses a local search ...