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/

Mario Meets Pareto

https://www.mayerowitz.io/blog/mario-meets-pareto
543•theanonymousone•6h ago•115 comments

Launch HN: ProvenMetal (YC S26) delivers circuit boards in days instead of weeks

https://provenmetal.com
55•willcarkner•1h ago•42 comments

Cities Are Ditching Flock, Replacing It with Axon License Plate Readers

https://www.404media.co/cities-are-ditching-flock-immediately-replacing-it-with-axon-license-plat...
54•cdrnsf•31m ago•15 comments

Show HN: The Channels SDK – Bring Any Agent to Any Channel (Slack, MS Teams)

https://github.com/CopilotKit/channels-sdk
42•davidmckayv•1h ago•8 comments

Crime Pays but Botany Doesn't

https://www.crimepaysbutbotanydoesnt.com/reading-list
516•DarkContinent•12h ago•157 comments

Humans missed 1 in 3 threats approving AI agent commands across 40k game runs

https://scalex.dev/blog/ai-agent-permissions-stats/
170•Wirbelwind•5h ago•134 comments

How to Make a Nintendo 64 Game in 2026

https://phoboslab.org/log/2026/08/xibalba64-making-of
356•atan2•2d ago•129 comments

The Simple Elegance of the Integrated Timing Belt Loopback Fastener

https://danielmangum.com/posts/integrated-timing-belt-loopback-fastener/
26•hasheddan•4d ago•9 comments

Pareto Front

https://en.wikipedia.org/wiki/Pareto_front
163•binyu•1w ago•71 comments

Show HN: I spent 2 years designing a mechanical Magic Keyboard

https://electronicmaterialsoffice.com/
162•aemerson_•3h ago•113 comments

Discovery Loop

https://www.discoveryloop.com/
861•xtreak29•1d ago•529 comments

Changes at Google DeepMind: Demis Hassabis from CEO to Chair, Jeff Dean departs

https://blog.google/company-news/inside-google/message-ceo/next-chapter-ai-momentum/
781•colesantiago•1d ago•839 comments

Join Me in Jamverse

https://contraptions.venkateshrao.com/p/join-me-in-jamverse
30•surprisetalk•6d ago•5 comments

Unearthing my 1996 windowed OS in machine code for Am29000 homebrew computer

https://nanochess.org/the_am29000_computer.html
100•nanochess•5d ago•19 comments

Poles of Inaccessibility in the San Gabriel Mountains

https://notes.secretsauce.net/notes/2015/05/06_poles-of-inaccessibility-in-the-san-gabriel-mounta...
10•dima55•4d ago•1 comments

The title cards in Blade Runner are amazing

https://randsinrepose.com/archives/blade-runner-title-cards/
379•ExMachina73•20h ago•182 comments

Beating GPT-5.6 Sol on retrieval with 100x cheaper open models

https://neon.com/blog/how-castform-neon-beats-frontier-models-on-price-and-efficiency
389•moonikakiss•23h ago•109 comments

Born Against, or why hobby programming communities are against LLM usage

https://blog.fogus.me/llm/born-against.html
371•lladnar•22h ago•412 comments

Muse Code and Muse Spark 1.2

https://research.meta.ai/blog/introducing-muse-code-and-muse-spark-1-2
303•paulkrush•22h ago•217 comments

Zed DeltaDB

https://zed.dev/deltadb
499•ahamez•22h ago•283 comments

GitHub Actions and Pages are experiencing degraded availability

https://www.githubstatus.com/incidents/qcvjkzcs7j74
74•Footkerchief•1h ago•29 comments

Branchless Rust: Making a Filter 4x Faster by Removing an If

https://www.greyblake.com/blog/branchless-rust/
264•greyblake•3d ago•87 comments

Cloudflare OS: an open platform for agents, apps, and work

https://blog.cloudflare.com/cloudflare-os/
618•speckx•1d ago•308 comments

The 11 Types of Washington, DC, Metro Station Architecture (2018)

https://ggwash.org/view/68565/metro-has-11-types-of-station-architecture.-learn-them-all-with-thi...
39•quuxplusone•2d ago•12 comments

Morioka Shoten

https://www.takram.com/projects/a-single-room-with-a-single-book-morioka-shoten
55•skogstokig•5d ago•18 comments

Nvidia’s Vera Whitepaper Has a Thread Loose

https://chipsandcheese.com/p/nvidias-vera-whitepaper-has-a-thread
188•pella•20h ago•43 comments

Atlassian Rovo Exfiltrates Data, Bypassing Controls

https://www.promptarmor.com/resources/atlassian-rovo-exfiltrates-data
285•hackerBanana•1d ago•121 comments

Quantego: A Family of Lego Models of IBM Quantum Computers

https://quantego.org/
64•rbanffy•1w ago•25 comments

Prime Agent: A self-improving RLM agent

https://www.primeintellect.ai/blog/prime-agent
227•Xeophon•20h ago•55 comments

What Happened to Talenti?

https://www.nytimes.com/wirecutter/reviews/talenti-investigation/
6•tysone•39m ago•0 comments