Journal of Information Processing
Online ISSN : 1882-6652
ISSN-L : 1882-6652
 
A Subtour Elimination Constraint for Non-simpl e Circuit Problems
Seiji Kataoka
Author information
JOURNAL FREE ACCESS

2024 Volume 32 Pages 346-351

Details
Abstract

In various problems on graphs to find the optimal path or circuit, feasible solutions are normally assumed to be simple. In reality, however, one-way or return roads, bridges connecting enclaves, etc. often lead to multiple passes through the same points or roads, i.e. a non-simple path or circuit. The difficulty in considering a non-simple path or circuit is that conventional subtour elimination constraints are of no use. Taking the orienteering problem as a target, we newly develop a subtour elimination constraint that works directly against non-simple type problems, and show its effectiveness in computational experiments.

Content from these authors
© 2024 by the Information Processing Society of Japan
Previous article Next article
feedback
Top