Fly Cheaply: On the Minimum Fuel Consumption Problem

Timothy M. Chan, Alon Efrat

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

In planning a flight, stops at intermediate airports are sometimes necessary to minimize fuel consumption, even if a direct flight is available. We investigate the problem of finding the cheapest path from one airport to another, given a set of n airports in ℝ2 and a function l: ℝ2 × ℝ2 → ℝ+ representing the cost of a direct flight between any pair. Given a source airport s, the cheapest-path map is a subdivision of ℝ2 where two points lie in the same region iff their cheapest paths from s use the same sequence of intermediate airports. We show a quadratic lower bound on the combinatorial complexity of this map for a class of cost functions. Nevertheless, we are able to obtain subquadratic algorithms to find the cheapest path from s to all other airports for any well-behaved cost function l: our general algorithm runs in O(n4/3+ε) time, and a simpler, more practical variant runs in O(n3/2+ε) time, while a special class of cost functions requires just O(n log n) time.

Original languageEnglish (US)
Pages (from-to)330-337
Number of pages8
JournalJournal of Algorithms
Volume41
Issue number2
DOIs
StatePublished - Nov 2001

Fingerprint

Airports
Fuel consumption
Cost Function
Path
Cost functions
Combinatorial Complexity
Subdivision
Planning
Lower bound
Minimise
Necessary
Costs
Class

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this

Fly Cheaply : On the Minimum Fuel Consumption Problem. / Chan, Timothy M.; Efrat, Alon.

In: Journal of Algorithms, Vol. 41, No. 2, 11.2001, p. 330-337.

Research output: Contribution to journalArticle

Chan, Timothy M. ; Efrat, Alon. / Fly Cheaply : On the Minimum Fuel Consumption Problem. In: Journal of Algorithms. 2001 ; Vol. 41, No. 2. pp. 330-337.
@article{e254f6f5f0024e51a41f4a70cd94ca3a,
title = "Fly Cheaply: On the Minimum Fuel Consumption Problem",
abstract = "In planning a flight, stops at intermediate airports are sometimes necessary to minimize fuel consumption, even if a direct flight is available. We investigate the problem of finding the cheapest path from one airport to another, given a set of n airports in ℝ2 and a function l: ℝ2 × ℝ2 → ℝ+ representing the cost of a direct flight between any pair. Given a source airport s, the cheapest-path map is a subdivision of ℝ2 where two points lie in the same region iff their cheapest paths from s use the same sequence of intermediate airports. We show a quadratic lower bound on the combinatorial complexity of this map for a class of cost functions. Nevertheless, we are able to obtain subquadratic algorithms to find the cheapest path from s to all other airports for any well-behaved cost function l: our general algorithm runs in O(n4/3+ε) time, and a simpler, more practical variant runs in O(n3/2+ε) time, while a special class of cost functions requires just O(n log n) time.",
author = "Chan, {Timothy M.} and Alon Efrat",
year = "2001",
month = "11",
doi = "10.1006/jagm.2001.1189",
language = "English (US)",
volume = "41",
pages = "330--337",
journal = "Journal of Algorithms",
issn = "0196-6774",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Fly Cheaply

T2 - On the Minimum Fuel Consumption Problem

AU - Chan, Timothy M.

AU - Efrat, Alon

PY - 2001/11

Y1 - 2001/11

N2 - In planning a flight, stops at intermediate airports are sometimes necessary to minimize fuel consumption, even if a direct flight is available. We investigate the problem of finding the cheapest path from one airport to another, given a set of n airports in ℝ2 and a function l: ℝ2 × ℝ2 → ℝ+ representing the cost of a direct flight between any pair. Given a source airport s, the cheapest-path map is a subdivision of ℝ2 where two points lie in the same region iff their cheapest paths from s use the same sequence of intermediate airports. We show a quadratic lower bound on the combinatorial complexity of this map for a class of cost functions. Nevertheless, we are able to obtain subquadratic algorithms to find the cheapest path from s to all other airports for any well-behaved cost function l: our general algorithm runs in O(n4/3+ε) time, and a simpler, more practical variant runs in O(n3/2+ε) time, while a special class of cost functions requires just O(n log n) time.

AB - In planning a flight, stops at intermediate airports are sometimes necessary to minimize fuel consumption, even if a direct flight is available. We investigate the problem of finding the cheapest path from one airport to another, given a set of n airports in ℝ2 and a function l: ℝ2 × ℝ2 → ℝ+ representing the cost of a direct flight between any pair. Given a source airport s, the cheapest-path map is a subdivision of ℝ2 where two points lie in the same region iff their cheapest paths from s use the same sequence of intermediate airports. We show a quadratic lower bound on the combinatorial complexity of this map for a class of cost functions. Nevertheless, we are able to obtain subquadratic algorithms to find the cheapest path from s to all other airports for any well-behaved cost function l: our general algorithm runs in O(n4/3+ε) time, and a simpler, more practical variant runs in O(n3/2+ε) time, while a special class of cost functions requires just O(n log n) time.

UR - http://www.scopus.com/inward/record.url?scp=0347156624&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347156624&partnerID=8YFLogxK

U2 - 10.1006/jagm.2001.1189

DO - 10.1006/jagm.2001.1189

M3 - Article

AN - SCOPUS:0347156624

VL - 41

SP - 330

EP - 337

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 2

ER -