Skip to main content

An Improved Genetic Algorithm and Its Application in Constrained Solid TSP in Uncertain Environments

  • Conference paper
  • 700 Accesses

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

Abstract

In this paper, we propose an improved genetic algorithm (IGA) to solve Constrained Solid Travelling Salesman Problems (CSTSPs) in crisp, fuzzy, rough, and fuzzy-rough environments. The proposed algorithm is a combination of probabilistic selection, cyclic crossover, and nodes-oriented random mutation. Here, CSTSPs in different uncertain environments have been designed and solved by the proposed algorithm. A CSTSP is usually a travelling salesman problem (TSP) where the salesman visits all cities using any one of the conveyances available at each city under a constraint say, safety constraint. Here a number of conveyances are used for travel from one city to another. In the present problem, there are some risks of travelling between the cities through different conveyances. The salesman desires to maintain certain safety level always to travel from one city to another and a total safety for his entire tour. Costs and safety level factors for travelling between the cities are different. The requirement of minimum safety level is expressed in the form of a constraint. The safety factors are expressed by crisp, fuzzy, rough, and fuzzy-rough numbers. The problems are formulated as minimization problems of total cost subject to crisp, fuzzy, rough, or fuzzy-rough constraints. This problem is numerically illustrated with appropriate data values. Optimum results for the different problems are presented via IGA. Moreover, the problems from the TSPLIB (standard data set) are tested with the proposed algorithm.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Zadeh, L.A.: Fuzzy logic and soft computing: issues, contentions and perspectives. In: Proceedings of IIZUKA’94: Third International Conference on Fuzzy Logic, Neural Nets and Soft Computing, pp. 1–2. Iizuka, Japan (1994)

    Google Scholar 

  2. Zadeh, L.A.: Some reflection on soft computing, granular computing and their roles in the conception, design and utilization of information/intelligent systems. Soft Comput. Fusion Found. Methodol. Appl. 2(1), 23–25 (1998)

    Google Scholar 

  3. Garey, M.R., Johson, D.S.: Computers and Intractability: A Guide to the Theory of NP—Completeness. W.H Freeman, New York (1979)

    Google Scholar 

  4. Changdar, C., Maiti, M.K., Maiti, M.: A constrained solid TSP in fuzzy environment: two heuristic approaches. Iran. J. Fuzzy Syst. 7, 15–29 (2011)

    MATH  Google Scholar 

  5. Xu, J., Zhao, L.: A class of fuzzy rough expected value multi-objective decision making model and its application to inventory problems. Comput. Math. Appl. 56, 2107–2119 (2008)

    Article  MathSciNet  Google Scholar 

  6. Xu, J., Zhao, L.: A Multi-objective decision-making model with fuzzy rough coefficients and application to the inventory problem. Inf. Sci. 180, 679–696 (2010)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  8. Chiang, W.C., Russell, R.A.: Simulated annealing met heuristics for the vehicle routine problem with time windows. Ann. Operat. Res. 63, 3–27 (1996)

    Article  Google Scholar 

  9. Knox, J.: The application of Tabu search to the symmetric traveling salesman problem, Ph.D. Dissertation, University of Colorado (1989)

    Google Scholar 

  10. Vescan, A., Pintea, C.-M.: Ant colony component-based system for travelling salesman problem. Appl. Math. Sci. 1(28), 1347–1357 (2007)

    MathSciNet  MATH  Google Scholar 

  11. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addsion Wesley, Reading (1989)

    MATH  Google Scholar 

  12. Eberhart, R.C., Kennedy, J.: Particle swarm optimization. In: Proceedings of the IEEE Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  13. TSPLIB. www.comopt.ifi.uni-heidelberg.de/software/TSPLIB95/

  14. Dubosis, D., Prade, H.: Possibility Theory: Analysis of Fuzzy Information 2, 3–39 (1988)

    Google Scholar 

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

    Book  Google Scholar 

  16. Mondal, M., Maity, A.K., Maiti, M.K., Maiti, M.: A production—repairing inventory model with fuzzy rough coefficients under inflation and time value of money. Appl. Math. Model. 37(5), 3200–3215 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Monoranjan Maiti .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer India

About this paper

Cite this paper

Maiti, M., Maity, S., Roy, A. (2015). An Improved Genetic Algorithm and Its Application in Constrained Solid TSP in Uncertain Environments. In: Chakraborty, M.K., Skowron, A., Maiti, M., Kar, S. (eds) Facets of Uncertainties and Applications. Springer Proceedings in Mathematics & Statistics, vol 125. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2301-6_14

Download citation

Publish with us

Policies and ethics