Summary
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cordeau, J.F., Laporte, G., Potvin, J.-Y., Savelsbergh, M.W.P.: Transportation on demand. In: Barnhart, C., Laporte, G. (eds.) Transportation, Handbooks in Operations Research and Management Science. Elsevier, Amsterdam (2005)
Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F.: VRP with pickup and delivery. In: Toth, P., Vigo, D. (eds.) The vehicle routing problem, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 225–242 (2001)
Fiala-Timlin, M.T., Pulleyblank, W.R.: Precedence constrained routing and helicopter scheduling: Heuristic design. Interfaces 22, 100–111 (1992)
Hjorring, C.A.: The vehicle routing problem and local search metaheuristics. PhD thesis, Department of Engineering Science, The University of Auckland (1995)
Jih, W., Hsu, J.Y.: Dynamic vehicle routing using hybrid genetic algorithms. In: ICRA - International Conference on Robotics and Automation, vol. 1, Detroit, Michigan, pp. 453–458 (1999)
Jung, S., Haghani, A.: Genetic algorithm for a pick-up and delivery problem with time windows. Transportation Research Record, TRB(1733) (2000)
Moscato, P.: Memetic algorithms: A short introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 219–234. McGraw-Hill, New York (1999)
Pankratz, G.: A grouping genetic algorithm for the pick-up and delivery problem with time windows, Department of Business Administration and Economics, Fern Universitat - University of Hagen, Hagen, Germany (2003)
Potter, T., Bossomaier, T.: Solving vehicle routing problems with genetic algorithms. In: ICEC International Conference on Evolutionary Computing, Perth, Australia, vol. 2, pp. 788–793 (1995)
Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31, 1985–2002 (2004)
Prud´Homme, C., Dejax, P., Guéret, C., Velasco, N.: Heuristiques pour un problème réel de tournées d’hélicoptères de type pick-up and delivery. Technical report, École des Mines de Nantes, 04/5/AUTO (2004)
Sol, M., Savelsbergh, M.W.P.: A branch-and-price algorithm for the pickup and delivery problem with time windows. COSOR Memorandum 94-22, Dept. of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands (1994)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1990)
Tijssen, G.A.: Theoretical and practical aspects of linear optimization. PhD thesis, Graduate School/Research Institute, Systems, organization and management. University of Groningen, Netherlands (2000)
Velasco, N., Dejax, P., Guéret, C.: Vehicle routing optimization for the pick-up and delivery: Application to the transport of personnel on oil platforms. EURO XX, Rhodes, Greece (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Velasco, N., Castagliola, P., Dejax, P., Guéret, C., Prins, C. (2009). A Memetic Algorithm for a Pick-Up and Delivery Problem by Helicopter. In: Pereira, F.B., Tavares, J. (eds) Bio-inspired Algorithms for the Vehicle Routing Problem. Studies in Computational Intelligence, vol 161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85152-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-85152-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85151-6
Online ISBN: 978-3-540-85152-3
eBook Packages: EngineeringEngineering (R0)