Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 871242, 12 pages
http://dx.doi.org/10.1155/2014/871242
Research Article

Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

Department of Industrial Engineering, Uludag University, Görükle Campus, 16059 Bursa, Turkey

Received 10 December 2013; Accepted 18 January 2014; Published 27 February 2014

Academic Editors: A. Bartoszewicz and B. Ivorra

Copyright © 2014 Alkın Yurtkuran and Erdal Emel. 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. E. K. Baker, “Technical note—an exact algorithm for the time-constrained traveling salesman problem,” Operations Research, vol. 31, no. 5, pp. 938–945, 1983. View at Google Scholar · View at Scopus
  2. M. W. P. Savelsbergh, “Local search in routing problems with time windows,” Annals of Operations Research, vol. 4, no. 1, pp. 285–305, 1985. View at Publisher · View at Google Scholar · View at Scopus
  3. Y. Dumas, J. Desrosiers, E. Gelinas, and M. M. Solomon, “An optimal algorithm for the traveling salesman problem with time windows,” Operations Research, vol. 43, no. 2, pp. 367–371, 1995. View at Publisher · View at Google Scholar
  4. A. Langevin, M. Desrochers, J. Desrosiers, S. Gélinas, and F. Soumis, “A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows,” Networks, vol. 23, no. 7, pp. 631–640, 1993. View at Google Scholar
  5. N. Ascheuer, M. Fischetti, and M. Grötschel, “Solving the asymmetric travelling salesman problem with time windows by branch-and-cut,” Mathematical Programming B, vol. 90, no. 3, pp. 475–506, 2001. View at Google Scholar · View at Scopus
  6. E. Balas and N. Simonetti, “Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study,” INFORMS Journal on Computing, vol. 13, no. 1, pp. 56–75, 2001. View at Google Scholar · View at Scopus
  7. F. Focacci, A. Lodi, and M. Milano, “A hybrid exact algorithm for the TSPTW,” INFORMS Journal on Computing, vol. 14, no. 4, pp. 403–417, 2002. View at Publisher · View at Google Scholar
  8. G. Pesant, M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau, “An exact constraint logic programming algorithm for the traveling salesman problem with time windows,” Transportation Science, vol. 32, no. 1, pp. 12–29, 1998. View at Google Scholar · View at Scopus
  9. W. B. Carlton and J. Wesley Barnes, “Solving the traveling-salesman problem with time windows using tabu search,” IIE Transactions, vol. 28, no. 8, pp. 617–629, 1996. View at Google Scholar · View at Scopus
  10. M. Gendreau, A. Hertz, G. Laporte, and M. Stan, “A generalized insertion heuristic for the traveling salesman problem with time windows,” Operations Research, vol. 46, no. 3, pp. 330–335, 1998. View at Google Scholar · View at Scopus
  11. R. W. Calvo, “New heuristic for the traveling salesman problem with time windows,” Transportation Science, vol. 34, no. 1, pp. 113–124, 2000. View at Google Scholar · View at Scopus
  12. R. F. Da Silva and S. Urrutia, “A General VNS heuristic for the traveling salesman problem with time windows,” Discrete Optimization, vol. 7, no. 4, pp. 203–211, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. J. W. Ohlmann and B. W. Thomas, “A compressed-annealing heuristic for the traveling salesman problem with time windows,” INFORMS Journal on Computing, vol. 19, no. 1, pp. 80–90, 2007. View at Publisher · View at Google Scholar · View at Scopus
  14. M. López-Ibáñez and C. Blum, “Beam-ACO for the travelling salesman problem with time windows,” Computers and Operations Research, vol. 37, no. 9, pp. 1570–1583, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. Ş. İ. Birbil and S.-C. Fang, “An electromagnetism-like mechanism for global optimization,” Journal of Global Optimization, vol. 25, no. 3, pp. 263–282, 2003. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Wu, W.-H. Yang, and N.-C. Wei, “An electromagnetism algorithm of neural network analysis: an application to textile retail operation,” Journal of the Chinese Institute of Industrial Engineers, vol. 21, no. 1, pp. 59–67, 2004. View at Google Scholar · View at Scopus
  17. Ş. İ. Birbil and O. Feyzioğlu, “A global optimization method for solving fuzzy relation equations,” in Fuzzy Sets and Systems-IFSA, pp. 718–724, Springer, Berlin, Germany, 2003. View at Google Scholar
  18. D. Debels, B. De Reyck, R. Leus, and M. Vanhoucke, “A hybrid scatter search/electromagnetism meta-heuristic for project scheduling,” European Journal of Operational Research, vol. 169, no. 2, pp. 638–653, 2006. View at Publisher · View at Google Scholar · View at Scopus
  19. C.-S. Tsou and C.-H. Kao, “Multi-objective inventory control using electromagnetism-like meta-heuristic,” International Journal of Production Research, vol. 46, no. 14, pp. 3859–3874, 2008. View at Publisher · View at Google Scholar · View at Scopus
  20. B. Maenhout and M. Vanhoucke, “An electromagnetic meta-heuristic for the nurse scheduling problem,” Journal of Heuristics, vol. 13, no. 4, pp. 359–385, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. J.-Y. Jhang and K.-C. Lee, “Array pattern optimization using electromagnetism-like algorithm,” AEU-International Journal of Electronics and Communications, vol. 63, no. 6, pp. 491–496, 2009. View at Publisher · View at Google Scholar · View at Scopus
  22. P.-C. Chang, S.-H. Chen, and C.-Y. Fan, “A hybrid electromagnetism-like algorithm for single machine scheduling problem,” Expert Systems with Applications, vol. 36, no. 2, pp. 1259–1267, 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. P. Wu, K.-J. Yang, and B.-Y. Huang, “A revised EM-like mechanism for solving the vehicle routing problems,” in Proceedings of the IEEE 2nd International Conference on Innovative Computing, Information and Control (ICICIC '07), Kumamoto, Japan, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  24. A. Yurtkuran and E. Emel, “A new hybrid electromagnetism-like algorithm for capacitated vehicle routing problems,” Expert Systems with Applications, vol. 37, no. 4, pp. 3427–3433, 2010. View at Publisher · View at Google Scholar · View at Scopus
  25. Z. Naji-Azimi, P. Toth, and L. Galli, “An electromagnetism metaheuristic for the unicost set covering problem,” European Journal of Operational Research, vol. 205, no. 2, pp. 290–300, 2010. View at Publisher · View at Google Scholar · View at Scopus
  26. A. Garcia-Villoria and R. P. Moreno, “Solving the response time variability problem by means of the electromagnetism-like mechanism,” International Journal of Production Research, vol. 48, no. 22, pp. 6701–6714, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. X. Guan, X. Dai, and J. Li, “Revised electromagnetism-like mechanism for flow path design of unidirectional AGV systems,” International Journal of Production Research, vol. 49, no. 2, pp. 401–429, 2011. View at Publisher · View at Google Scholar · View at Scopus
  28. A. Jamili, M. A. Shafia, and R. Tavakkoli-Moghaddam, “A hybridization of simulated annealing and electromagnetism-like mechanism for a periodic job shop scheduling problem,” Expert Systems with Applications, vol. 38, no. 5, pp. 5895–5901, 2011. View at Publisher · View at Google Scholar · View at Scopus
  29. E. Cuevas, D. Oliva, D. Zaldivar, M. Pérez-Cisneros, and H. Sossa, “Circle detection using electro-magnetism optimization,” Information Sciences, vol. 182, no. 1, pp. 40–55, 2012. View at Publisher · View at Google Scholar · View at Scopus
  30. C.-T. Su and H.-C. Lin, “Applying electromagnetism-like mechanism for feature selection,” Information Sciences, vol. 181, no. 5, pp. 972–986, 2011. View at Publisher · View at Google Scholar · View at Scopus
  31. C.-H. Lee and F.-K. Chang, “Fractional-order PID controller optimization via improved electromagnetism-like algorithm,” Expert Systems with Applications, vol. 37, no. 12, pp. 8871–8878, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. P. Godinho and F. G. Branco, “Adaptive policies for multi-mode project scheduling under uncertainty,” European Journal of Operational Research, vol. 216, no. 3, pp. 553–562, 2012. View at Publisher · View at Google Scholar · View at Scopus
  33. C.-H. Lee and Y.-C. Lee, “Nonlinear systems design by a novel fuzzy neural system via hybridization of electromagnetism-like mechanism and particle swarm optimisation algorithms,” Information Sciences, vol. 186, no. 1, pp. 59–72, 2012. View at Publisher · View at Google Scholar · View at Scopus
  34. J. C. Bean, “Genetic algorithms and random keys for sequencing and optimization,” ORSA Journal on Computing, vol. 6, no. 2, pp. 154–160, 1994. View at Publisher · View at Google Scholar
  35. J.-Y. Potvin and S. Bengio, “The vehicle routing problem with time windows part II: genetic search,” INFORMS Journal on Computing, vol. 8, no. 2, pp. 165–172, 1996. View at Google Scholar · View at Scopus
  36. 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 Google Scholar · View at Scopus
  37. J. J. Dongarra, Performance of Various Computers Using Standard Linear Equations Software, Department of Computer Science, University of Tennessee, 1989.