Skip to main content
SpringerLink
Log in

Parallel CHC Algorithm for Solving Dynamic Traveling Salesman Problem Using Many-Core GPU

  • Conference paper
Artificial Intelligence: Methodology, Systems, and Applications (AIMSA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7557))

Abstract

This paper presents a massively parallel evolutionary algorithm with local search mechanism dedicated to dynamic optimization. Its application for solving Dynamic Traveling Salesman Problem (DTSP) is discussed. The algorithm is designed for many-core graphics processors with the Compute Unified Device Architecture (CUDA), which is a parallel computing architecture for nVidia graphics processors. Experiments on a number of benchmark DTSP problems confirmed the efficiency of the algorithm and the parallel computing model designed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, Dordrecht (2002)

    Book  MATH  Google Scholar 

  2. Eshelman, L.J.: The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. Foundations of Genetic Algorithms 1, 265–283 (1991)

    Google Scholar 

  3. Filipiak, P., Michalak, K., Lipinski, P.: Infeasibility Driven Evolutionary Algorithm with ARIMA-Based Prediction Mechanism. In: Yin, H., Wang, W., Rayward-Smith, V. (eds.) IDEAL 2011. LNCS, vol. 6936, pp. 345–352. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Filipiak, P., Michalak, K., Lipinski, P.: A Predictive Evolutionary Algorithm for Dynamic Constrained Inverse Kinematics Problems. In: Corchado, E., Snášel, V., Abraham, A., Woźniak, M., Graña, M., Cho, S.-B. (eds.) HAIS 2012, Part III. LNCS, vol. 7208, pp. 610–621. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  5. Fujimoto, N., Tsutsui, S.: A Highly-Parallel TSP Solver for a GPU Computing Platform. In: Dimov, I., Dimova, S., Kolkovska, N. (eds.) NMA 2010. LNCS, vol. 6046, pp. 264–271. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Kirk, D., Hwu, W.: Programming Massively Parallel Processors – A Hands-on Approach. Elsevier (2010)

    Google Scholar 

  7. Psaraftis, H.N.: Dynamic vehicle routing problems. In: Vehicle Routing: Methods and Studies, pp. 223–248. Elsevier, Amsterdam (1988)

    Google Scholar 

  8. Lipinski, P.: A Stock Market Decision Support System with a Hybrid Evolutionary Algorithm for Many-Core Graphics Processors. In: Guarracino, M.R., Vivien, F., Träff, J.L., Cannatoro, M., Danelutto, M., Hast, A., Perla, F., Knüpfer, A., Di Martino, B., Alexander, M. (eds.) Euro-Par 2010 Workshops. LNCS, vol. 6586, pp. 455–462. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Lipinski, P.: Parallel Evolutionary Algorithms for Stock Market Trading Rule Selection on Many-Core Graphics Processors. In: Brabazon, A., O’Neill, M., Maringer, D. (eds.) Natural Computing in Computational Finance. SCI, vol. 380, pp. 79–92. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Lipinski, P.: ECGA vs. BOA in Discoverying Stock Market Trading Experts. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2007, pp. 531–538. ACM (2007)

    Google Scholar 

  11. Lipinski, P., Korczak, J.J.: Performance Measures in an Evolutionary Stock Trading Expert System. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3039, pp. 835–842. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Lipinski, P.: Discovering Stock Market Trading Rules Using Multi-layer Perceptrons. In: Sandoval, F., Prieto, A.G., Cabestany, J., Graña, M. (eds.) IWANN 2007. LNCS, vol. 4507, pp. 1114–1121. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Reinelt, G.: Traveling Salesman Problems Library available on the Internet at: http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/

  14. Simões, A., Costa, E.: CHC-Based Algorithms for the Dynamic Traveling Salesman Problem. In: Di Chio, C., Cagnoni, S., Cotta, C., Ebner, M., Ekárt, A., Esparcia-Alcázar, A.I., Merelo, J.J., Neri, F., Preuss, M., Richter, H., Togelius, J., Yannakakis, G.N. (eds.) EvoApplications 2011, Part I. LNCS, vol. 6624, pp. 354–363. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Verhoeven, M.G.A., Aarts, E.H.L., Swinkels, P.C.J.: A parallel 2-opt algorithm for the Traveling Salesman Problem. Future Generation Computer Systems 11, 175–182 (1995)

    Article  Google Scholar 

  16. Whitley, D., Rana, S., Dzubera, J., Mathias, E.: Evaluating evolutionary algorithms. Arificial Intelligence 85, 245–276 (1996)

    Article  Google Scholar 

  17. Younes, A., Basir, O., Calamai, P.: A benchmark generator for dynamic optimization. In: Proceedings of the 3rd International Conference on Soft Computing, Optimization, Simulation & Manufacturing Systems (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wroclaw, Wroclaw, Poland

    Patryk Filipiak & Piotr Lipiński

Authors
  1. Patryk Filipiak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Lipiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Manchester, Oxford Road, M13 9PL, Manchester, UK

    Allan Ramsay

  2. Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, 2 Acad. G. Bonchev, 1113, Sofia, Bulgaria

    Gennady Agre

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Filipiak, P., Lipiński, P. (2012). Parallel CHC Algorithm for Solving Dynamic Traveling Salesman Problem Using Many-Core GPU. In: Ramsay, A., Agre, G. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2012. Lecture Notes in Computer Science(), vol 7557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33185-5_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33185-5_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33184-8

  • Online ISBN: 978-3-642-33185-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation