Preference Guided Iterated Pareto Referent Optimisation for Accessible Route Planning

Paolo Speziali, Arno De Greef, Mehrdad Asadi, Willem Röpke, Ann Nowé +1 more
4/1/2026
cs.AIcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

We propose the Preference Guided Iterated Pareto Referent Optimisation (PG-IPRO) for urban route planning for people with different accessibility requirements and preferences. With this algorithm the user can interact with the system by giving feedback on a route, i.e., the user can say which objective should be further minimized, or conversely can be relaxed. This leads to intuitive user interaction, that is especially effective during early iterations compared to information-gain-based interaction. Furthermore, due to PG-IPRO's iterative nature, the full set of alternative, possibly optimal policies (the Pareto front), is never computed, leading to higher computational efficiency and shorter waiting times for users.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{speziali2026preference,
  title  = {Preference Guided Iterated Pareto Referent Optimisation for Accessible Route Planning},
  author = {Paolo Speziali and Arno De Greef and Mehrdad Asadi and Willem Röpke and Ann Nowé and Diederik M. Roijers},
  year   = {2026},
  eprint = {2604.00795},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2604.00795v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2604.00795.svg)](https://codeofpaper.com/paper/2604.00795)

Discussion