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

Minimization of the Total Traveling Distance and Maximum Distance by Using a Transformed-Based Encoding EDA to Solve the Multiple Traveling Salesmen Problem

Department of Information Management, Cheng Shiu University, No. 840, Chengcing Road, Niaosong District, Kaohsiung 83347, Taiwan

Received 15 May 2015; Revised 7 August 2015; Accepted 18 August 2015

Academic Editor: Jason Gu

Copyright © 2015 S. H. Chen. 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. L. Ke, Q. Zhang, and R. Battiti, “MOEA/D-ACO: a multiobjective evolutionary algorithm using decomposition and AntColony,” IEEE Transactions on Cybernetics, vol. 43, no. 6, pp. 1845–1859, 2013. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Ceberio, E. Irurozki, A. Mendiburu, and J. A. Lozano, “A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems,” Progress in Artificial Intelligence, vol. 1, no. 1, pp. 103–117, 2012. View at Publisher · View at Google Scholar
  3. M. Hauschild and M. Pelikan, “An introduction and survey of estimation of distribution algorithms,” Swarm and Evolutionary Computation, vol. 1, no. 3, pp. 111–128, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. Q.-K. Pan and R. Ruiz, “An estimation of distribution algorithm for lot-streaming flow shop problems with setup times,” Omega, vol. 40, no. 2, pp. 166–180, 2012. View at Publisher · View at Google Scholar · View at Scopus
  5. A. Zhou, F. Gao, and G. Zhang, “A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems,” Computers & Mathematics with Applications, vol. 66, no. 10, pp. 1857–1868, 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. Q. Zhang, J. Sun, and E. Tsang, “An evolutionary algorithm with guided mutation for the maximum clique problem,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 2, pp. 192–200, 2005. View at Publisher · View at Google Scholar · View at Scopus
  7. S.-H. Chen, M.-C. Chen, P.-C. Chang, Q. Zhang, and Y.-M. Chen, “Guidelines for developing effective Estimation of Distribution Algorithms in solving single machine scheduling problems,” Expert Systems with Applications, vol. 37, no. 9, pp. 6441–6451, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. Y. Zhang and X. Li, “Estimation of distribution algorithm for permutation flow shops with total flowtime minimization,” Computers & Industrial Engineering, vol. 60, no. 4, pp. 706–718, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. S.-H. Chen and M.-C. Chen, “Addressing the advantages of using ensemble probabilistic models in Estimation of Distribution Algorithms for scheduling problems,” International Journal of Production Economics, vol. 141, no. 1, pp. 24–33, 2013. View at Publisher · View at Google Scholar · View at Scopus
  10. V. A. Shim, K. C. Tan, and C. Y. Cheong, “A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem,” IEEE Transactions on Systems, Man and Cybernetics C: Applications and Reviews, vol. 42, no. 5, pp. 682–691, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. T. Bektas, “The multiple traveling salesman problem: an overview of formulations and solution procedures,” Omega, vol. 34, no. 3, pp. 209–219, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. S.-H. Chen, P.-C. Chang, T. C. E. Cheng, and Q. Zhang, “A self-guided genetic algorithm for permutation flowshop scheduling problems,” Computers & Operations Research, vol. 39, no. 7, pp. 1450–1457, 2012. View at Publisher · View at Google Scholar · View at Scopus
  13. A. E. Carter and C. T. Ragsdale, “A new approach to solving the multiple traveling salesperson problem using genetic algorithms,” European Journal of Operational Research, vol. 175, no. 1, pp. 246–257, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. B. Gavish and K. Srikanth, “An optimal solution method for large-scale multiple traveling salesmen problems,” Operations Research, vol. 34, no. 5, pp. 698–717, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. G. Laporte and Y. Nobert, “A cutting planes algorithm for the m-salesmen problem,” Operational Research Society Journal, vol. 31, no. 11, pp. 1017–1023, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  16. D. L. Miller and J. F. Pekny, “Exact solution of large asymmetric traveling salesman problems,” Science, vol. 251, no. 4995, pp. 754–761, 1991. View at Publisher · View at Google Scholar · View at Scopus
  17. L. Tang, J. Liu, A. Rong, and Z. Yang, “A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex,” European Journal of Operational Research, vol. 124, no. 2, pp. 267–282, 2000. View at Google Scholar · View at Scopus
  18. C. J. Malmborg, “A genetic algorithm for service level based vehicle scheduling,” European Journal of Operational Research, vol. 93, no. 1, pp. 121–134, 1996. View at Publisher · View at Google Scholar · View at Scopus
  19. Y.-B. Park, “A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines,” International Journal of Production Economics, vol. 73, no. 2, pp. 175–188, 2001. View at Publisher · View at Google Scholar · View at Scopus
  20. E. C. Brown, C. T. Ragsdale, and A. E. Carter, “A grouping genetic algorithm for the multiple traveling salesperson problem,” International Journal of Information Technology and Decision Making, vol. 6, no. 2, pp. 333–347, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. A. Király and J. Abonyi, “A novel approach to solve multiple traveling sales-men problem by genetic algorithm,” in Computational Intelligence in Engineering, pp. 141–151, Springer, 2010. View at Google Scholar
  22. A. Singh and A. S. Baghel, “A new grouping genetic algorithm approach to the multiple traveling salesperson problem,” Soft Computing, vol. 13, no. 1, pp. 95–101, 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. J.-P. Arnaout, G. Rabadi, and R. Musa, “A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times,” Journal of Intelligent Manufacturing, vol. 21, no. 6, pp. 693–701, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. S.-H. Chen and M.-C. Chen, “Operators of the two-part encoding genetic algorithm in solving the multiple traveling salesmen problem,” in Proceedings of the 16th Annual Conference on Technologies and Applications of Artificial Intelligence (TAAI '11), pp. 331–336, November 2011. View at Publisher · View at Google Scholar · View at Scopus
  25. E. Vallada and R. Ruiz, “A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times,” European Journal of Operational Research, vol. 211, no. 3, pp. 612–622, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. A. H. Kashan, M. H. Kashan, and S. Karimiyan, “A particle swarm optimizer for grouping problems,” Information Sciences, vol. 252, pp. 81–95, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. T. W. Liao, P. C. Chang, R. J. Kuo, and C.-J. Liao, “A comparison of five hybrid metaheuristic algorithms for unrelated parallel-machine scheduling and inbound trucks sequencing in multi-door cross docking systems,” Applied Soft Computing, vol. 21, pp. 180–193, 2014. View at Publisher · View at Google Scholar · View at Scopus
  28. R. Ruiz and C. Maroto, “A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility,” European Journal of Operational Research, vol. 169, no. 3, pp. 781–800, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. P.-C. Chang and S.-H. Chen, “Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times,” Applied Soft Computing, vol. 11, no. 1, pp. 1263–1274, 2011. View at Publisher · View at Google Scholar · View at Scopus
  30. S.-Y. Wang, L. Wang, M. Liu, and Y. Xu, “An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem,” International Journal of Production Economics, vol. 145, no. 1, pp. 387–396, 2013. View at Publisher · View at Google Scholar · View at Scopus
  31. A. Salhi, J. A. V. Rodríguez, and Q. Zhang, “An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem,” in Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference (GECCO '07), pp. 570–576, ACM, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  32. M. Pelikan, D. E. Goldberg, and F. G. Lobo, “A survey of optimization by building and using probabilistic models,” Computational Optimization and Applications, vol. 21, no. 1, pp. 5–20, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. J. A. Lozano, P. Larranaga, and I. Inza, Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms, Springer, Berlin, Germany, 2006.
  34. P.-C. Chang, S.-S. Chen, and C.-Y. Fan, “Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems,” Applied Soft Computing Journal, vol. 8, no. 1, pp. 767–777, 2008. View at Publisher · View at Google Scholar · View at Scopus
  35. J. L. Shapiro, “Diversity loss in general estimation of distribution algorithms,” in Parallel Problem Solving from Nature—PPSN IX, vol. 4193 of Lecture Notes in Computer Science, pp. 92–101, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  36. J. Branke, C. Lode, and J. L. Shapiro, “Addressing sampling errors and diversity loss in UMDA,” in Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference (GECCO '07), pp. 508–515, ACM, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  37. B. Jarboui, M. Eddaly, and P. Siarry, “An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems,” Computers and Operations Research, vol. 36, no. 9, pp. 2638–2646, 2009. View at Publisher · View at Google Scholar · View at Scopus
  38. P. Hansen and N. Mladenovi, “Variable neighborhood search: principles and applications,” European Journal of Operational Research, vol. 130, no. 3, pp. 449–467, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  39. S. Chen, P. Chang, Q. Zhang, and C. Wang, “A guided memetic algorithm with probabilistic models,” International Journal of Innovative Computing, Information and Control, vol. 5, no. 12, pp. 4753–4764, 2009. View at Google Scholar
  40. S. Chen, P. C. Chang, M. C. Chen, and Y. M. Chen, “A self-guided genetic algorithm with dominance properties for single machine scheduling problems,” in Proceedings of the IEEE Symposium on Computational Intelligence in Scheduling (CI-Sched '09), pp. 76–83, IEEE, Nashville, Tenn, USA, April 2009. View at Publisher · View at Google Scholar · View at Scopus
  41. S.-H. Chen, P.-C. Chang, T. C. E. Cheng, and Q. Zhang, “A self-guided genetic algorithm for permutation flowshop scheduling problems,” Computers and Operations Research, vol. 39, no. 7, pp. 1450–1457, 2012. View at Publisher · View at Google Scholar · View at Scopus
  42. I. Good, The Estimation of Probabilities: An Essay on Modern Bayesian Methods, The MIT Press, 2003.
  43. J. Han and M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2006.
  44. B. Cestnik, “Estimating probabilities: a crucial task in machine learning,” in Proceedings of the 9th European Conference on Artificial Intelligence, pp. 147–149, 1990.
  45. S. Baluja and S. Davies, “Fast probabilistic modeling for combinatorial optimization,” in Proceedings of the 15th National Conference on Artificial Intelligence, pp. 469–476, John Wiley & Sons Inc, July 1998. View at Scopus
  46. Y. Chan and S. F. Baker, “The multiple depot, multiple traveling salesmen facility-location problem: vehicle range, service frequency, and heuristic implementations,” Mathematical and Computer Modelling, vol. 41, no. 8-9, pp. 1035–1053, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  47. S. Ghafurian and N. Javadian, “An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems,” Applied Soft Computing Journal, vol. 11, no. 1, pp. 1256–1262, 2011. View at Publisher · View at Google Scholar · View at Scopus
  48. S. Yadlapalli, W. A. Malik, S. Darbha, and M. Pachter, “A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem,” Nonlinear Analysis: Real World Applications, vol. 10, no. 4, pp. 1990–1999, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  49. S. Gorenstein, “Printing press scheduling for multi-edition periodicals,” Management Science, vol. 16, no. 6, pp. 373–383, 1970. View at Publisher · View at Google Scholar · View at Scopus
  50. A. E. Carter and C. T. Ragsdale, “Scheduling pre-printed newspaper advertising inserts using genetic algorithms,” Omega, vol. 30, no. 6, pp. 415–421, 2002. View at Publisher · View at Google Scholar · View at Scopus
  51. J. A. Svestka and V. E. Huckfeldt, “Computational experience with an m-salesman traveling salesman algorithm,” Management Science, vol. 19, no. 7, pp. 790–799, 1973. View at Publisher · View at Google Scholar
  52. J. K. Lenstra and A. H. G. R. Kan, “Some simple applications of the travelling salesman problem,” Operational Research Quarterly, vol. 26, no. 4, pp. 717–733, 1975. View at Publisher · View at Google Scholar · View at Scopus
  53. T. Zhang, W. A. Gruver, and M. H. Smith, “Team scheduling by genetic search,” in Proceedings of the 2nd International Conference on Intelligent Processing and Manufacturing of Materials (IPMM '99), vol. 2, pp. 839–844, Honolulu, Hawaii, USA, 1999. View at Publisher · View at Google Scholar
  54. K. C. Gilbert and R. B. Hofstra, “A new multiperiod multiple traveling salesman problem with heuristic and application to a scheduling problem,,” Decision Sciences, vol. 23, no. 1, pp. 250–259, 1992. View at Publisher · View at Google Scholar
  55. C. Okonjo-Adigwe, “An effective method of balancing the workload amongst salesmen,” Omega, vol. 16, no. 2, pp. 159–163, 1988. View at Publisher · View at Google Scholar · View at Scopus
  56. R. Wolfler Calvo and R. Cordone, “A heuristic approach to the overnight security service problem,” Computers & Operations Research, vol. 30, no. 9, pp. 1269–1287, 2003. View at Publisher · View at Google Scholar · View at Scopus
  57. R. D. Angel, W. L. Caudle, R. Noonan, and A. Whinston, “Computer-assisted school bus scheduling,” Management Science, vol. 18, no. 6, pp. 279–288, 1972. View at Publisher · View at Google Scholar
  58. K. H. Kim and Y.-M. Park, “A crane scheduling method for port container terminals,” European Journal of Operational Research, vol. 156, no. 3, pp. 752–768, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  59. X. Wang and A. C. Regan, “Local truckload pickup and delivery with hard time window constraints,” Transportation Research Part B: Methodological, vol. 36, no. 2, pp. 97–112, 2002. View at Publisher · View at Google Scholar · View at Scopus
  60. X. Gan, Y. Wang, S. Li, and B. Niu, “Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO,” Mathematical Problems in Engineering, vol. 2012, Article ID 104279, 11 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  61. X. Gan, Y. Wang, J. Kuang, Y. Yu, and B. Niu, “Emergency vehicle scheduling problem with time utility in disasters,” Mathematical Problems in Engineering, vol. 2015, Article ID 164194, 7 pages, 2015. View at Publisher · View at Google Scholar
  62. B. Brumitt and A. Stentz, “Dynamic mission planning for multiple mobile robots,” Intelligent Unmanned Ground Vehicles, vol. 388, pp. 221–234, 1997. View at Google Scholar
  63. B. L. Brumitt and A. Stentz, “GRAMMPS: a generalized mission planner for multiple mobile robots in unstructured environments,” in Proceedings of the IEEE International Conference on Robotics and Automation, vol. 2, pp. 1564–1571, IEEE, May 1998. View at Scopus
  64. Z. Yu, L. Jinhai, G. Guochang, Z. Rubo, and Y. Haiyan, “An implementation of evolutionary computation for path planning of cooperative mobile robots,” in Proceedings of the 4th World Congress on Intelligent Control and Automation, vol. 3, pp. 1798–1802, IEEE, 2002.
  65. A. Basu, A. Elnagar, and R. Al-Hajj, “Efficient coordinated motion,” Mathematical and Computer Modelling, vol. 31, no. 2-3, pp. 39–53, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  66. J. L. Ryan, T. G. Bailey, J. T. Moore, and W. B. Carlton, “Reactive Tabu Search in unmanned aerial reconnaissance simulations,” in Proceedings of the 30th Conference on Winter Simulation, pp. 873–880, IEEE Computer Society Press, December 1998. View at Scopus
  67. H. A. Saleh and R. Chelouah, “The design of the global navigation satellite system surveying networks using genetic algorithms,” Engineering Applications of Artificial Intelligence, vol. 17, no. 1, pp. 111–122, 2004. View at Publisher · View at Google Scholar · View at Scopus