Abstract
This paper deals with a vehicle routing problem with split demands, namely the problem of determining a flight schedule for helicopters to off-shore platform locations for exchanging crew people employed on these platforms. The problem is formulated as an LP model and solved by means of a column-generation technique including solving TSP problems. Since the final solution needs to be integral, we have chosen a rounding procedure to obtain an integer solution. Since the LP approach needs a considerable amount of computer time, it is only suitable for long-term planning practices. For the usual short-term planning, we have designed the so-called Cluster-and-Route Heuristic together with a number of improvement heuristics. The Cluster-and-Route procedure constructs a suitable clustering of the platforms and simultaneously forms the routes of the helicopter flights associated with the clusters. This approach is different from the usual heuristics, in which the clusters are constructed first, and the routes for each cluster are made afterwards. Simulations with various data sets show that the new heuristic outperforms the usual heuristics for vehicle routing problems. Even better results are obtained when improvement heuristics are applied. We use four improvement heuristics, including, so-called 1-opt and 2-opt procedures.
Similar content being viewed by others
References
C. Barnhart, E.L. Johnson, R. Anbil and L. Hatay, A column-generation technique for the Long-Haul Crew-Assignment problem, in: Optimization in Industry 2, T.A. Ciriani and R.C. Leachman, eds., Wiley, 1994, pp. 7 - 24.
L. Bodin and B.L. Golden, Routing and scheduling of vehicles and crews, the state of the art, Computers and Operations Research 10(1983)63 - 211.
G. Clarke and J.W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research 12(1964)568 - 581.
M. Dror and P. Trudeau, Savings by split delivery routing, Transportation Science 23(1989) 141 - 145.
M. Dror and P. Trudeau, Split delivery routing, Naval Research Logistics 37(1990)383 - 402.
M. Dror, G. Laporte and P. Trudeau, Vehicle routing with split deliveries, Discrete Applied Mathematics 50(1994)239 - 254.
J. Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics 17(1965)449 - 467.
J.R. Evans and E. Minieka, Optimization Algorithms for Networks and Graphs, Marcel Dekker, New York, 1992.
B.E. Gillett and L.R. Miller, A heuristic algorithm for the vehicle dispatch problem, Operations Research 22(1974)340 - 349.
M. Haimovich, A.H.G. Rinnooy Kan and L. Stougie, Analysis of heuristics for vehicle routing problems, in: Vehicle Routing: Methods and Studies, Studies in Management Science, Vol. 16, Elsevier, Amsterdam, 1988, pp. 47 - 61.
R.H. Karp, Probabilistic analysis of partitioning algorithms for the Traveling Salesman Problem in the plane, Mathematics of Operations Research 2(1977)204 - 244.
E.L. Lawler, J.K. Lenstra, A.G.H. Rinnooy Kan and D.B. Shmoys, The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985.
G. Sierksma, Linear and Integer Programming; Theory and Practice, Marcel Dekker, New York, 1996.
Rights and permissions
About this article
Cite this article
Sierksma, G., Tijssen, G.A. Routing helicopters for crew exchanges on off-shore locations. Annals of Operations Research 76, 261–286 (1998). https://doi.org/10.1023/A:1018900705946
Issue Date:
DOI: https://doi.org/10.1023/A:1018900705946