loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Authors: Jaroslav Janáček and Marek Kvet

Affiliation: University of Žilina, Faculty of Management Science and Informatics, Univerzitná 8215/1, 010 26 Žilina, Slovak Republic

Keyword(s): Discrete Location Problems, Conflicting Criteria, Pareto Frontier Approximation, Ant Colony.

Abstract: The Pareto frontier of multi-objective problem solutions denotes the unique exact solution to a problem with two or more equivalent objectives. Even when the number of problem solutions is finite, determining the precise Pareto frontier is a difficult task. Different metaheuristics can therefore provide a user with a decent approximation of the Pareto frontier in a reasonable amount of time, whereas the exact computational time-intensive approaches cannot. The acceptable computational time of metaheuristics counterbalances a solution’s deviation from the Pareto frontier. This contribution describes one of a spectrum of metaheuristics implemented with the objective of locating non-dominated solutions to the public service system design problem involving two competing criteria. The metaheuristic minimizes the difference between the present set of non-dominated solutions and the Pareto front by applying the ant colony optimization principle. A series of numerical experiments with benchm arks for which the exact Pareto frontiers are known are used to evaluate the efficacy of the proposed metaheuristic. Even though the proposed method is applicable anywhere, the used dataset comes from an Emergency Medical Service system in Slovakia, which belongs to the generally known wide class of public service systems. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.15.144.75

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Janáček, J. and Kvet, M. (2024). Pareto Front Approximation by Ant Colony Optimization. In Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-758-681-1; ISSN 2184-4372, SciTePress, pages 200-206. DOI: 10.5220/0012262900003639

@conference{icores24,
author={Jaroslav Janáček. and Marek Kvet.},
title={Pareto Front Approximation by Ant Colony Optimization},
booktitle={Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - ICORES},
year={2024},
pages={200-206},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012262900003639},
isbn={978-989-758-681-1},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of the 13th International Conference on Operations Research and Enterprise Systems - ICORES
TI - Pareto Front Approximation by Ant Colony Optimization
SN - 978-989-758-681-1
IS - 2184-4372
AU - Janáček, J.
AU - Kvet, M.
PY - 2024
SP - 200
EP - 206
DO - 10.5220/0012262900003639
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic