A Memetic Algorithm for a Pick-Up and Delivery Problem by Helicopter

Nubia Velasco (1) , Philippe Castagliola (2) , Pierre Dejax (2) , Christelle Guéret (2) , Christian Prins (3)

1 UNIANDES - Universidad de los Andes [Bogota]
2 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
3 LOSI - Laboratoire d'Optimisation des Systèmes Industriels

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.

Keywords: Local Search; Crossover Operator; Memetic Algorithm; Vehicle Route Problem; Local Search Procedure

Domains: Computer Science [cs]; Operations Research [cs.RO]; Computer Science [cs]; Data Structures and Algorithms [cs.DS]

Nubia Velasco, Philippe Castagliola, Pierre Dejax, Christelle Guéret, Christian Prins. A Memetic Algorithm for a Pick-Up and Delivery Problem by Helicopter. Bio-inspired Algorithms for the Vehicle Routing Problem, 161, Springer Berlin Heidelberg, pp.173-190, 2009, Studies in Computational Intelligence, ⟨10.1007/978-3-540-85152-3_8⟩. ⟨hal-02477515⟩