This paper presents a memetic algorithm for a pick-up and delivery problem. The specific application studied here is the personnel transportation within a set of oil platforms by one helicopter that may have to undertake several routes in sequence. Different versions of the algorithm are presented and tested on randomly generated instances as well as on real instances provided by a petroleum company. The results show that the solutions obtained are 8% better than construction and improvement solutions on randomly generated instances. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Velasco, N., Castagliola, P., Dejax, P., Guéret, C., & Prins, C. (2009). A memetic algorithm for a pick-up and delivery problem by helicopter. Studies in Computational Intelligence, 161, 173–190. https://doi.org/10.1007/978-3-540-85152-3_8
Mendeley helps you to discover research relevant for your work.