Study of route optimization considering bottlenecks and fairness among partial paths

Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Route optimization is an important problem for single agents and multi-agent systems. In route optimization tasks, the considered challenges generally belong to the family of shortest path problems. Such problems are solved using optimization algorithms, such as the A∗algorithm, which is based on tree search and dynamic programming. In several practical cases, cost values should be as evenly minimized for individual parts of paths as possible. These situations are also considered as multi-objective problems for partial paths. Since dynamic programming approaches are employed for the shortest path problems, different types of criteria which can be decomposed with dynamic programming might be applied to the conventional solution methods. For this class of problems, we employ a leximax-based criterion, which considers the bottlenecks and unfairness among the cost values of partial paths. This criterion is based on a similar criterion called leximin for multiobjective maximization problems. It is also generalized for objective vectors which have variable lengths. We address an extension of the conventional A∗search algorithm and investigate an issue concerning on-line search algorithms. The influence of the proposed approach is experimentally evaluated.

Original languageEnglish
Title of host publicationICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence
EditorsJaap van den Herik, Ana Paula Rocha
PublisherSciTePress
Pages37-47
Number of pages11
ISBN (Electronic)9789897582752
Publication statusPublished - Jan 1 2018
Event10th International Conference on Agents and Artificial Intelligence, ICAART 2018 - Funchal, Madeira, Portugal
Duration: Jan 16 2018Jan 18 2018

Publication series

NameICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence
Volume1

Other

Other10th International Conference on Agents and Artificial Intelligence, ICAART 2018
CountryPortugal
CityFunchal, Madeira
Period1/16/181/18/18

Fingerprint

Dynamic programming
Multi agent systems
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence

Cite this

Matsui, T., Silaghi, M., Hirayama, K., Yokoo, M., & Matsuo, H. (2018). Study of route optimization considering bottlenecks and fairness among partial paths. In J. van den Herik, & A. P. Rocha (Eds.), ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence (pp. 37-47). (ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence; Vol. 1). SciTePress.

Study of route optimization considering bottlenecks and fairness among partial paths. / Matsui, Toshihiro; Silaghi, Marius; Hirayama, Katsutoshi; Yokoo, Makoto; Matsuo, Hiroshi.

ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence. ed. / Jaap van den Herik; Ana Paula Rocha. SciTePress, 2018. p. 37-47 (ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence; Vol. 1).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matsui, T, Silaghi, M, Hirayama, K, Yokoo, M & Matsuo, H 2018, Study of route optimization considering bottlenecks and fairness among partial paths. in J van den Herik & AP Rocha (eds), ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence. ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence, vol. 1, SciTePress, pp. 37-47, 10th International Conference on Agents and Artificial Intelligence, ICAART 2018, Funchal, Madeira, Portugal, 1/16/18.
Matsui T, Silaghi M, Hirayama K, Yokoo M, Matsuo H. Study of route optimization considering bottlenecks and fairness among partial paths. In van den Herik J, Rocha AP, editors, ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence. SciTePress. 2018. p. 37-47. (ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence).
Matsui, Toshihiro ; Silaghi, Marius ; Hirayama, Katsutoshi ; Yokoo, Makoto ; Matsuo, Hiroshi. / Study of route optimization considering bottlenecks and fairness among partial paths. ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence. editor / Jaap van den Herik ; Ana Paula Rocha. SciTePress, 2018. pp. 37-47 (ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence).
@inproceedings{ff971133d44f4daaabd1dba0eb021660,
title = "Study of route optimization considering bottlenecks and fairness among partial paths",
abstract = "Route optimization is an important problem for single agents and multi-agent systems. In route optimization tasks, the considered challenges generally belong to the family of shortest path problems. Such problems are solved using optimization algorithms, such as the A∗algorithm, which is based on tree search and dynamic programming. In several practical cases, cost values should be as evenly minimized for individual parts of paths as possible. These situations are also considered as multi-objective problems for partial paths. Since dynamic programming approaches are employed for the shortest path problems, different types of criteria which can be decomposed with dynamic programming might be applied to the conventional solution methods. For this class of problems, we employ a leximax-based criterion, which considers the bottlenecks and unfairness among the cost values of partial paths. This criterion is based on a similar criterion called leximin for multiobjective maximization problems. It is also generalized for objective vectors which have variable lengths. We address an extension of the conventional A∗search algorithm and investigate an issue concerning on-line search algorithms. The influence of the proposed approach is experimentally evaluated.",
author = "Toshihiro Matsui and Marius Silaghi and Katsutoshi Hirayama and Makoto Yokoo and Hiroshi Matsuo",
year = "2018",
month = "1",
day = "1",
language = "English",
series = "ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence",
publisher = "SciTePress",
pages = "37--47",
editor = "{van den Herik}, Jaap and Rocha, {Ana Paula}",
booktitle = "ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence",

}

TY - GEN

T1 - Study of route optimization considering bottlenecks and fairness among partial paths

AU - Matsui, Toshihiro

AU - Silaghi, Marius

AU - Hirayama, Katsutoshi

AU - Yokoo, Makoto

AU - Matsuo, Hiroshi

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Route optimization is an important problem for single agents and multi-agent systems. In route optimization tasks, the considered challenges generally belong to the family of shortest path problems. Such problems are solved using optimization algorithms, such as the A∗algorithm, which is based on tree search and dynamic programming. In several practical cases, cost values should be as evenly minimized for individual parts of paths as possible. These situations are also considered as multi-objective problems for partial paths. Since dynamic programming approaches are employed for the shortest path problems, different types of criteria which can be decomposed with dynamic programming might be applied to the conventional solution methods. For this class of problems, we employ a leximax-based criterion, which considers the bottlenecks and unfairness among the cost values of partial paths. This criterion is based on a similar criterion called leximin for multiobjective maximization problems. It is also generalized for objective vectors which have variable lengths. We address an extension of the conventional A∗search algorithm and investigate an issue concerning on-line search algorithms. The influence of the proposed approach is experimentally evaluated.

AB - Route optimization is an important problem for single agents and multi-agent systems. In route optimization tasks, the considered challenges generally belong to the family of shortest path problems. Such problems are solved using optimization algorithms, such as the A∗algorithm, which is based on tree search and dynamic programming. In several practical cases, cost values should be as evenly minimized for individual parts of paths as possible. These situations are also considered as multi-objective problems for partial paths. Since dynamic programming approaches are employed for the shortest path problems, different types of criteria which can be decomposed with dynamic programming might be applied to the conventional solution methods. For this class of problems, we employ a leximax-based criterion, which considers the bottlenecks and unfairness among the cost values of partial paths. This criterion is based on a similar criterion called leximin for multiobjective maximization problems. It is also generalized for objective vectors which have variable lengths. We address an extension of the conventional A∗search algorithm and investigate an issue concerning on-line search algorithms. The influence of the proposed approach is experimentally evaluated.

UR - http://www.scopus.com/inward/record.url?scp=85047776599&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85047776599&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85047776599

T3 - ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence

SP - 37

EP - 47

BT - ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence

A2 - van den Herik, Jaap

A2 - Rocha, Ana Paula

PB - SciTePress

ER -