Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 3851520, 11 pages
http://dx.doi.org/10.1155/2016/3851520
Research Article

Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows

Research Center in Engineering and Applied Sciences, Autonomous University of Morelos State, Avenida Universidad 1001, Colonia Chamilpa, 62209 Cuernavaca, MOR, Mexico

Received 23 August 2015; Accepted 17 January 2016

Academic Editor: Panos Liatsis

Copyright © 2016 Marco Antonio Cruz-Chávez and Alina Martínez-Oropeza. 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. M. M. Solomon, “Algorithms for the vehicle routing and scheduling problems with time window constraints,” Operations Research, vol. 35, no. 2, pp. 254–265, 1987. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. T. Paolo and V. Daniele, The Vehicle Routing Problem, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 2002.
  3. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover Publications, Mineola, NY, USA, 1998.
  4. A. Garcia-Najera and J. A. Bullinaria, “An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows,” Computers & Operations Research, vol. 38, no. 1, pp. 287–300, 2010. View at Publisher · View at Google Scholar · View at Scopus
  5. T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, “A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows,” Computers & Operations Research, vol. 40, no. 1, pp. 475–489, 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. Y. Deng, J. Xiang, and Z. Ou, “Improvement of genetic algorithm for vehicle routing problems with time windows,” in Proceedings of the 3rd International Conference on Intelligent System Design and Engineering Applications (ISDEA '13), pp. 866–869, IEEE, Hong Kong, January 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. M. Lozano, F. Herrera, and J. R. Cano, “Replacement strategies to preserve useful diversity in steady-state genetic algorithms,” Information Sciences, vol. 178, no. 23, pp. 4421–4433, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. G. Deepti and G. Shabina, “An overview of methods maintaining diversity in genetic algorithms,” International Journal of Emerging Technology and Advanced Engineering, vol. 2, no. 5, 2012. View at Google Scholar
  9. S. Gavriel, Handbook of Industrial Engineering. Technology and Operations Management, Institute of Industrial Engineers, Norcross, GA, USA, 3rd edition, 2001.
  10. V. Pureza, R. Morabito, and M. Reimann, “Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW,” European Journal of Operational Research, vol. 218, no. 3, pp. 636–647, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. A. M. Campbell and M. Savelsbergh, “Efficient insertion heuristics for vehicle routing and scheduling problems,” Transportation Science, vol. 38, no. 3, pp. 369–378, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, NY, USA, 1979.
  13. P. A. Diaz-Gómez and D. F. Hougen, “Empirical study: initial population diversity and genetic algorithm performance,” in Proceedings of the International Conference on Artificial Intelligence and Pattern Recognition (AIPR '07), pp. 334–341, July 2007. View at Scopus
  14. P. A. Diaz-Gómez and D. F. Hougen, “Initial population for genetic algorithms: a metric approach,” in Proceedings of the International Conference on Genetic and Evolutionary Methods (GEM '07), Las Vegas, Nev, USA, June 2007.
  15. P. Annibale, O. Rocco, D. Massimiliano, and D. Andrea, “Improving multi-objective test case selection by injecting diversity in genetic algorithms,” IEEE Transactions on Software Engineering, vol. 41, no. 4, pp. 358–383, 2014. View at Publisher · View at Google Scholar
  16. P.-C. Chang, W.-H. Huang, and C.-J. Ting, “Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems,” Expert Systems with Applications, vol. 37, no. 3, pp. 1863–1878, 2010. View at Publisher · View at Google Scholar · View at Scopus
  17. C. A. F. Anselmo and A. Pinheiro, “Phylogenetic trees via Hamming distance decomposition tests,” Journal of Statistical Computation and Simulation, vol. 82, no. 9, pp. 1287–1297, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. M. Yang and C. Li, “Differencial evolution with auto-enhanced population diversity,” IEEE Transactions on Cybernetics, vol. 45, no. 2, pp. 302–315, 2014. View at Publisher · View at Google Scholar
  19. E. K. Burke, S. Gustafson, and G. Kendall, “Diversity in genetic programming: an analysis of measures and correlation with fitness,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 1, pp. 47–62, 2004. View at Publisher · View at Google Scholar · View at Scopus
  20. S. J. Louis and G. J. E. Rawlins, Predicting Convergence Time for Genetic Algorithms, Foundations of Genetic Algorithms, 1992.
  21. H. P. Pinheiro, A. de Souza Pinheiro, and P. K. Sen, “Comparison of genomic sequences using the Hamming distance,” Journal of Statistical Planning and Inference, vol. 130, no. 1-2, pp. 325–339, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  22. A. K. Jain, M. N. Murty, and P. J. Flynn, “Data clustering: a review,” ACM Computing Surveys, vol. 31, no. 3, pp. 264–323, 1999. View at Publisher · View at Google Scholar · View at Scopus
  23. A. K. Jain, “Data clustering: 50 years beyond K-means,” Pattern Recognition Letters, vol. 31, no. 8, pp. 651–666, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, “A local search approximation algorithm for k-means clustering,” in Proceedings of the 18th Annual Symposium on Computational Geometry (SCG '02), pp. 10–18, ACM, Barcelona, Spain, June 2002. View at Publisher · View at Google Scholar
  25. H.-V. Edna, Clustering algorithm based on entropy to discover sets of attributes within mix-type attributes [Master Thesis in Sciences with Option in Computing], Department of Electrical Engineering Computing Section, Centro de Investigación y de Estudios Avanzados del IPN, 2006.
  26. W. Hamming Richard, “Error detecting and error correcting codes,” The Bell System Technical Journal, vol. 26, no. 2, pp. 147–160, 1950. View at Google Scholar
  27. S. Ignacimuthu, Basic Bioinformatics, Alpha Science International, New Delhi, India, 2005.
  28. Y. Saad and M. H. Schultz, “Topological properties of hypercubes,” IEEE Transactions on Computers, vol. 37, no. 7, pp. 867–872, 1988. View at Publisher · View at Google Scholar · View at Scopus