Vehicle refueling with limited resources

Research output: Book/ReportReportAcademic

48 Downloads (Pure)

Abstract

This paper deals with a vehicle refueling problem in which the vehicle travels on a fixed route of successive stations. There are upper bounds for the available fuel amounts at stations and in each piece of the travel tank capacity may vary. Fuel prices vary from one station to another and the main goal is to complete the route with least cost. This problem corresponds to non-stationary inventory-capacitated lot sizing problem. We propose an O(n log n) time algorithm for this vehicle refueling problem.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages14
ISBN (Print)978-90-386-2483-9
Publication statusPublished - 2011

Publication series

NameBETA publicatie : working papers
Volume343
ISSN (Print)1386-9213

Fingerprint Dive into the research topics of 'Vehicle refueling with limited resources'. Together they form a unique fingerprint.

Cite this