Skip to main content

Column Generation Based Heuristic for a Helicopter Routing Problem

  • Conference paper
Experimental Algorithms (WEA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4007))

Included in the following conference series:

Abstract

This work presents a column generation based heuristic algorithm for the problem of planning the flights of helicopters to attend transport requests among airports in the continent and offshore platforms on the Campos basin for the Brazilian State Oil Company (Petrobras). We start from a previous MIP based heuristic for this Helicopter Routing Problem and add column generation procedures that improve the solution quality. This is done by extending the earlier formulation and providing an algorithm to find optimal passenger allocation to fixed helicopter routes. A post optimization procedure completes the resulting algorithm, which is more stable and allows consistently finding solutions that improve the safety and the cost of the one done by the oil company experts.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Archetti, C., Mansini, R., Speranza, M.G.: The Split Delivery Vehicle Routing Problem with Small Capacity. Technical Report, Dipartimento Metodi Quantitativi - Universita degli studi di Brescia (2001)

    Google Scholar 

  2. Balas, E.: The Prize Collecting Traveling Salesman Problem. Networks 19, 621–636 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with split deliveries. Discrete Applied Mathematics 50, 239–254 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dror, M., Trudeau, P.: Savings by Split Delivery Routing. Transportation Science 23, 141–145 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  5. Galvão, R., Guimarães, J.: The control of helicopter operations in the Brazilian oil industry: Issues in the design and implementation of a computerized system. European Journal of Operational Research 49, 266–270 (1990)

    Article  Google Scholar 

  6. Hernadvolgyi, I.: Automatically Generated Lower Bounds for Search. PhD thesis, University of Ottawa (2004)

    Google Scholar 

  7. Moreno, L., Poggi de Aragão, M., Porto, O., Reis, M.L.: Planning Offshore Helicopter Flights on the Campos Basin. In: XXXVII Simpósio Brasileiro de Pesquisa Operacional (SBPO), Gramado, Brazil (2005)

    Google Scholar 

  8. Tijssen, G.A.: Theoretical and practical aspects of linear optimization. PhD thesis, Rijksuniversiteit Groningen (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moreno, L., de Aragão, M.P., Uchoa, E. (2006). Column Generation Based Heuristic for a Helicopter Routing Problem. In: Àlvarez, C., Serna, M. (eds) Experimental Algorithms. WEA 2006. Lecture Notes in Computer Science, vol 4007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11764298_20

Download citation

  • DOI: https://doi.org/10.1007/11764298_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34597-8

  • Online ISBN: 978-3-540-34598-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics