frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Open in hackernews

Computational Complexity of Air Travel Planning [pdf] (2003)

http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf
76•rochoa•1y ago

Comments

buildsjets•1y ago
This is well over 20 years old and is based on pre 9/11 flight data. I would suspect that a lot has changed since then. So proceed with no caution at all.
gwern•1y ago
Since these sorts of things usually only get more and more complex over time, I would guess that it's all still true, but much more so.
throw0101b•1y ago
(2003)
throw0101b•1y ago
The PDF was produced by ITA, which famously used Common Lisp:

* https://en.wikipedia.org/wiki/ITA_Software

From 2001, a message from the same author as the linked paper:

> (Here's an email Carl de Marcken of ITA Software sent to a friend, describing their experiences using Lisp in one of the software industry's most demanding applications.)

* https://www.paulgraham.com/carl.html

Qem•1y ago
Are there any public, open, comprehensive datasets on flights?
dieselerator•1y ago
> Are there any public, open, comprehensive datasets on flights?

Airlines and commercial aviation operators schedule their own flights. That is a dynamic schedulle. So, perhaps there is no "comprehensive data set".

However, FlightAware makes publicly available scheduled and completed flight data over many routes in the USA. You can search by route and get a list of flights.

Flight information includes filed departure time, route of flight, and speed. For completed flights actual time, altitude, and route is shown. For example, a search on the route Dallas/Fort Worth to Austin lists 45 flights.

I hope that helps.

foundart•1y ago
A very interesting dive into, as the title says, the computational complexity of air travel planning. Graph algorithms with lots of complexity added due to the wide variety of fare conditions that airlines have dreamt up over the years.

The article may be from 2003 but I would call it an evergreen. While I imagine some of the details have changed since then, I suspect that the complexity has only grown since then.

foundart•1y ago
It makes me wonder: Would an airline that drastically simplified its fares be more likely to appear in flight search results?

Simplifying the fares would make it less computationally expensive and, in theory, could take fewer steps to answer a flight planning query.

Imagine a flight search planner that, say, fanned out N airline-specific workers when handling a planning query and then displayed to the user whatever results it got back within some time limit. If FooAir had simple fares, the FooAir searcher would likely run faster than searchers for other airlines. Thus it would be more likely to return results for more queries, assuming the deadline is fairly tight because of usability metrics. (People don't tend to stick around waiting for slow results.)

sjburt•1y ago
At least a few years ago (~2014), the fare search was actually nearly instant, but all major airfare search sites added a delay because customers had the impression they were getting a better deal when they had to wait. It seems like the delay has been dialed back lately.
teleforce•1y ago
This is a very popular article that get submitted every now and then (nearly every year) [1].

I think this kind of problem would be a very nice for logic, optimization and constraint programming that probably can be solved with modern tools like Google OR-Tool or Monash University MiniZinc [1],[2],[3].

[1] Past:

https://hn.algolia.com/?query=Computational%20Complexity%20o...

[2] Logic, Optimization, and Constraint Programming: A Fruitful Collaboration - John Hooker - CMU (2023) [video]:

https://www.youtube.com/live/TknN8fCQvRk

[3] Google OR-Tools:

https://developers.google.com/optimization

[4] MiniZinc:

https://www.minizinc.org/

Pi 1.0

https://earendil.com/posts/pi-1-0/
1199•sergiotapia•12h ago•373 comments

Shimano Bicycle Museum Review

https://inrng.com/2026/10/shimano-bicycle-museum/
68•pietroppeter•3h ago•8 comments

How Singapore's government-run dating service works

https://www.singapore-samizdat.com/p/how-singapores-government-run-dating-service-firstdate-works
127•danielfoster•6h ago•69 comments

Several vulnerabilities have been discovered in the Linux kernel

https://lwn.net/Articles/1097401/
263•luispa•9h ago•184 comments

DeepSeek Harness Desktop for macOS and Windows

https://www.deepseek.com/en/harness/
205•Kuyawa•5h ago•101 comments

Clef: Open-weight decision models, and new RL fine-tuning platform

https://blog.cloudflare.com/clef-decision-models/
496•jasondavies•15h ago•174 comments

SvelteKit 3

https://svelte.dev/blog/sveltekit-3-is-here
252•sampsn•12h ago•86 comments

Pi Durable

https://earendil.com/posts/pi-durable/
355•paulsmith•12h ago•45 comments

Automatic Transmission – a data-privacy study of connected vehicles

https://automatictransmission.khoury.northeastern.edu/index.html
179•rafaelc•11h ago•157 comments

Ask HN: Who is hiring? (October 2026)

195•whoishiring•17h ago•196 comments

StreetComplete on iOS is now in public beta

https://github.com/streetcomplete/StreetComplete/issues/5421
555•Snowly•21h ago•148 comments

Turbo Haskell

https://comonad.com/reader/2026/turbo-haskell/
81•pjmlp•18h ago•14 comments

Git 3.0's upcoming SHA-256 default will be a costly mistake

https://blog.gitbutler.com/git-3-sha-256
345•chmaynard•15h ago•329 comments

Using Opus 5.5 to discover a new eyewitness record of the dodo

https://resobscura.substack.com/p/using-opus-55-to-discover-a-new-eyewitness
130•benbreen•11h ago•31 comments

To grieve, or not to grieve?

https://xenaproject.wordpress.com/2026/10/01/to-grieve-or-not-to-grieve/
60•stabbles•22h ago•24 comments

Frog and Toad and the Increasingly Capable Machines

https://www.frogandtoad.ai/
141•supermdguy•9h ago•30 comments

RIP, vector database

https://turbopuffer.com/blog/rip-vector-database
316•razin•16h ago•86 comments

CSS Bed: Classless CSS themes to use as starting points in web development

https://www.cssbed.com
100•sea-gold•10h ago•26 comments

ArXiv's Updated Rate Limit Policy

https://blog.arxiv.org/2026/10/01/updated-rate-limit-policy/
110•50kIters•12h ago•49 comments

Vote on which of Hacker News' challenges for AI have been met

https://stoppels.ch/goalposts/
136•stabbles•14h ago•133 comments

Various Projects Find Hidden SDR Capabilities in ESP32 Microcontrollers

https://www.rtl-sdr.com/various-projects-independently-find-hidden-sdr-capabilities-in-esp32-micr...
217•nkw•17h ago•34 comments

Show HN: Janus – Go binary that runs GGUF models via Vulkan on AMD/Intel/Nvidia

https://github.com/Vibra-Ingenn/Janus
72•Maverick617•11h ago•13 comments

Oxygen-deprived underwater zones may not be “dead zones” but clue to early life

https://agupubs.onlinelibrary.wiley.com/doi/10.1029/2026AV002570
95•gumby•13h ago•8 comments

Cloudflare K2: serverless event streams

https://blog.cloudflare.com/cloudflare-k2-streams/
234•elffjs•18h ago•90 comments

Context Language Models

https://arxiv.org/abs/2609.37725
142•emersonmacro•17h ago•33 comments

How to speed up the Rust compiler in September 2026

https://nnethercote.github.io/2026/09/30/how-to-speed-up-the-rust-compiler-in-september-2026.html
250•trickypr•19h ago•140 comments

Building reliable (and fast) directory sync

https://www.firezone.dev/blog/building-reliable-directory-sync
5•jamilbk•3h ago•0 comments

Butterflies use optical illusions to dodge predators

https://www.essex.ac.uk/news/2026/09/30/butterflies-use-optical-illusions-to-dodge-predators
40•gmays•9h ago•9 comments

RacketCon Is Saturday

https://con.racket-lang.org/
139•spdegabrielle•17h ago•37 comments

Ask HN: Who wants to be hired? (October 2026)

108•whoishiring•17h ago•337 comments