A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem

References

• Ben-Arieh, D., G. Gutin, M. Penn, A. Yeo, and A. Zverovitch. 2003. Transformations of Generalized ATSP into ATSP. Operations Research Letters 31 (5):357–65. Elsevier. doi:10.1016/S0167-6377(03)00031-2.
   Web of Science ®Google Scholar
• Benlic, U., and J.-K. Hao. 2012. A study of breakout local search for the minimum sum coloring problem. In Simulated evolution and learning, 128–37. Springer.
   Google Scholar
• Benlic, U., and J.-K. Hao. 2013a. Breakout local search for maximum clique problems. Computers {&} Operations Research 40 (1):192–206. Elsevier {BV}. doi:10.1016/j.cor.2012.06.002.
   Web of Science ®Google Scholar
• Benlic, U., and J.-K. Hao. 2013b. Breakout local search for the quadratic assignment problem. Applied Mathematics and Computation 219 (9):4800–15. Elsevier {BV}. doi:10.1016/j.amc.2012.10.106.
   Web of Science ®Google Scholar
• Benlic, U., and J.-K. Hao. 2013c. Breakout local search for the max-cutproblem. Engineering Applications of Artificial Intelligence 26 (3):1162–73. Elsevier {BV}. doi:10.1016/j.engappai.2012.09.001.
   Web of Science ®Google Scholar
• Bontoux, B., C. Artigues, and D. Feillet. 2010. A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem. Computers & Operations Research 37 (11):1844–52. Elsevier. doi:10.1016/j.cor.2009.05.004.
   Web of Science ®Google Scholar
• Davis, L. 1991. Handbook of Genetic Algorithms.
   Google Scholar
• Fischetti, M., J. J. Salazar Gonzalez, and P. Toth. 1997. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research 45 (3):378–94. INFORMS. doi:10.1287/opre.45.3.378.
   Web of Science ®Google Scholar
• Fu, Z.-H., and J.-K. Hao. 2014. Breakout local search for the steiner tree problem with revenue, budget and hop constraints. European Journal of Operational Research 232 (1):209–20. Elsevier. doi:10.1016/j.ejor.2013.06.048.
   Web of Science ®Google Scholar
• Ghandi, S., and E. Masehian. 2015. A Breakout Local Search (BLS) method for solving the assembly sequence planning problem. Engineering Applications of Artificial Intelligence 39:245–66. Elsevier. doi:10.1016/j.engappai.2014.12.009.
   Web of Science ®Google Scholar
• Glover, F. 1989. Tabu search{\textemdash}part I. {ORSA} Journal on Computing 1 (3):190–206. Institute for Operations Research and the Management Sciences ({INFORMS}). doi:10.1287/ijoc.1.3.190.
   Google Scholar
• Glover, F. 1990. Tabu search{\textemdash}part {II}. {ORSA} Journal on Computing 2 (1):4–32. Institute for Operations Research and the Management Sciences ({INFORMS}). doi:10.1287/ijoc.2.1.4.
   Google Scholar
• Gutin, G., and D. Karapetyan. 2010. A memetic algorithm for the generalized traveling salesman problem. Natural Computing 9 (1):47–60. Springer. doi:10.1007/s11047-009-9111-6.
   Web of Science ®Google Scholar
• Gutin, G., D. Karapetyan, and N. Krasnogor. 2008. Memetic algorithm for the generalized asymmetric traveling salesman problem. In Nature inspired cooperative strategies for optimization (NICSO 2007), 199–210. Springer.
   Google Scholar
• Hart, W. E., N. Krasnogor, and J. E. Smith. 2004. Recent advances in memetic algorithms, vol. 166. Springer Science & Business Media.
   Google Scholar
• Henry-Labordere, A. L. 1969. The record balancing problem: A dynamic programming solution of a generalized travelling salesman problem. RIRO B-2:43–49.
   Google Scholar
• İlhan, İ.. 2017. An Application On mobile devices with android and IOS operating systems using google maps APIs for the traveling salesman problem. Applied Artificial Intelligence 1–14. Taylor & Francis. doi:10.1080/08839514.2017.1339983
   Google Scholar
• Karapetyan, D., and G. Gutin. 2011. Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem. European Journal of Operational Research 208 (3):221–32. Elsevier. doi:10.1016/j.ejor.2010.08.011.
   Web of Science ®Google Scholar
• Karapetyan, D., and G. Gutin. 2012. Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. European Journal of Operational Research 219 (2):234–51. Elsevier. doi:10.1016/j.ejor.2012.01.011.
   Web of Science ®Google Scholar
• Laporte, G., A. Asef-Vaziri, and C. Sriskandarajah. 1996. Some applications of the generalized travelling salesman problem. Journal of the Operational Research Society 47 (12):1461–67. Springer. doi:10.1057/jors.1996.190.
   Web of Science ®Google Scholar
• Laporte, G., and F. Semet. 1999. Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem. INFOR: Information Systems and Operational Research 37 (2):114–20. Taylor & Francis.
   Web of Science ®Google Scholar
• Laporte, G., H. Mercure, and Y. Nobert. 1987. Generalized travelling salesman problem through N sets of nodes: The asymmetrical case. Discrete Applied Mathematics 18 (2):185–97. Elsevier. doi:10.1016/0166-218X(87)90020-5.
   Web of Science ®Google Scholar
• Lourenço, H. R., O. C. Martin, and T. Stutzle. 2001. Iterated local search. arXiv Preprint Math/0102188.
   Google Scholar
• Martin, O., S. W. Otto, and E. W. Felten. 1991. Large-step Markov chains for the traveling salesman problem. Oregon Graduate Institute of Science and Technology, Department of Computer Science and Engineering.
   Google Scholar
• Miller, B. L., and D. E. Goldberg others. 1995. Genetic algorithms, tournament selection, and the effects of noise. Complex Systems 9 (3). [Champaign, IL, USA: Complex Systems Publications, Inc., c1987-… ():193–212. .
   Google Scholar
• Noon, C. E., and J. C. Bean. 1991. A lagrangian based approach for the asymmetric generalized traveling salesman problem. Operations Research 39 (4):623–32. INFORMS. doi:10.1287/opre.39.4.623.
   Web of Science ®Google Scholar
• Noon, C. E., and J. C. Bean. 1993. An efficient transformation of the generalized traveling salesman problem. INFOR: Information Systems and Operational Research 31 (1):39–44. Taylor & Francis.
   Web of Science ®Google Scholar
• Pourhassan, M., and F. Neumann. 2015. On the impact of local search operators and variable neighbourhood search for the generalized travelling salesperson problem. In Proceedings of the 2015 annual conference on genetic and evolutionary computation, 465–72.
   Google Scholar
• Reinelt, G. 1991. {TSPLIB}{\textemdash}A traveling salesman problem library. {ORSA} Journal on Computing 3 (4):376–84. Institute for Operations Research and the Management Sciences ({INFORMS}). doi:10.1287/ijoc.3.4.376.
   Google Scholar
• Silberholz, J., and B. Golden. 2007. The generalized traveling salesman problem: A new genetic algorithm approach. In Extending the horizons: Advances in computing, optimization, and decision technologies, 165–81. Springer.
   Google Scholar
• Smith, S. L., and F. Imeson. 2017. GLNS: An effective large neighborhood search heuristic for the generalized traveling salesman problem. Computers & Operations Research 87:1–19. Elsevier. doi:10.1016/j.cor.2017.05.010.
   Web of Science ®Google Scholar
• Snyder, L. V., and M. S. Daskin. 2006. A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational Research 174 (1):38–53. Elsevier. doi:10.1016/j.ejor.2004.09.057.
   Web of Science ®Google Scholar
• Srivastava, S. S., S. Kumar, R. C. Garg, and P. Sen. 1969. Generalized travelling salesman problem through N Sets of Nodes. CORS Journal 7:97–101.
   Google Scholar
• Syswerda, G. 1989. Uniform crossover in genetic algorithms. In Proceedings of the 3rd international conference on genetic algorithms, 2–9. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc. http://dl.acm.org/citation.cfm?id=645512.657265.
   Google Scholar