### 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 language | English |
---|---|

Title of host publication | ICAART 2018 - Proceedings of the 10th International Conference on Agents and Artificial Intelligence |

Editors | Jaap van den Herik, Ana Paula Rocha |

Publisher | SciTePress |

Pages | 37-47 |

Number of pages | 11 |

ISBN (Electronic) | 9789897582752 |

Publication status | Published - Jan 1 2018 |

Event | 10th International Conference on Agents and Artificial Intelligence, ICAART 2018 - Funchal, Madeira, Portugal Duration: Jan 16 2018 → Jan 18 2018 |

### Publication series

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

Volume | 1 |

### Other

Other | 10th International Conference on Agents and Artificial Intelligence, ICAART 2018 |
---|---|

Country | Portugal |

City | Funchal, Madeira |

Period | 1/16/18 → 1/18/18 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Control and Systems Engineering
- Artificial Intelligence

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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.

}

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 -