A Hybrid Water Flow-Like Algorithm and Variable Neighbourhood Search for Traveling Salesman Problem
How to cite (IJASEIT) :
Da Silva, R. F., & Urrutia, S. (2010). A General VNS heuristic for the traveling salesman problem with time windows. Discrete Optimization, 7(4).
Frieze, A. M., Galbiati, G., & Maffioli, F. (1982). On the worst”case performance of some algorithms for the asymmetric traveling salesman problem. Networks, 12(1), 23-39.
Xiong, N., Wu, W., & Wu, C. (2017). An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks. Sustainability, 9(6), 985.
Lin, B. L., Sun, X., & Salous, S. (2016). Solving travelling salesman problem with an improved hybrid genetic algorithm. Journal of computer and communications., 4(15), 98-106.
Xue-hui, L., Ye, Y., & Xia, L. (2008). Solving TSP with Shuffled Frog-Leaping Algorithm. In Proceedings - 8th International Conference on Intelligent Systems Design and Applications, ISDA 2008.
Sakiyama, T., & Arizono, I. (2017). Can the Agent with Limited Information Solve Travelling Salesman Problem?. Complexity, 2017, Article ID 9562125, 6 pages.
Papalitsas, C., Karakostas, P., Andronikos, T., Sioutas, S., & Giannakis, K. (2018). Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection. Algorithms, 11(4), 38.
Bostamam, J. M., & Othman, Z. (2016). Hybrid water flow-like algorithm with Tabu search for traveling salesman problem. In AIP Conference Proceedings (Vol. 1761). American Institute of Physics.
Bingí¼ler, A. Hande Erol and Bulkan, Serol (2015). New Variable Neighborhood Search Structure for Travelling Salesman Problems. British Journal of Mathematics & Computer Science 6(5): 422-434, 2015, Article no.BJMCS.2015.088.
Zia, M., Cakir, Z., & Seker, D. Z. (2018). Spatial Transformation of Equality-Generalized Travelling Salesman Problem to Travelling Salesman Problem. ISPRS International Journal of Geo-Information, 7(3), 115.
Yang, X.-S. (2010). Nature-Inspired Metaheuristic Algorithms. Nature-Inspired Metaheuristic Algorithms Second Edition (p. 115).
Drí©o, J., Pí©trowski, A., & Taillard, E. (2006). Metaheuristics for Hard Optimization. Vasa (p. 382).
Alzaqebah, M., & Abdullah, S. (2015). Hybrid bee colony optimization for examination timetabling problems. Computers and Operations Research, 54, 142-154.
Wang, X., Mu, A. & Zhu, S. (2013) ISPO: A New Way to Solve Traveling Salesman Problem. Intelligent Control and Automation, 4, 122-125.
Yang, F. C., & Wang, Y. P. (2007). Water flow-like algorithm for object grouping problems. Journal of the Chinese Institute of Industrial Engineers, 24(6), 475-488.
Wu, T.H., Chung, S.H., And Chang, C.C., "A Water Flow-Like Algorithm For Manufacturing Cell Formation Problems". European Journal Of Operational Research, Vol. 205, No. 2, pp. 346-360, 2010.
Shahnazari-Shahrezaei, P., Tavakkoli-Moghaddam, R., Azarkish, M., & Sadeghnejad-Barkousaraie, A. (2012). a Differential Evolution Algorithm Developed for a Nurse Scheduling Problem. South African Journal of Industrial Engineering, 23(3), 68-90.
Srour, A., (2014). Water flow-like algorithm for travelling salesman problem and web service selection problem,” Ph.D thesis, University Kebangsaan Malaysia.
Abdullah, S., Burke, E. K., & Mccollum, B. (2005, July). An investigation of variable neighbourhood search for university course timetabling. In The 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA) (pp. 413-427).
Burke, E. K., Causmaecker, P. D., Petrovic, S., & Berghe, G. V. (2001). Fitness evaluation for nurse scheduling problems. Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), 2, 1139-1146.
Hansen, P., & Mladenovic, N. (1997). Variable neighbourhood search. Computers and Operations Research, 24(11), 1097-1100.
Crispim, J., & Brandao, J. (2001, July). Reactive tabu search and variable neighborhood descent applied to the vehicle routing problem with backhauls. In Proceedings of the 4th Metaheuristics International Conference, Porto (Vol. 1101, pp. 631-636).
Crainic, T., & Centre for Research on Transportation (Montrí©al, Quí©bec). (2003). Parallel variable neighborhood search for the p-median. Montrí©al: Groupe d'í©tudes et de recherche en analyse des dí©cisions.
Othman, Z.A., Al-Dhwai, NH, Srour, A., Yi, Wudi., “Water Flow-Like Algorithm with Simulated Annealing for Travelling Salesman Problems’’. Int. J. Advanced Science, Engineering and Information Technology, Vol. 7, No. 2, pp. 669-675, 2017.
Srour, A., Othman, Z. A., & Hamdan, A. R. (2014). A water flow-like algorithm for the travelling salesman problem. Advances in Computer Engineering, 2014, 1-14.
Hansen, P., Mladenović, N., & Moreno Pí©rez, J. A. (2008). Variable neighbourhood search: Methods and applications. 4OR, 6(4), 319-360.
Hansen, P., Mladenović, N., & Moreno Pí©rez, J. A. (2010). Variable neighbourhood search: Methods and applications. Annals of Operations Research, 175(1), 367-407.
Chen, S., Chen, R., & Gao, J. (2017). A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows. Scientific Programming, 2017, Article ID1021432, 13 pages
Rincon-Garcia, N., Waterson, B., & Cherrett, T. (2017). A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows. International Journal of Industrial Engineering Computations, 8(1), 141-160.
Othman, Z. A., Srour, A. I., Hamdan, A. R., & Ling, P. Y. (2013). Performance water flow-like algorithm for TSP by improving its local search. International Journal of Advancements in Computing Technology, 5(14), 126.
Cruz-Chí¡vez, M. A., Martínez-Oropeza, A., del Carmen Peralta-Abarca, J., Cruz-Rosales, M. H., & Martínez-Rangel, M. (2014, June). Variable Neighborhood Search for Non-deterministic Problems. In International Conference on Artificial Intelligence and Soft Computing (pp. 468-478). Springer, Cham.
Kralev, V. (2017). An Analysis of a Recursive and an Iterative Algorithm for Generating Permutations Modified for Travelling Salesman Problem. International Journal on Advanced Science, Engineering and Information Technology, 7(5), 1685-1692.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).