Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 707056, 12 pages
http://dx.doi.org/10.1155/2015/707056
Research Article

A Hyperheuristic for the Dial-a-Ride Problem with Time Windows

1Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2950, 2340025 Valparaíso, Chile
2Escuela de Ingeniería Comercial, Universidad de Valparaíso, Pasaje La Paz 1301, 2531075 Viña del Mar, Chile

Received 25 September 2014; Accepted 15 December 2014

Academic Editor: Haipeng Peng

Copyright © 2015 Enrique Urra et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J.-F. Cordeau and G. Laporte, “The dial-a-ride problem (DARP): variants, modeling issues and algorithms,” Quarterly Journal of the Belgian, French and Italian Operations Research Societies, vol. 1, no. 2, pp. 89–101, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. R. M. Jorgensen, J. Larsen, and K. B. Bergvinsdottir, “Solving the dial-a-ride problem using genetic algorithms,” Journal of the Operational Research Society, vol. 58, no. 10, pp. 1321–1331, 2007. View at Publisher · View at Google Scholar · View at Scopus
  3. G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia, and G. Laporte, “Static pickup and delivery problems: a classification scheme and survey,” TOP, vol. 15, no. 1, pp. 1–31, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  4. C. Cubillos, F. Guidi-Polanco, and C. Demartini, Applying Genetic Algorithms to the Dial-A-Ride Problem, WSEAS, Turin, Italy, 2004, http://www.worldses.org/online/.
  5. C. Cubillos, E. Urra, and N. Rodríguez, “Application of genetic algorithms for the DARPTW problem,” International Journal of Computers, Communications and Control, vol. 4, no. 2, pp. 127–136, 2009. View at Google Scholar · View at Scopus
  6. G. R. Mauri and L. A. N. Lorena, “A multiobjective model and simulated annealing approach for a dial-a-ride problem,” in Workshopdos Cursos de Computação, 2006.
  7. I. Zidi, K. Zidi, K. Mesghouni, and K. Ghedira, “A multi-agent system based on the multi-objective simulated annealing algorithm for the static dial a ride problem,” in Proceedings of the 18th World Congress of the International Federation of Automatic Control (IFAC '11), Milan, Italy, 2011.
  8. K. Sörensen and F. W. Glover, “Metaheuristics,” in Encyclopedia of Operations Research and Management Science, S. I. Gass and M. C. Fu, Eds., pp. 960–970, Springer, Boston, Mass, USA, 2013. View at Publisher · View at Google Scholar
  9. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and R. John Woodward, “A classiffication of hyper-heuristics approaches,” in Handbook of Metaheuristics, M. Gendreau and J.-Y. Potvin, Eds., vol. 57 of International Series in Operations Research & Management Science, pp. 449–468, Springer, New York, NY, USA, 2nd edition.
  10. K. Chakhlevitch and P. Cowling, “Hyperheuristics: recent developments,” in Adaptive and Multilevel Metaheuristics, C. Cotta, M. Sevaux, and K. Sorensen, Eds., vol. 136 of Studies in Computational Intelligence, pp. 3–29, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  11. P. Cowling, G. Kendall, and E. Soubeiga, “Hyperheuristics: a tool for rapid prototyping in scheduling and optimisation,” in Applications of Evolutionary Computing, S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, and G. Raidl, Eds., vol. 2279 of Lecture Notes in Computer Science, pp. 1–10, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar
  12. E. K. Burke, M. Gendreau, M. Hyde et al., “Hyper-heuristics: a survey of the state of the art,” Journal of the Operational Research Society, vol. 64, no. 12, pp. 1695–1724, 2013. View at Publisher · View at Google Scholar · View at Scopus
  13. R. R. S. van Lon, T. Holvoet, G. V. Berghe, T. Wenseleers, and J. Branke, “Evolutionary synthesis of multi-agent systems for dynamic Dial-A-Ride problems,” in Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO '12), F. Stonedahl and R. Riolo, Eds., pp. 331–336, ACM, Philadelphia, Pa, USA, 2012. View at Publisher · View at Google Scholar
  14. P. Garrido and M. C. Riff, “DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic,” Journal of Heuristics, vol. 16, no. 6, pp. 795–834, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. S. Luke, Essentials of Metaheuristics, Lulu Press, 2009.
  16. C. Blum and A. Roli, “Metaheuristics in combinatorial optimization: over view and conceptual comparison,” ACM Computing Surveys, vol. 35, no. 3, pp. 268–308, 2003. View at Publisher · View at Google Scholar
  17. E. Burke, G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg, “Hyper-heuristics: an emerging direction in modern search technology,” in Handbook of Metaheuristics, vol. 57 of International Series in Operations Research & Management Science, chapter 16, pp. 457–474, Springer, 2003. View at Google Scholar
  18. J. Swan, J. Woodward, E. Özcan, G. Kendall, and E. Burke, “Searching the hyper-heuristic design space,” Cognitive Computation, vol. 6, no. 1, pp. 66–73, 2014. View at Publisher · View at Google Scholar · View at Scopus
  19. E. Özcan, B. Bilgin, and E. E. Korkmaz, “A comprehensive analysis of hyper-heuristics,” Intelligent Data Analysis, vol. 12, no. 1, pp. 3–23, 2008. View at Google Scholar
  20. P. Cowling, G. Kendall, and E. Soubeiga, “A hyperheuristic approach to scheduling a sales summit,” in Practice and Theory of Automated Timetabling III, vol. 2079 of Lecture Notes in Computer Science, pp. 176–190, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  21. M. Ayob and G. Kendall, “A monte carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine,” in Proceedings of the International Conference on Intelligent Technologies (INTECH '03), pp. 132–141, Chiang Mai, Thailand, 2003.
  22. J.-F. Cordeau and G. Laporte, “A tabu search heuristic for the static multi-vehicle dial-a-ride problem,” Transportation Research Part B: Methodological, vol. 37, no. 6, pp. 579–594, 2003. View at Publisher · View at Google Scholar · View at Scopus
  23. E. Urra, D. Cabrera-Paniagua, and C. Cubillos, “Towards an object-oriented pattern proposal for heuristic structures of diverse abstraction levels,” in Proceedings of the Workshop on Agents and Collaborative Systems (WACS '11), School of Computer Engineering, Catholic University of Temuco, Temuco, Chile, 2013.
  24. G. Kendall, E. Soubeiga, and P. Cowling, Choice Function and Random Hyperheuristics, 2002, http://citeseer.ist.psu.edu/547597.html, http://www.cs.nott.ac.uk/~gxk/gxk1/../papers/seal01.pdf.
  25. E. Burke and E. Soubeiga, “Scheduling Nurses Using A Tabu -Search Hyperheuristic,” 2003, http://citeseer.ist.psu.edu/713555.html, http://www.mistaconference.org/2003/papers/page197.pdf.
  26. B. Bai, J. Blazewicz, E. Burke, G. Kendall, and B. McCollum, “A simulated annealing hyper-heuristic methodology for flexible decision support,” 4OR: A Quarterly Journal of Operations Research, vol. 10, no. 1, pp. 43–66, 2012. View at Publisher · View at Google Scholar