[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Over the past years, researchers drew their attention to propose optoelectronic architectures, including optical transpose interconnection system (OTIS) networks. On the other hand, there are limited attempts devoted to design parallel algorithms for applications that could be mapped on such optoelectronic architectures. Thus, exploiting the attractive features of OTIS networks and investigating their performance in solving combinatorial optimization problems become a great necessity. In this paper, a parallel repetitive nearest neighbor algorithm for solving the symmetric traveling salesman problem on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures is presented. This algorithm has been evaluated analytically and by simulation on both optoelectronic architectures in terms of number of communication steps, parallel run time, speedup, efficiency, cost and communication cost. The simulation results attained almost near-linear speedup and high efficiency among the two selected optoelectronic architectures, where OTIS-Hypercube gained better results in comparison with OTIS-Mesh.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. Marsden G, Marchand P, Harvey P, Esener S (1993) Optical transpose interconnection system architectures. Opt Lett 18(13):1083–1085

    Article  Google Scholar 

  2. Rajasekaran S, Reif J (2008) Handbook of parallel computing models, algorithms and applications. CRC Press, Boca Raton

    MATH  Google Scholar 

  3. Lucas KT, Jana PK (2010) Parallel algorithms for finding polynomial roots on OTIS-torus. J Supercomput 54(2):139–153

    Article  Google Scholar 

  4. Jana P, Mallick D (2010) OTIS-MOT: an efficient interconnection network for parallel processing. J Supercomput 59(2):920–940

    Article  Google Scholar 

  5. Mahafzah B, Sleit Hamad N, Ahmad E, Abu-Kabeer T (2012) The OTIS hyper hexa-cell optoelectronic architecture. Computing 94(5):411–432

    Article  MathSciNet  MATH  Google Scholar 

  6. Wang C-F, Sahni S (1998) Basic operations on the OTIS-mesh optoelectronic computer. IEEE Trans Parallel Distrib Syst 9(12):1226–1236

    Article  Google Scholar 

  7. Osterloh A (2000) Sorting on the OTIS-mesh. In: Proceedings of the 14th International Parallel and Distributed Processing Symposium (IPDPS’00), pp 269–74

  8. Mahafzah B, Tahboub R, Tahboub O (2010) Performance evaluation of broadcast and global combine operations in all-port wormhole-routed OTIS-mesh interconnection networks. Cluster Comput 13(1):87–110

    Article  Google Scholar 

  9. Mahafzah B, Jaradat B (2008) The load balancing problem in OTIS-hypercube interconnection networks. J Supercomput 46(3):276–297

    Article  Google Scholar 

  10. Deb S, Fong S, Tian Z, Wong RK, Mohammed S, Fiaidhi J (2016) Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm. J Supercomput 72(10):3960–3992

    Article  Google Scholar 

  11. Matai R, Singh S, Mittal ML (2010) Traveling salesman problem: an overview of applications, formulations, and solution approaches. In: Davendra D (ed) Traveling salesman problem, theory and applications. InTech, pp 1–24. ISBN: 978-953-307-426-9

  12. Cormen T, Leiserson C, Rivest R, Stein C (2001) Introduction to algorithms. MIT press, London

    MATH  Google Scholar 

  13. Kang S, Kim S-S, Won J, Kang Y-M (2016) GPU-based parallel genetic approach to large-scale travelling salesman problem. J Supercomput 72(11):4399–4414

    Article  Google Scholar 

  14. Marinakis Y (2009) Heuristic and metaheuristic algorithms for the traveling salesman problem. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization. Springer, New York, pp 1498–1506

    Chapter  Google Scholar 

  15. Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Lect Notes Comput Sci 840:73–97

    Article  Google Scholar 

  16. Zane F, Marchand P, Paturi R, Esener S (2000) Scalable network architectures using the optical transpose interconnection system (OTIS). J Parallel Distrib Comput 60(5):521–538

    Article  MATH  Google Scholar 

  17. Reinelt G (1991) TSPLIB: a traveling salesman problem library. ORSA J Comput 3(4):376–384

    Article  MathSciNet  MATH  Google Scholar 

  18. Grama A, Gupta A, Karyp G, Kumar G (2003) Introduction to parallel computing. Addison Wesley, Boston

    Google Scholar 

  19. Hennessy JL, Patterson DA (2011) Computer architecture: a quantitative approach. Morgan Kaufmann, Burlington

    MATH  Google Scholar 

  20. Kibar O, Marchand P, Esener S (1998) High speed CMOS switch designs for free-space optoelectronic MINs. IEEE Trans Very Large Scale Integr (VLSI) Syst 6(3):372–386

    Article  Google Scholar 

  21. Ansari AQ, Katiyar S (2015) Comparison and analysis of solving travelling salesman problem using GA, ACO and hybrid of ACO with GA and CS. In: Computational intelligence: theories, applications and future directions (WCI), 2015 IEEE Workshop, pp 1–5

  22. Johnson DS, Aragon CR, McGeoch LA, Schevon C (1989) Optimization by simulated annealing: an experimental evaluation: Part I. Graph partitioning. Oper Res 37(6):865–892

    Article  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to express their deep gratitude to the anonymous referees for their valuable comments and helpful suggestions, which improved the paper.

Author information

Authors and Affiliations

  1. Computer Science Department, King Abdullah II School for Information Technology, The University of Jordan, Amman, 11942, Jordan

    Aryaf Al-Adwan, Basel A. Mahafzah & Ahmad Sharieh

Authors
  1. Aryaf Al-Adwan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Basel A. Mahafzah
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ahmad Sharieh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Basel A. Mahafzah.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Al-Adwan, A., Mahafzah, B.A. & Sharieh, A. Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures. J Supercomput 74, 1–36 (2018). https://doi.org/10.1007/s11227-017-2102-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-017-2102-y

Keywords

Search

Navigation