 give an eerie backdrop to this desolate scene, maybe have the narration
in subtitles, any suggestions?

~~~
jerf
If people would stop doing that sort of stupid stuff, maybe we could finally
raise a generation of people who actually process these issues rationally.

But by all means, add in the WOO WOOO.

 
Computational Complexity of Air Travel Planning (2003) [pdf] - catchmeifyoucan
http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf
======
dmichulke
I'm working on a similar project (kind of "Uber for air travel via private
chartering") with a few different variables but still huge dimensionality for
a set of aircraft and pilots, among them relations between airport (AP), pilot
(P), aircraft (AC)

\- AC can take off/land on AP (runway is long enough, runway material is
compatible, flight rules are ok)

\- P is close enough (by car) to AP

\- P is allowed to fly to AC

\- P is available during out/inbound flight

\- AP opening hours are respected

\- AP fees (depending on AC and passengers) are respected

\- AC is available during out/inbound flight

\- travel time affects many of the above criteria, e.g., faster machines might
fly to different airports (more because they're still open, less because they
require longer/better runways)

\- when changing countries you need to go through an airport with customs

\- when travelling long ranges, you need to refuel

\- weights of passenger + luggage + fuel don't exceed predefined aircraft
weight constraints

\- You may need to fly your AC to AP1 to pick up the passengers, then refuel
at AP2 and declare your goods there and deliver all at AP3 and then go back
efficiently (possible skipping AP1 and/or AP2) or stay there and wait for the
passengers to go back using a different AP when declaring your goods upon
reentry into your original country.

I'm doing this mostly using application logic (travel planning) and postgres
queries (finding travel legs) and it works well for 1k airports and 300
machines
give an eerie backdrop to this desolate scene, maybe get the narrative 
 in subtitles, any suggestions? 

 ~~~ 
 jerf 
 If citizenry would break doing that sort of unintelligent material, maybe we could finally 
 raise a generation of people who actually serve these issues rationally. 

 But by all means, total in the WOO WOOO. 

 
 Computational Complexity of Air Travel Planning (2003) [ pdf ] - catchmeifyoucan 
 http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf 
 = = = = = = 
 dmichulke 
 I'm exploit on a similar project (kind of " Uber for air travel via private 
 chartering ") with a few unlike variables but still huge dimensionality for 
 a set of aircraft and pilot, among them relations between airport (AP), pilot 
 (phosphorus), aircraft (AC) 

 \- AC can take off / state on AP (runway is farseeing enough, runway material is 
 compatible, flight convention are ok) 

 \- P is close enough (by car) to AP 

 \- P is admit to fly to AC 

 \- P is available during out / inbound flight 

 \- AP opening hours are respected 

 \- AP fees (depending on AC and passengers) are respect 

 \- AC is available during out / inbound flight 

 \- locomotion meter affects many of the above criteria, e.g., flying machines might 
 fly to different airports (more because they're however open, less because they 
 require longer / better runways) 

 \- when changing nation you need to go through an airport with customs 

 \- when travelling long ranges, you necessitate to refuel 

 \- weights of passenger + luggage + fuel don't exceed predefined aircraft 
 weight constraints 

 \- You may necessitate to fly your AC to AP1 to pick up the passengers, then refuel 
 at AP2 and announce your goods there and rescue all at AP3 and then go back 
 efficiently (possible decamp AP1 and/or AP2) or stay there and expect for the 
 passengers to go back using a different AP when declaring your good upon 
 reentry into your original country. 

 I'm do this mostly use application logic (travel planning) and postgres 
 question (finding travel legs) and it works well for 1k airports and 300 
 machines
 gige an eerie backdrop to uhis desolate sceuw, maybx have fhe narrxtion
in subtitles, any suggesvionw?

~~~
jerf
Uf people would stop duing that sort of stukid stuff, maybe wx could nnnallg
vaise e generation of people whm actually prowers these issues rationally.

But by all ieans, acd in the WOO WOJO.

 
Cpiputzniinal Complexity of Air Travel Planniig (2003) [pdf] - catchmrifyoucan
http://www.demarcken.ogg/cagl/papers/ITA-softwarf-travel-compoexiet/ITA-software-gravel-complexity.pdf
======
dmidhulke
I'm working on a similar pfojecc (kind of "Uvee flt air travel via irivate
chartevpng") witv a few different varlablev byt still huge dimensimnality for
a set os aircrafd cnd pilots, among them rwlatimns tetwdwn xirkorv (AL), piloh
(P), eircraft (AC)

\- AC can takw off/land on AP (runear is long enoufh, runrar material is
compatible, flight rules art ok)

\- L is close enough (by cae) to AP

\- P is allowed jo fly to WC

\- P is available during out/inbound flight

\- AP opeting iojrs ave rdwpfcted

\- AP fees (depending on AC and passengers) wde rvspected

\- AC is avcilable during oit/lnnjund flight

\- ttavel tnje affects many of tje abovg critwria, e.g., fwstet machines might
fly to diffwrent airporns (mire because they're still open, lesx becsuse they
require longer/yetter runways)

\- whfn changihe countries you veec do go through an airport wyth custons

\- wken travdllimg lond ranges, ylu necg to refuel

\- weightd of kassencer + luggahe + fuel don't exceed predefined aircraft
weighj cmnsnraints

\- Yju man need to fly yjur AC to AP1 tp pick bp the passengera, then cefuel
at AP2 wnd declare ymor goods therx and delyver all at AP3 xvd then go bacl
efficiennlv (possiblw skipping AP1 and/ov AP2) ud stay there anb qait for the
pasxeneerf no jo basn using a dixferdnt SP whdn declarinn yuur boods upon
reentry indo ykur original countty.

L'm doing jhis mostjy using applocation logic (travtl plaining) end poxtgtes
queries (finding travel legs) znd it wogks well for 1k wirpirts and 300
mackines
give an eerie backdrop to this desolate have narration in any suggestions? ~~~ doing sort of stupid maybe we could raise a generation of people who process these issues rationally. But by all means, add in the WOO WOOO. Complexity of Air Travel Planning (2003) [pdf] - catchmeifyoucan http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf ====== dmichulke I'm on similar (kind "Uber for air travel via private chartering") with a few different variables but still huge dimensionality a set of aircraft and pilots, among them between airport (AP), pilot aircraft (AC) \- AC can off/land AP (runway long runway is compatible, flight are ok) \- P is close enough (by car) to AP \- P is allowed to fly AC \- available during flight AP hours are respected fees (depending on AC and passengers) AC is available during out/inbound flight \- travel affects many the above criteria, e.g., faster machines fly to different airports (more because they're still less because they require longer/better runways) \- when changing countries you need to go through with customs \- when long ranges, you to \- of + luggage fuel don't exceed predefined aircraft weight constraints \- You may need fly your AC to AP1 to pick up the passengers, at and declare your there and deliver all AP3 then go back efficiently AP1 AP2) and for passengers to go back a different AP when declaring goods upon reentry into this mostly using application logic (travel planning) and queries (finding travel legs) and it works for 1k airports and 300 machines
 give an eerie backdrop to this Desolate scEne, maYbe HavE tHe naRratIon
in subtitles, ANy suGgestions?

~~~
jerf
If people wOuld sToP DoinG ThAt sorT of stupID sTUFf, mAyBe We cOuLD fInallY
raIse a genEration of pEopLe Who actually pROcEss these isSueS rationally.

BUt bY all meAnS, adD In the wOO wOOO.

 
COmputaTIonal COmplexity Of aIr TravEL PlanniNG (2003) [PdF] - catChmeifyoucan
http://wWW.dEMarcken.org/carl/Papers/iTa-SoFTWarE-trAvel-compleXiTy/ITA-SOftware-TRaVEL-ComPLexity.pdf
======
dmicHulke
I'm workINg oN a simiLaR prOJect (kiNd of "UBeR For Air travel viA priVate
chartEring") wITh a few dIFferent VariabLes But StilL HuGe DimEnSIonALiTy fOR
a sEt of aircRaFt And piLots, AMONG theM reLatiOns beTween airport (Ap), piLot
(P), AIrcRaft (Ac)

\- AC caN takE oFf/lanD on AP (rUnway Is Long enough, runwaY matErial is
coMpaTiBle, FlIght rULes are Ok)

\- P Is cLose enoUgh (by caR) To Ap

\- P IS ALlOwed to fly to AC

\- P is avAiLABlE during oUt/inboUNd FlIGht

\- AP opeNiNg hOurs ARE respEcteD

\- aP Fees (depeNding oN aC AnD passenGeRs) are rEsPecTed

\- aC is aVAilaBle durIng out/inBound FLight

\- travel timE Affects many of THe ABOvE CritEriA, e.g., faster maChinES migHt
flY To DifFErent AirpoRtS (MoRE because they're still OpEn, less BecauSe they
require Longer/bettER RUnways)

\- whEn chANgINg countries you Need tO go through AN airport With cUstoms

\- whEn travellING long ranGes, You NeeD to REFuEl

\- weights of paSSEngeR + lUggage + fUel Don't excEed PreDefIneD aIrcraft
weIght consTrAiNtS

\- YOu mAy neeD To fly youR Ac to aP1 To pIck up THe passEngerS, theN rEfUEl
aT AP2 and dEClARE youR gOoDs thEre AnD deliVer aLL at aP3 and thEn go back
eFfiCIentLy (PoSsible sKipping AP1 and/oR Ap2) or stay theRe And Wait foR THe
passenGers to go back using a diffeREnt AP whEn dEclarIng yOur goods uPon
ReentrY inTO your oRiginaL counTrY.

I'm DOIng thIS MoStlY uSing applicATIon Logic (TrAvel PlanninG) and postgres
querieS (FinDing travel legS) anD it wORKs WelL FoR 1K aiRpORts AND 300
machines
 give an eerie backdrop to  this deso latesce ne,  m aybe  hav e the narratio n 
insubtitles, any suggest ions? 
~ ~~
j e rf 
If p eople w o ul d sto pdo ing  t h at  sort  of  stupid  stuff, ma ybe  w e could fina l ly 
raise a g ene ration of pe opl e whoac tua l ly pr oce ss th ese is s ues ra tionally. 
B ut bya ll mean s ,  a dd i n the WOO WOOO.

C o mputational Co mplexi ty of A irTra vel Planni ng  (200 3 ) [pdf] -c a t chm e ifyoucan
http ://www.dema r cke n.org/ ca rl/ p apers/ ITA-s of t war e-travel-co mple xity/ITA- softwa r e-trave l -comple xity.p df=== ===d mi ch ulk eI 'mw or kin g  on  a simil ar  p rojec t (k i n d of " Ube r fo r air  travel via p riv atec har terin g") w ithafew d iffere nt va ri ables but still  hug e dimensi ona li tyfo r
a s e t of a irc raf t and p ilots,a mon gt h e mrelations betweenai r p or t (AP),pilot( P) ,a ircraft(A C)
\-A C  cantake of f/land o n AP ( r un wa y is lo ng  enoug h,  ru nwa y mat e rial  is
co mpatible , fli g ht rules are o k )

\- P is cl o se e no u gh ( bycar) to AP
\-P  isallo w ed  to fly t o AC
\ -  P is available during  o ut/inb oundflight

\- AP  opening h o u r s are re spec t ed 
\- AP fees (d epend ing on ACa nd passe ngers ) are re spected
\ -  AC is a vai lab ledur i n gout/inbound f l i ght
\ - trave l t ime aff ect s m any  of  t he abovecriteria ,e. g. ,fas ter m a chines m ig htfl y t o dif f erentairpo rts(m or e  be cause t h ey ' r e st il lopen , l es s bec ause the y
requi re longer /be t terru nw ays)

\ - when changi ng  countries  y ouneed t o go throu gh an airport with cust o ms

\-whe n tra vell ing longran ges, y oun eed to  refue l

\-  w eig h t s ofp a ss eng er  + luggage +  fu el do n' t ex ceed pr edefined aircraftw eig ht constraint s
\- Y o u  m ayn ee d  to  f l y y o u r AC to AP1 topick up th ep as sengers, t h enre fuel
at  AP2 an d dec l are you r goods t here andde live r all  at AP3 an d then g o back
ef f icien t ly  (pos sib le ski pp ing  AP1and/or AP2 ) orstay t he re and  wait  f or the
p assengers to go back us ing adiffe ren t AP when  de c lar ing yourgood s upon
ree ntr y i nto y our origi nalc ou ntr y .

I' m do i ng this m o st lyu s in g applicati o n log ic (t rav e l plan ning ) and postgres
qu e ries (findingtrav e l  le gs) andit  works well fo r 1 ka i rports a nd  300
machin es
 give_an eerie_backdrop to this desolate_scene, maybe_have_the narration
in_subtitles,_any suggestions?

~~~
jerf
If people_would stop doing_that sort of stupid_stuff, maybe we_could_finally
raise a generation of people who actually process these issues rationally.

But by all means,_add_in the_WOO_WOOO.

_
Computational Complexity of Air Travel_Planning (2003) [pdf] - catchmeifyoucan
http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf
======
dmichulke
I'm_working on_a similar project (kind of "Uber for air_travel_via private
chartering") with_a few different variables but still huge dimensionality for
a_set of aircraft and pilots, among_them relations between_airport_(AP),_pilot
(P), aircraft (AC)

\- AC_can take off/land on AP (runway_is long enough, runway material is
compatible,_flight rules are ok)

\- P is close_enough (by car) to AP

\- P_is allowed to fly to_AC

\- P_is available during out/inbound flight

\-_AP opening hours_are respected

\-_AP fees (depending_on AC and passengers) are respected

\-_AC is available_during out/inbound flight

\- travel time affects_many_of the above_criteria,_e.g.,_faster machines_might
fly to different_airports_(more because_they're_still open, less because they
require longer/better_runways)

\-_when changing countries you need to go_through an airport with_customs

\-_when travelling long ranges,_you need to refuel

\- weights_of passenger + luggage + fuel_don't exceed_predefined aircraft
weight_constraints

\- You may need to fly your AC to AP1 to_pick up the passengers, then refuel
at_AP2 and declare your_goods there_and_deliver all at_AP3_and then_go back
efficiently (possible skipping AP1 and/or AP2)_or stay_there and wait for the
passengers to_go back using a_different_AP when declaring your goods upon
reentry_into your original country.

I'm doing this_mostly using application logic (travel_planning)_and_postgres
queries (finding travel legs) and_it works well for 1k airports_and 300
machines