Minimizing takeoff and landing risk in helicopter pickup and delivery operations

Autor: Irina Gribkovskaia, Øyvind Halskau, Mikhail Y. Kovalyov
Rok vydání: 2015
Předmět:
Zdroj: Omega. 55:73-80
ISSN: 0305-0483
DOI: 10.1016/j.omega.2015.02.010
Popis: The problem of minimizing total helicopter passenger risk caused by takeoffs and landings is studied. There are passenger pickup and delivery demands to be satisfied at given points by flights starting and ending in the same heliport and visiting several points. For each point, the delivery demand is the number of passengers to be transported from the heliport to this point and the pickup demand is the number of different passengers to be transported from this point to the heliport. Each pickup and delivery demand must be satisfied in full by one flight. There are an upper bound on the number of flights and an upper bound on the helicopter passenger capacity. The objective function is a linear combination of the numbers of passengers involved in takeoffs and landings at visited points. A solution is characterized by the number of flights, sets of visited points and their sequences for all flights. Properties of optimal solutions are established. Several cases are proved NP-hard. A quadratic boolean programming formulation and two dynamic programming algorithms are suggested for the general case. Computer experiments demonstrated that they are able to solve real-life instances. Polynomial time algorithms are presented for special cases. Implementation of the suggested solutions into the real helicopter operations should decrease the number of fatalities.
Databáze: OpenAIRE
Externí odkaz: