DeepAI AI Chat
Log In Sign Up

On the Constrained Least-cost Tour Problem

by   Patrick O'Hara, et al.
The Alan Turing Institute
University of Warwick

We introduce the Constrained Least-cost Tour (CLT) problem: given an undirected graph with weight and cost functions on the edges, minimise the total cost of a tour rooted at a start vertex such that the total weight lies within a given range. CLT is related to the family of Travelling Salesman Problems with Profits, but differs by defining the weight function on edges instead of vertices, and by requiring the total weight to be within a range instead of being at least some quota. We prove CLT is NP-hard, even in the simple case when the input graph is a path. We derive an informative lower bound by relaxing the integrality of edges and propose a heuristic motivated by this relaxation. For the case that requires the tour to be a simple cycle, we develop two heuristics which exploit Suurballe's algorithm to find low-cost, weight-feasible cycles. We demonstrate our algorithms by addressing a real-world problem that affects urban populations: finding routes that minimise air pollution exposure for walking, running and cycling in the city of London.


page 7

page 9

page 16

page 17


Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions

We consider the Shortest Odd Path problem, where given an undirected gra...

On Existence of Must-Include Paths and Cycles in Undirected Graphs

Given an undirected graph G=(V,E) and vertices s,t,w_1,w_2∈ V, we study ...

Asymptotic Optimality of the Greedy Patching Heuristic for Max TSP in Doubling Metrics

The maximum traveling salesman problem (Max TSP) consists of finding a H...

Tailored vertex ordering for faster triangle listing in large graphs

Listing triangles is a fundamental graph problem with many applications,...

Refined Hardness of Distance-Optimal Multi-Agent Path Finding

We study the computational complexity of multi-agent path finding (MAPF)...

Graph Balancing with Orientation Costs

Motivated by the classic Generalized Assignment Problem, we consider the...

Cost Sharing under Private Valuation and Connection Control

We consider a cost sharing problem on a weighted undirected graph, where...