liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Utilizing problem specic structures in branch and bound methods for manpower planning
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

This thesis is about solving the manpower planning problem concerning stangand transitioning of pilots. The objective of the planning is to have enoughpilots to satisfy the demand while minimizing the cost. The main decisions totake are how many pilots to hire, which pilots to train and which courses toschedule. The planning problems that arise are both large and dicult whichmakes it important to use ecient solution methods. Seniority rules betweenpairs of pilots are the most complicating factor.A major part in the solution process is the solving of mixed integer programs.The emphasis in the thesis is to develop and test adaptations of the branch andbound algorithm to solve mixed integer programs faster. One of these is abranching principle that takes a problem specic structure into account. Agraph of implications is constructed from the seniority rules and this graph isthen used to estimate the impact of each branching candidate. The implementedmethods outperform the software XPRESS on some instances, while for mostinstances the performance is comparable.

Place, publisher, year, edition, pages
2012. , 51 p.
Keyword [en]
Manpower planning, Airlines, Optimization, Branch and bound, Branching methods
National Category
Other Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-84327ISRN: LiTH-MAT-EX-2012/10-SEOAI: oai:DiVA.org:liu-84327DiVA: diva2:558759
External cooperation
Jeppesen
Subject / course
Optimization
Presentation
2012-08-27, Kompakta rummet, Linköping, 13:15 (English)
Uppsok
Physics, Chemistry, Mathematics
Supervisors
Examiners
Available from: 2012-10-12 Created: 2012-10-04 Last updated: 2012-11-08Bibliographically approved

Open Access in DiVA

Master Thesis Björn Morén(518 kB)719 downloads
File information
File name FULLTEXT01.pdfFile size 518 kBChecksum SHA-512
80440540b5c0f46d951d79eedae64c14d0a9f3f5a437bdd91bc0db9ffd269cfb5ade1f50f9e7bc2ed5211916f98d579336eace789d877106680f3bd380700d06
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Morén, Björn
By organisation
Optimization The Institute of Technology
Other Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 719 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 342 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf