Creating Initial Solutions for the Tail Assignment Problem

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/256398
Download file(s):
File Description SizeFormat 
256398.pdfFulltext1.2 MBAdobe PDFView/Open
Type: Examensarbete för masterexamen
Master Thesis
Title: Creating Initial Solutions for the Tail Assignment Problem
Authors: Blomgren, Elin
Abstract: One 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.
Keywords: Data- och informationsvetenskap;Computer and Information Science
Issue Date: 2018
Publisher: Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)
Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)
URI: https://hdl.handle.net/20.500.12380/256398
Collection:Examensarbeten för masterexamen // Master Theses



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.