{"id":"https://openalex.org/W2804454185","doi":"https://doi.org/10.5445/ir/1000075507","title":"The Air Cargo Load Planning Problem","display_name":"The Air Cargo Load Planning Problem","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2804454185","doi":"https://doi.org/10.5445/ir/1000075507","mag":"2804454185"},"language":"en","primary_location":{"id":"pmh:oai:EVASTAR-Karlsruhe.de:1000075507","is_oa":false,"landing_page_url":"https://publikationen.bibliothek.kit.edu/1000075507","pdf_url":null,"source":{"id":"https://openalex.org/S4306401992","display_name":"Repository KITopen (Karlsruhe Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102335020","host_organization_name":"Karlsruhe Institute of Technology","host_organization_lineage":["https://openalex.org/I102335020"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"doc-type:doctoralThesis"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5445/ir/1000075507","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101946617","display_name":"Felix Brandt","orcid":"https://orcid.org/0000-0001-5522-9249"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brandt, Felix","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101946617"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6022,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.76890673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.6899533271789551},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6044908165931702},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5880733728408813},{"id":"https://openalex.org/keywords/operational-planning","display_name":"Operational planning","score":0.5814077854156494},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5429818630218506},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5063680410385132},{"id":"https://openalex.org/keywords/air-cargo","display_name":"Air cargo","score":0.49269038438796997},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.48134931921958923},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47440075874328613},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.45811930298805237},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4565330445766449},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4433441162109375},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.41824087500572205},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.29753053188323975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1333845555782318},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.11058798432350159},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10873782634735107},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.1023409366607666},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.1017618477344513}],"concepts":[{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.6899533271789551},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6044908165931702},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5880733728408813},{"id":"https://openalex.org/C2776613951","wikidata":"https://www.wikidata.org/wiki/Q7097788","display_name":"Operational planning","level":2,"score":0.5814077854156494},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5429818630218506},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5063680410385132},{"id":"https://openalex.org/C2778788726","wikidata":"https://www.wikidata.org/wiki/Q3569648","display_name":"Air cargo","level":2,"score":0.49269038438796997},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.48134931921958923},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47440075874328613},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.45811930298805237},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4565330445766449},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4433441162109375},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.41824087500572205},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.29753053188323975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1333845555782318},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.11058798432350159},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10873782634735107},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.1023409366607666},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1017618477344513},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:EVASTAR-Karlsruhe.de:1000075507","is_oa":false,"landing_page_url":"https://publikationen.bibliothek.kit.edu/1000075507","pdf_url":null,"source":{"id":"https://openalex.org/S4306401992","display_name":"Repository KITopen (Karlsruhe Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102335020","host_organization_name":"Karlsruhe Institute of Technology","host_organization_lineage":["https://openalex.org/I102335020"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"doc-type:doctoralThesis"},{"id":"doi:10.5445/ir/1000075507","is_oa":true,"landing_page_url":"https://doi.org/10.5445/ir/1000075507","pdf_url":null,"source":{"id":"https://openalex.org/S7407052948","display_name":"KITopen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2804454185","is_oa":false,"landing_page_url":"https://d-nb.info/114179263X/34","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.5445/ir/1000075507","is_oa":true,"landing_page_url":"https://doi.org/10.5445/ir/1000075507","pdf_url":null,"source":{"id":"https://openalex.org/S7407052948","display_name":"KITopen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"score":0.5,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2009609659","https://openalex.org/W3188967872","https://openalex.org/W2160341097","https://openalex.org/W176085548","https://openalex.org/W2041693766","https://openalex.org/W1529573724","https://openalex.org/W3006459329","https://openalex.org/W1548752021","https://openalex.org/W2099823828","https://openalex.org/W2148170608","https://openalex.org/W3127316876","https://openalex.org/W3044272019","https://openalex.org/W2792126729","https://openalex.org/W2326086502","https://openalex.org/W2967197076","https://openalex.org/W2750368253","https://openalex.org/W2959099712","https://openalex.org/W2100521566","https://openalex.org/W201024523","https://openalex.org/W3002375279"],"abstract_inverted_index":{"A":[0],"major":[1],"operational":[2,137,334],"planning":[3,26,39,105,131,201],"problem":[4,132,166,213],"in":[5,15,60,101,115,135,220,277,332],"the":[6,38,68,90,116,127,136,148,151,165,221,224,243,274,278,329,339,347],"air":[7,62,128,174,279],"cargo":[8,14,63,129,175,254,280,342],"industry":[9],"is":[10,40,46,65,70,100,214,317],"how":[11],"to":[12,18,29,248,257,290],"arrange":[13],"an":[16,61],"aircraft":[17,170,291,355],"fly":[19],"safely":[20],"and":[21,67,147,157,177,179,203,235,271,293,308,337,354],"profitably.":[22],"Therefore,":[23,162],"a":[24,47,103,123,198,204,217,265],"challenging":[25],"puzzle":[27],"has":[28],"be":[30,344,358],"solved":[31,215],"for":[32,73,253,319],"each":[33],"flight.":[34],"Besides":[35],"its":[36,145],"complexity,":[37],"mostly":[41],"done":[42],"manually":[43],"today,":[44],"which":[45,316],"time":[48],"consuming":[49],"process":[50],"with":[51],"uncertain":[52],"solution":[53,160],"quality.":[54],"The":[55,209,238,282,302],"literature":[56],"on":[57,95,230,313],"loading":[58,84],"problems":[59],"context":[64],"scarce":[66],"term":[69],"used":[71],"ambiguously":[72],"different":[74],"subproblems":[75,192],"like":[76],"selecting":[77],"containers,":[78,82],"packing":[79,212,269],"items":[80],"into":[81,86,167],"or":[83],"containers":[85],"aircraft.":[87],"All":[88],"of":[89,98,126,139,150,223,285,349],"presented":[91],"models":[92],"only":[93],"focus":[94],"certain":[96],"aspects":[97,110],"what":[99],"practice":[102,138],"larger":[104],"problem.":[106],"Additionally,":[107],"some":[108],"practical":[109],"have":[111],"not":[112],"been":[113],"covered":[114],"literature.":[117],"In":[118],"this":[119],"work,":[120],"we":[121,155,163,262],"provide":[122],"comprehensive":[124],"overview":[125],"load":[130,251,258,350],"as":[133,216],"seen":[134],"our":[140,228],"industrial":[141],"partner.":[142],"We":[143,181,226],"formalize":[144],"requirements":[146],"objectives":[149],"respective":[152],"stakeholders.":[153],"Furthermore,":[154,346],"develop":[156],"evaluate":[158],"suitable":[159,247],"approaches.":[161],"decompose":[164],"four":[168],"steps:":[169],"configuration,":[171],"build-up":[172],"scheduling,":[173],"palletization,":[176],"weight":[178],"balance.":[180],"solve":[182],"these":[183],"steps":[184],"by":[185,196],"employing":[186,328],"mainly":[187],"mixed-integer":[188],"linear":[189],"programming.":[190],"Two":[191],"are":[193,246,299],"further":[194],"decomposed":[195],"adding":[197],"rolling":[199],"horizon":[200],"approach":[202],"Logic-based":[205],"Benders":[206],"Decomposition":[207],"(LBBD).":[208],"actual":[210],"three-dimensional":[211],"constraint":[218],"program":[219],"subproblem":[222],"LBBD.":[225],"evaluated":[227],"approaches":[229,245,331],"instances":[231],"containing":[232],"513":[233],"real":[234],"synthetic":[236],"flights.":[237,255],"numerical":[239],"results":[240],"show":[241],"that":[242],"developed":[244,330],"automatically":[249],"generate":[250],"plans":[252,259],"Compared":[256],"from":[260,327],"practice,":[261],"could":[263],"achieve":[264],"20":[266],"percent":[267],"higher":[268],"density":[270],"significantly":[272,325,359],"reduce":[273],"handling":[275,352],"effort":[276],"terminal.":[281],"achieved":[283],"costs":[284,348],"additional":[286],"fuel":[287],"burn":[288],"due":[289],"imbalances":[292],"reloading":[294],"operations":[295,356],"at":[296],"stop-over":[297],"airports":[298],"almost":[300],"negligible.":[301],"required":[303],"runtimes":[304],"range":[305],"between":[306],"13":[307],"38":[309],"minutes":[310],"per":[311],"flight":[312],"standard":[314],"hardware,":[315],"acceptable":[318],"non-interactive":[320],"planning.":[321],"Cargo":[322],"airlines":[323],"can":[324,343,357],"profit":[326],"their":[333],"practice.":[335],"More":[336],"especially":[338],"profitable":[340],"last-minute":[341],"transported.":[345],"planning,":[351],"effort,":[353],"reduced.":[360]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}