To fill or not to fill: the gas station problem

Authors:
Samir Khuller;Azarakhsh Malekian;Julián Mestre
Affiliations:
Department of Computer Science, University of Maryland, College Park, MD;Department of Computer Science, University of Maryland, College Park, MD;Department of Computer Science, University of Maryland, College Park, MD
Venue:
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Year:
2007

Citing 8
Cited 6

On the distance constrained vehicle routing problem

Operations Research
Resource-constrained geometric network optimization

Proceedings of the fourteenth annual symposium on Computational geometry
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen

SIAM Journal on Computing
Introduction to Algorithms

Introduction to Algorithms
Approximation Algorithms for Orienteering and Discounted-Reward TSP

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for deadline-TSP and vehicle routing with time-windows

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximations for minimum and min-max vehicle routing problems

Journal of Algorithms
Minimum vehicle routing with a common deadline

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

Finding Optimal Refueling Policies in Transportation Networks

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A decision support system of dynamic vehicle refueling

Decision Support Systems
Distributed Memory Bounded Path Search Algorithms for Pervasive Computing Environments

PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Approximation algorithms for distance constrained vehicle routing problems

Networks
A decision support system of vehicle routing and refueling for motor carriers with time-sensitive demands

Decision Support Systems
A variable-reduction technique for the fixed-route vehicle-refueling problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual cost in terms of gas prices. We have a vehicle with a given tank capacity. We assume that at each vertex gas may be purchased at a certain price. The objective is to find the cheapest route to go from s to t, or the cheapest tour visiting a given set of locations. Surprisingly, the problem of find the cheapest way to go from s to t can be solved in polynomial time and is not NP-complete. For most other versions however, the problem is NP-complete and we develop polynomial time approximation algorithms for these versions.