Advertisement

A Parallel Approach to Optimize the Supply Chain Management

  • Otman Abdoun
  • Yassine MoumenEmail author
  • Ali Daanoun
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 913)

Abstract

The worldwide economic progression in the last century and the Demographic growth has given rise to a huge consumption in the market of goods and services, while globalization decreased the cost of shipping and transportation. The production, transportation, storage and consumption of all these goods, however, have created big environmental problems. Nowadays, global warming, created by large-scale emissions of greenhouse gasses, is a top environmental concern. In this matter, the number of organizations planning to integrate the environmental practices into their future strategic plans is continuously increasing to counter this threat. The environmental benefits of the trend are clear: fewer vehicles burning fuel, crowding urban streets, and taking up valuable parking areas. However, the problem with transportation is that it can be so difficult to choose the perfect path for the vehicle to take if there is many stops to be taking in consideration. Due to the complexity of real world problems, such as supply chain management, finding a good path for vehicles with traditional ways (by using human capabilities) require a long time to satisfy all constraints. Even with machines, this particular problem needs a huge computational power (in term of processing power and memory usage) as well as time to solve. Actually, Parallelism is an approach that not only reduce the resolution time but also improve the quality of the provided solutions. The purpose of this paper is to evaluate the Travelling Salesman Problem (TSP) as a function of forming and optimizing transport networks using an efficient parallelization strategy for the Ant Colony Optimization (ACO) taking the maximum advantage of the parallel architecture offered by NVidia’s Graphics Processing Units (GPUs).

Keywords

GPU Parallel Ant Colony Optimization Sequential Ant Colony Optimization Travelling Salesman Problem CUDA 

References

  1. 1.
    Menger, K.: Ergebnisse eines Kolloquiums 3, 11–12 (1930)Google Scholar
  2. 2.
    Yang, F.: Solving Traveling Salesman Problem Using Parallel Genetic Algorithm and Simulated Annealing (2010)Google Scholar
  3. 3.
    Philip, A., Taofiki, A.A., Kehinde, O.: A genetic algorithm for solving travelling salesman problem. Int. J. Adv. Comput. Sci. Appl. (2011)Google Scholar
  4. 4.
    Sivanandam, S.N., Deepa, S.N.: Introduction to Genetic Algorithms. Springer, Heidelberg (2008)zbMATHGoogle Scholar
  5. 5.
    Konfrˇst, Z.: Parallel genetic algorithms: advances, computing trends, applications and perspectives. In: 18th International Parallel and Distributed Processing (2004)Google Scholar
  6. 6.
    Cant-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers, New York (2001)CrossRefGoogle Scholar
  7. 7.
    Lefohn, A.E., Sengupta, S., Kniss, J.O.E., Strzodka, R., Owens, J.D.: Glift: generic, efficient, random-access GPU data structures. ACM Trans. Graph. 25(1), 60–99 (2006)CrossRefGoogle Scholar
  8. 8.
    Mendez-Lojo, M., Burtscher, M., Pingali, K.: A GPU implementation of inclusion-based points-to analysis. ACM SIGPLAN Notices 47, 107–116 (2012)CrossRefGoogle Scholar
  9. 9.
    Yang, C.-H., Nygard, K.E.: The effects of initial for time constrained population traveling in genetic search salesman problems, pp. 378–383. ACM (1993)Google Scholar
  10. 10.
    Bartal, Y., Gottlieb, L.-A., Krauthgamer, R.: The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. In: Proceedings of the 44th Symposium on Theory of Computing - STOC 2012, pp. 663–672 (2012)Google Scholar
  11. 11.
    Fekete, P., Meijer, H., Rohe, A., Tietze, W.: Solving a “Hard” problem to approximate an “Easy” one: heuristics for maximum matchings and maximum traveling salesman problems. In: Algorithm Engineering and Experimentation. Springer, Heidelberg (2001)zbMATHGoogle Scholar
  12. 12.
    Alba, E.: Parallel evolutionary algorithms can achieve super-linear performance. Inf. Process. Lett. 82, 7–13 (2002)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Alba, E., Leguizamon, G., Ordonez, G.: Two models of parallel ACO algorithms for the minimum tardy task problem. Int. J. High Perf. Syst. Archit. 1(1), 50–59 (2007)Google Scholar
  14. 14.
    Bai, H., Yang, D., Li, X., He, L., Yu, H.: Max-min ant system on GPU with CUDA. In: Fourth International Conference on Innovative Computing, Information and Control, pp. 801–804. IEEE (2009)Google Scholar
  15. 15.
    Barr, R.S., Hickman, B.L.: Reporting computational experiments with parallel algorithms: issues, measures and experts’ opinions. ORSA J. Comput. 5(1), 2–18 (1993)CrossRefGoogle Scholar
  16. 16.
    Bullnheimer, B., Kotsis, G., Strauss, C.: Parallelization strategies for the ant system. In: De Leone, R., Murli, A., Pardalos, P., Toraldo, G. (eds.) High Performance Algorithms and Software in Nonlinear Optimization. Applied Optimization, vol. 24, pp. 87–100. Kluwer, Dordrecht (1997)CrossRefGoogle Scholar
  17. 17.
    Catala, A., Jaen, J., Mocholi, J.: Strategies for accelerating ant colony optimization algorithms on graphical processing units. In: IEEE Congress on Evolutionary Computation, pp. 492–500. IEEE Press (2007)Google Scholar
  18. 18.
    Chu, D., Till, M., Zomaya, A.: Parallel ant colony optimization for 3D protein structure prediction using the HP lattice model. In: 19th IEEE International Parallel and Distributed Processing Symposium, vol. 7. IEEE Computer Society (2005)Google Scholar
  19. 19.
    Craus, M., Rudeanu, L.: Parallel framework for ant-like algorithms. In: Third International Symposium on Parallel and Distributed Computing, ISPDC/HeteroPar 2004, pp. 36–41 (2004)Google Scholar
  20. 20.
    CUDA: Computer Unified Device Architecture Programming Guide 3.1 (2010). http://www.nvidia.com
  21. 21.
    Delisle, P., Gravel, M., Krajecki, M.: Multi-colony parallel ant colony optimization on SMP and multi-core computers. In: Proceedings of the World Congress on Nature and Biologically Inspired Computing, NaBIC 2009, pp. 318–323. IEEE (2009)Google Scholar
  22. 22.
    Delisle, P., Gravel, M., Krajecki, M., Gagné, C., Price, W.L.: A shared memory parallel implementation of ant colony optimization. In: 6th Metaheuristics International Conference, MIC 2005, Vienna, pp. 257–264 (2005)Google Scholar
  23. 23.
    Delisle, P., Gravel, M., Krajecki, M., Gagné, C., Price, W.L.: Comparing parallelization of an ACO: message passing vs. shared-memory. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds.) LNCS, vol. 3636, pp. 1–11. Springer, Heidelberg (2005)Google Scholar
  24. 24.
    Delisle, P., Krajecki, M., Gravel, M., Gagné, C.: Parallel implementation of an ant colony optimization metaheuristic with OpenMP. In: International Conference on Parallel Architectures and Compilation Techniques, 3rd European Workshop on OpenMP, EWOMP 2001, Barcelona (2001)Google Scholar
  25. 25.
    Delévacq, A., Delisle, P., Gravel, M., Krajecki, M.: Parallel ant colony optimization on graphics processing units. In: Arabnia, H.R., Chiu, S.C., Gravvanis, G.A., Ito, M., Joe, K., Nishikawa, H., Solo, A.M.G. (eds.) Proceedings of the 16th International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2010, pp. 196–202. CSREA Press, Athens (2010)Google Scholar
  26. 26.
    Doerner, K., Hartl, R., Benker, S., Lucka, M.: Parallel cooperative savings based ant colony optimization-multiple search and decomposition approaches. Parallel Process. Lett. 16(3), 351–370 (2006)MathSciNetCrossRefGoogle Scholar
  27. 27.
    Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. BioSystems 43, 73–81 (1997)CrossRefGoogle Scholar
  28. 28.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Bradford Books, Cambridge (2004)CrossRefGoogle Scholar
  29. 29.
    Ellabib, I., Calamai, P., Basir, O.: Exchange strategies for multiple ant colony system. Inf. Sci. 177(5), 1248–1264 (2007)CrossRefGoogle Scholar
  30. 30.
    Islam, M.T., Thulasiraman, P., Thulasiram, R.K.: A parallel ant colony optimization algorithm for all-pair routing in manets. In: 17th International Symposium on Parallel and Distributed Processing. IEEE Computer Society (2003)Google Scholar
  31. 31.
    Li, J., Hu, X., Pang, Z., Qian, K.: A parallel ant colony optimization algorithm based on fine-grained model with GPU-acceleration. Int. J. Innov. Comput. Inf. Control 5(11(A)), 3707–3716 (2009)zbMATHGoogle Scholar
  32. 32.
    Lin, S.: Computer solutions for the traveling salesman problem. Bell Syst. Tech. J. 44, 2245–2269 (1965)MathSciNetCrossRefGoogle Scholar
  33. 33.
    Manfrin, M., Birattari, M., Stützle, T., Dorigo, M.: Parallel ant colony optimization for the traveling salesman problem. In: LNCS, vol. 4150, pp. 224–234 (2006)Google Scholar
  34. 34.
    Middendorf, M., Reischle, F., Schmeck, H.: Multi colony ant algorithms. J. Heuristics 8(3), 305–320 (2002)CrossRefGoogle Scholar
  35. 35.
    Randall, M., Lewis, A.: A parallel implementation of ant colony optimization. J. Parallel Distrib. Comput. 62(2), 1421–1432 (2002)CrossRefGoogle Scholar
  36. 36.
    Scheuermann, B., Janson, S., Middendorf, M.: Hardware-oriented ant colony optimization. J. Syst. Archit. 53, 386–402 (2007)CrossRefGoogle Scholar
  37. 37.
    Scheuermann, B., So, K., Guntsch, M., Middendorf, M., Diessel, O., ElGindy, H., Schmeck, H.: FPGA implementation of population-based ant colony optimization. Appl. Soft Comput. 4, 303–322 (2004)CrossRefGoogle Scholar
  38. 38.
    Stützle, T.: Parallelisation strategies for ant colony optimization. In: Eiben, A., Bäck, T., Schwefel, H.-P., Schoenauer, M. (eds.) Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature. PPSN V. Springer, New York (1998)Google Scholar
  39. 39.
    Stützle, T., Hoos, H.: Max-min ant system. Future Gener. Comput. Syst. 16(8), 889–914 (2000)CrossRefGoogle Scholar
  40. 40.
    Talbi, E., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Future Gener. Comput. Syst. 17(4), 441–449 (2001)CrossRefGoogle Scholar
  41. 41.
    Wang, J., Dong, J., Zhang, C.: Implementation of ant colony algorithm based on GPU. In: Banissi, E., Sarfraz, M., Zhang, J., Ursyn, A., Jeng, W.C., Bannatyne, M.W., Zhang, J.J., San, L.H., Huang, M.L. (eds.) Sixth International Conference on Computer Graphics, Imaging and Visualization: New Advances and Trends, pp. 50–53. IEEE Computer Society (2009)Google Scholar
  42. 42.
    You, Y.: Parallel ant system for traveling salesman problem on GPUs. In: Genetic and Evolutionary Computation, GECCO 2009, pp. 1–2 (2009)Google Scholar
  43. 43.
    Yu, Q., Chen, C., Pan, Z.: Parallel genetic algorithms on programmable graphics hardware. In: Advances in Natural Computation. LNCS, vol. 3612, pp. 1051–1059. Springer, Heidelberg (2005)Google Scholar
  44. 44.
    Zhu, W., Curry, J.: Parallel ant colony for nonlinear function optimization with graphics hardware acceleration. In: Proceedings of the 2009 IEEE International Conference on Systems, Man and Cybernetics, pp. 1803–1808. IEEE Press (2009)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer Science, Polydisciplinary FacultyAbdelmalek Essaadi UniversityLaracheMorocco

Personalised recommendations