Skip to main content
SpringerLink
Log in

A Hybrid Heuristic for Restricted 4-Dimensional TSP (r-4DTSP)

  • Conference paper
  • First Online:
Operations Research and Optimization (FOTA 2016)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 225))

Abstract

In this paper, we proposed a hybridized soft computing technique to solve a restricted 4-dimensional TSP (r-4DTSP) where different paths with various numbers of conveyances are available to travel between two cities. Here, some restrictions on paths and conveyances are imposed. The algorithm is a hybridization of genetic algorithm (GA) and swap operator-based particle swarm optimization (PSO). The initial solutions are produced by proposed GA which used as swarm in PSO. The said hybrid algorithm (GA-PSO) is tested against some test functions, and efficiency of the proposed algorithm is established. The r-4DTSPs are considered with crisp costs. The models are illustrated with some numerical data.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The traveling salesman problem: G. E. Re Guided tour of combinatorial optimization. Wiley, New York (1985)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Chang, T., Wan, Y., Tooi, W.: A stochastic dynamic travelling salesman problem with hard time windows. Eur. J. Op. Res. 198(3), 748–759 (2009)

    Article  MATH  Google Scholar 

  4. Petersen, H.L., Madsen, O.B.G.: The double travelling salesman problem with multiple stack—formulation heuristic solution approaches. Eur. J. Op. Res. 198, 339–347 (2009)

    Google Scholar 

  5. Majumder, A.K., Bhunia, A.K.: 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 

  6. Moon, C., Ki, J., Choi, G., Seo, Y.: An efficient genetic algorithm for the TSP with precedence constraints. EJOR 140, 606–617 (2002)

    Article  MATH  Google Scholar 

  7. Maity, S., Roy, A., Maiti, M., Modified, A.: Genetic algorithm for solving uncertain constrained solid travelling salesman problems. Comput. Ind. Eng. 83, 273–296 (2015)

    Article  Google Scholar 

  8. Maity, S., Roy, A., Maiti, M.: An imprecise multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem. Expert Syst. Appl. 46, 196–223 (2016)

    Article  Google Scholar 

  9. Ghaziri, H., Osman, I.H.: A neural network algorithm for TSP with backhauls. Comput. Ind. Eng. 44(2), 267–281 (2003)

    Article  Google Scholar 

  10. Chen, S.M., Chien, C.Y.: Solving the TSP based on the genetic simulated annealing ant colony system with PSO techniques. Expert Syst. Appl. 38(12), 14439–14450 (2011)

    Article  Google Scholar 

  11. Bluma, C., Puchingerb, J., Raidlc, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11, 4135–4151 (2011)

    Article  Google Scholar 

  12. Ardalan, Z., Karimi, S., Poursabzi, O., Nader, B.: A novel imperialist competitive algorithm for generalized TSP. Appl. Soft Comput. xxx, XX–XX (2014)

    Google Scholar 

  13. Psychas, I.-D., Delimpasi, E., Marinakis, Y.: Hybrid evolutionary algorithms for the multiobjective traveling salesman problem. Expert Syst. Appl. https://doi.org/10.1016/j.eswa.2015.07.051

  14. Kennedy, J., Eberhart, R.: Particle swarm optimization. IEEE Int. Conf. Neural Netw. 4, 1942–1948 (1995)

    Google Scholar 

  15. Chen, Y.L.: Particle swarm optimization survey for traveling salesman problem. Master Thesis. Department of Industrial Engineering and Management National Taipei University of Technology, July 2006

    Google Scholar 

  16. Chen, C.-Y., Feng, H.-M.: Hybrid intelligent vision-based car-like vehicle backing systems design. Expert Syst. Appl. 36, 7500–7509 (2009)

    Article  Google Scholar 

  17. Feng, H.M.: Self-generation RBFNs using evolutional PSO learning. Neurocomputing 70, 241–251 (2006)

    Article  Google Scholar 

  18. Wang, K., Hunang, L., Zhou, C.-G., Pang, W.: Particle swarm optimization for TSP, 2nd Intr. In: IEEE Conference on Machine Learning and Cybernetics, pp. 1583–1585 (2003)

    Google Scholar 

  19. Mahi, M., Baykan, O.K., Kodaz, H.: A new hybrid method based on PSO, ACO and 3-Opt algorithm for TSP. Appl. Soft Comput. 30, 484–490 (2015)

    Article  Google Scholar 

  20. Marinakis, Y., Marinaki, M., Dounias, G.: A hybrid PSO algorithm for vehicle routing problem. Eng. Appl. Artif. Intel. 23, 464–472 (2010)

    Article  MATH  Google Scholar 

  21. Liu, B.: Theory and Practice of Uncertain Programming. Physica-Verlag, Heidelberg (2002)

    Book  MATH  Google Scholar 

  22. TSPLIB http://comopt.ifi.uniidelberg.de/software/TSPLIB95/

Download references

Acknowledgements

This research article is supported by University Grant Commission of India by grant number PSW-150/14-15 (ERO).

Author information

Authors and Affiliations

  1. Department of Computer Science, Prabhat Kumar College, Contai, Purba Medinipur, 721401, W.B, India

    Arindam Roy

  2. Faculty of Software and Information Science, Iwate Prefectural University, Takizawa, Japan

    Goutam Chakraborty

  3. Department of Computer Science, Vidyasagar University, Medinipur, 721102, W.B, India

    Indadul Khan & Samir Maity

  4. Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Medinipur, 721102, W.B, India

    Manoranjan Maiti

Authors
  1. Arindam Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Goutam Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Indadul Khan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Samir Maity
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Manoranjan Maiti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arindam Roy .

Editor information

Editors and Affiliations

  1. Department of Mathematics, National Institute of Technology, Durgapur, Durgapur, West Bengal, India

    Samarjit Kar

  2. Department of Computer Science and Engineering, Jadavpur University, Kolkata, West Bengal, India

    Ujjwal Maulik

  3. School of Economics and Management, Beijing University of Chemical Technology, Beijing, China

    Xiang Li

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Roy, A., Chakraborty, G., Khan, I., Maity, S., Maiti, M. (2018). A Hybrid Heuristic for Restricted 4-Dimensional TSP (r-4DTSP). In: Kar, S., Maulik, U., Li, X. (eds) Operations Research and Optimization. FOTA 2016. Springer Proceedings in Mathematics & Statistics, vol 225. Springer, Singapore. https://doi.org/10.1007/978-981-10-7814-9_20

Download citation

Publish with us

Policies and ethics

Search

Navigation