Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem - Topics in Theoretical Computer Science Access content directly
Conference Papers Year : 2016

Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem

Abstract

k-median and k-center are two well-known problems in facility location which play an important role in operation research, management science, clustering and computational geometry. To the best of our knowledge, although these problems have lots of applications, they have never been studied together simultaneously as a multi objective optimization problem. Multi-objective optimization has been applied in many fields of science where optimal decisions need to be taken in the presence of trade-offs between two or more conflicting objectives. In this paper we consider 1-median and 1-center two-objective optimization problem. We prove that $\varOmega (n\log {n})$ is a lower bound for proposed problem in one and two dimensions in Manhattan metric. Also, by using the properties of farthest point Voronoi diagram, we present a deterministic algorithm which output the Pareto Front and Pareto Optimal Solutions in $\mathcal {O}(n\log {n})$.
Fichier principal
Vignette du fichier
385217_1_En_12_Chapter.pdf (556.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01446259 , version 1 (25-01-2017)

Licence

Attribution

Identifiers

Cite

Vahid Roostapour, Iman Kiarazm, Mansoor Davoodi. Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem. 1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.164-178, ⟨10.1007/978-3-319-28678-5_12⟩. ⟨hal-01446259⟩
61 View
90 Download

Altmetric

Share

Gmail Facebook X LinkedIn More