Skip to main content
SpringerLink
Log in

Profit Maximization of TSP with Uncertain Parameters Through a Hybrid Algorithm

  • Conference paper
  • First Online:
Proceedings of the 4th International Conference on Frontiers in Intelligent Computing: Theory and Applications (FICTA) 2015

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 404))

Abstract

Here, a model of travelling salesman problem (TSP) with uncertain parameters is formulated and solved using a hybrid algorithm. For the TSP, there are some fixed number of cities and the costs and time durations for travelling from one city to another are known. Here, a travelling salesman (TS) visits and spends some time in each city for selling the company’s product. The return and expenditure at each city are dependent on the time spent by the TS at that city and these are given in functional forms of t. The total time limit for the entire tour is fixed and known. Now, the problem for the TS is to identify tour programme and also to determine the stay time at each city so that total profit out of the system is maximum. In reality, profit and cost for spending time in a city by the salesman are finite but fuzzy in nature. So fuzzy expenditure and fuzzy return are taken to make the problem realistic. Here, the model is solved by a hybrid method combining the particle swarm optimization (PSO) and ant colony optimization (ACO). The problem is divided into two subproblems where ACO and PSO are used successively iteratively in a generation using one’s result for the implicitly other. Numerical experiments are performed to illustrate the models. Some behavioural studies of the models and convergency of the proposed hybrid algorithm with respect to iteration numbers and cost matrix sizes are presented.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.: The Traveling Salesman Problem. Princeton University Press, Princeton (2007)

    MATH  Google Scholar 

  2. Fiechter, C.N.: A parallel tabu search algorithm for large traveling salesman problems. Discret. Appl. Math. 51(3), 243–267 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chang, T.S., WahWan, Y., Ooi, W.T.: A stochastic dynamic traveling salesman problem with hard time windows. Eur. J. Oper. Res. 198(3), 748–759 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, C.H., Liu, Y.C., Lin, C.J., Lin, C.T.: A hybrid of cooperative particle swarm optimization and cultural algorithm for neural fuzzy networks. In: FUZZ-IEEE, IEEE, 238–245 (2008)

    Google Scholar 

  5. Nagata, Y., Soler, D.: A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst. Appl. 39(10), 8947–8953 (2012)

    Article  Google Scholar 

  6. Lo, C.C., Hsu, C.C.: An annealing framework with learning memory. Trans. Syst. Man Cyber. Part A 28(5), 648–661 (1998)

    Article  Google Scholar 

  7. Michalewicz, Z.: Genetic Algorithms \(+\) Data Structures \(=\) Evolution Programs. Springer, New York (1992)

    Book  MATH  Google Scholar 

  8. Bianchi, L., Gambardella, L.M., Dorigo, M.: An ant colony optimization approach to the probabilistic traveling salesman problem. In: Guervós, J.J.M., Adamidis, P., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN. Lecture Notes in Computer Science, vol. 2439, pp. 883–892. Springer, Berlin (2002)

    Google Scholar 

  9. Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. Wiley, Hoboken (2006)

    Google Scholar 

  10. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948. Perth, Australia, IEEE Service Center, Piscataway, NJ (1995)

    Google Scholar 

  11. Majumdar, J., Bhunia, A.: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J. Comput. Appl. Math. 235(9), 3063–3078 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Liu, Y.H.: A hybrid scatter search for the probabilistic traveling salesman problem. Comput. Oper. Res. 34(10), 2949–2963 (2007)

    Article  MATH  Google Scholar 

  13. Cheng, R., Gen, M.: 16th annual conference on computers and industrial engineering crossover on intensive search and traveling salesman problem. Comput. Ind. Eng. 27(1), 485–488 (1994)

    Article  Google Scholar 

  14. Cheng, R., Gen, M., Sasaki, M.: Film-copy deliverer problem using genetic algorithms. In: Proceedings of the 17th International Conference on Computers and Industrial Engineering Computers and Industrial Engineering 29(14) 549–553 (1995)

    Google Scholar 

  15. Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for tsp and generalized tsp. Inf. Process. Lett. 103(5), 169–176 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Moon, C., Kim, J., Choi, G., Seo, Y.: An encient genetic algorithm for the traveling salesman problem with precedence constraints. Eur. J. Oper. Res. 140, 606–617 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  17. Clerc, M., Kennedy, J.: The particle swarm—explosion, stability, and convergence in a multidimensional complex space. Trans. Evol. Comput. 6(1), 58–73 (2002)

    Article  Google Scholar 

  18. Cheng, C.B., Mao, C.P.: A modified ant colony system for solving the travelling salesman problem with time windows. Math. Comput. Model. 46(910), 1225–1235 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  19. Ghafurian, S., Javadian, N.: An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems. Appl. Soft Comput. 11(1), 1256–1262 (2011)

    Article  Google Scholar 

  20. Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the tsptw. INFORMS J. Comput. 14(4), 403–417 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  21. Bai, J., Yang, G.K., Chen, Y.W., Hu, L.S., Pan, C.C.: A model induced max-min ant colony optimization for asymmetric traveling salesman problem. Appl. Soft Comput. 13(3) 1365–1375 (2013) Hybrid evolutionary systems for manufacturing processes

    Google Scholar 

  22. Leung, K.S., Jin, H., Xu, Z.: An expanding self-organizing neural network for the traveling salesman problem. Neurocomputing 62, 267–292 (2004)

    Article  Google Scholar 

  23. Chen, S.M., Chien, C.Y.: Parallelized genetic ant colony systems for solving the traveling salesman problem. Expert Syst. Appl. 38(4), 3873–3883 (2011)

    Article  Google Scholar 

  24. Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. Biosystems 43(2), 73–81 (1997)

    Article  Google Scholar 

  25. López-Ibáñez, M., Blum, C.: Beam-aco for the travelling salesman problem with time windows. Comput. Oper. Res. 37(9), 1570–1583 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  26. Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, 39–43 (1995)

    Google Scholar 

  27. Petersen, H.L., Madsen, O.B.G.: The double travelling salesman problem with multiple stacks—formulation and heuristic solution approaches. Eur. J. Oper. Res. 198(1), 139–147 (2009)

    Article  MATH  Google Scholar 

  28. Ratnaweera, A., Halgamuge, S.K., Watson, H.C.: Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans. Evol. Comput. 8(3), 240–255 (2004)

    Article  Google Scholar 

  29. Zadeh, L.: Fuzzy sets. Inf. Control. 8, 338–356 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  30. Bianchi, L., Gambardella, L., Dorigo, M.: An ant colony optimization approach to the probabilistic traveling salesman problem. Parallel Problem Solving from Nature PPSN VII, vol. 2439, pp. 883–892. Springer, Berlin (2002)

    Google Scholar 

  31. Masutti, T.A.S., de Castro, L.N.: A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Inf. Sci. 179(10), 1454–1468 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bohichberia High School (H.S.), Purba Medinipur, West Bengal, India

    Aditi Khanra

  2. Department of Mathematics, Mahishadal Raj College, Mahishadal, Medinipur, 721628, West Bengal, India

    Manas Kumar Maiti

  3. Department of Applied Mathematics, Vidyasagar University, Medinipur, 721102, West Bengal, India

    Manoranjan Maiti

Authors
  1. Aditi Khanra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manas Kumar Maiti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manoranjan Maiti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aditi Khanra .

Editor information

Editors and Affiliations

  1. Machine Intelligence Unit, ISI, Kolkata, West Bengal, India

    Swagatam Das

  2. Computer Science and Engineering, National Institute of Technology, Durgapur, West Bengal, India

    Tandra Pal

  3. National Institute of Technology, Durgapur, West Bengal, India

    Samarjit Kar

  4. Deparment of CSE, Anil Neerukonda Ins. of Tech. & Sci., Vishakapatnam, India

    Suresh Chandra Satapathy

  5. Kalyani University, Nadia, West Bengal, India

    Jyotsna Kumar Mandal

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Khanra, A., Maiti, M.K., Maiti, M. (2016). Profit Maximization of TSP with Uncertain Parameters Through a Hybrid Algorithm. In: Das, S., Pal, T., Kar, S., Satapathy, S., Mandal, J. (eds) Proceedings of the 4th International Conference on Frontiers in Intelligent Computing: Theory and Applications (FICTA) 2015. Advances in Intelligent Systems and Computing, vol 404. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2695-6_26

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2695-6_26

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2693-2

  • Online ISBN: 978-81-322-2695-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation