Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.03326 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916777575841792 |
|---|---|
| author | Montemanni, Roberto Smith, Derek H. |
| author_facet | Montemanni, Roberto Smith, Derek H. |
| contents | A variant of the well-known Shortest Path Problem is studied in this paper, where pairs of conflicting arcs are provided, and for each conflicting pair a penalty is paid once neither or both of the arcs are selected. This configures a set of soft-constraints. The problem, which can be used to model real applications, looks for a path from a given origin to a given destination that minimizes the cost of the arcs traversed plus the penalties incurred. In this paper, we consider a compact mixed integer linear program representing the problem and we solve it with the open-source solver CP-SAT, part of the Google OR-Tools computational suite. An experimental campaign on the instances available from the literature indicates that the approach we propose achieves results comparable with those of state-of-the-art solvers, notwithstanding it is a compact model, while the other approaches require the generation of dynamic constraints in order for the models to be competitive. Some best-known results have been improved in this study, and some instances have been closed for the first time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_03326 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts Montemanni, Roberto Smith, Derek H. Optimization and Control A variant of the well-known Shortest Path Problem is studied in this paper, where pairs of conflicting arcs are provided, and for each conflicting pair a penalty is paid once neither or both of the arcs are selected. This configures a set of soft-constraints. The problem, which can be used to model real applications, looks for a path from a given origin to a given destination that minimizes the cost of the arcs traversed plus the penalties incurred. In this paper, we consider a compact mixed integer linear program representing the problem and we solve it with the open-source solver CP-SAT, part of the Google OR-Tools computational suite. An experimental campaign on the instances available from the literature indicates that the approach we propose achieves results comparable with those of state-of-the-art solvers, notwithstanding it is a compact model, while the other approaches require the generation of dynamic constraints in order for the models to be competitive. Some best-known results have been improved in this study, and some instances have been closed for the first time. |
| title | On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2506.03326 |