Creating Initial Solutions for the Tail Assignment Problem

dc.contributor.authorBlomgren, Elin
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T14:58:28Z
dc.date.available2019-07-03T14:58:28Z
dc.date.issued2018
dc.description.abstractOne of many optimization problems in the airline industry is the tail assignment problem, i.e. to decide which aircraft operate which flight. Initial solutions can be used to warm-start optimization algorithms. In this thesis, the optimization algorithm uses a time window heuristic together with column generation. This thesis investigates different methods to create initial solutions for the tail assignment problem. The chosen methods consist of greedy algorithms and other simple heuristics. The goal was that the methods should assign at least 95% of the flights and this is achieved by most methods and test cases. Also, when using the produced initial solutions as input to the optimization algorithm, the value of the objective function is improved for some of the test cases.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/256398
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titleCreating Initial Solutions for the Tail Assignment Problem
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
local.programmeComputer science – algorithms, languages and logic (MPALG), MSc
Ladda ner
Original bundle
Visar 1 - 1 av 1
Bild (thumbnail)
Namn:
256398.pdf
Storlek:
1.18 MB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext