Advertisement

Soft Computing

, Volume 23, Issue 22, pp 11557–11572 | Cite as

Uncertain multi-objective Chinese postman problem

  • Saibal Majumder
  • Samarjit KarEmail author
  • Tandra Pal
Methodologies and Application

Abstract

Chinese postman problem is one of the significant combinatorial optimization problems with a wide range of real-world applications. Modelling such real-world applications quite often needs to consider some uncertain factors for which the belief degrees of the experts are essential. Liu (Uncertainty Theory, 2nd edn. Springer, Berlin, 2007) proposed uncertainty theory to model such human beliefs. This paper presents a multi-objective Chinese postman problem under the framework of uncertainty theory. The objectives of the problem are to maximize the total profit earned and to minimize the total travel time of the tour of a postman. Here, we have proposed an expected value model (EVM) for the uncertain multi-objective Chinese postman problem (UMCPP). The deterministic transformation of the corresponding EVM is done by computing the expected value of the uncertain variable using 999-method for which we have proposed an algorithm, 999-expected value model-uncertain multi-objective Chinese postman problem. Subsequently, the model is solved by two classical multi-objective solution techniques, namely global criterion method and fuzzy programming method. Two multi-objective genetic algorithms (MOGAs): nondominated sorting genetic algorithm II and multi-objective cross-generational elitist selection, heterogeneous recombination and cataclysmic mutation are also used to solve the model. A numerical example is presented to illustrate the proposed model. Finally, the performance of MOGAs is compared on six randomly generated instances of UMCPP.

Keywords

Uncertain multi-objective Chinese postman problem Expected value model 999-Method NSGA-II MOCHC 

Notes

Acknowledgements

The authors are very much thankful to the Editor and the anonymous referees for their constructive and valuable suggestions to enhance the quality of the manuscript. Moreover, Saibal Majumder, an INSPIRE fellow (No.: DST/INSPIRE Fellowship/2015/IF150410) is indebted to the Department of Science & Technology (DST), Ministry of Science and Technology, Government of India, for providing him financial assistance for the work.

Compliance with ethical standards

Conflict of interest

The authors declare that there is no conflict of interest regarding the publication of this article.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Informed consent

Informed consent is obtained from all individual participants included in the study.

References

  1. Chen X, Gao J (2013) Uncertain term structure model of interest rate. Soft Comput 17(4):597–604zbMATHCrossRefGoogle Scholar
  2. Chen L, Peng J, Zhang B, Rosyida I (2016) Diversified models for portfolio selection based on uncertain semivariance. Int J Syst Sci 48(3):637–648MathSciNetzbMATHCrossRefGoogle Scholar
  3. Chen B, Liu Y, Zhou T (2017) An entropy based solid transportation problem in uncertain environment. J Ambient Intell Humanized Comput.  https://doi.org/10.1007/s12652-017-0535-z CrossRefGoogle Scholar
  4. Chen Y, Gao J, Yang G, Liu Y (2018) Solving equilibrium standby redundancy optimization problem by hybrid PSO algorithm. Soft Comput 22(17):5631–5645zbMATHCrossRefGoogle Scholar
  5. Christofides N, Campos V, Corberan A, Mota E (1981) An algorithm for the rural postman problem. Imperial College report IC-ORGoogle Scholar
  6. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197Google Scholar
  7. Ding S (2014) Uncertain minimum cost flow problem. Soft Comput 18:2201–2207zbMATHCrossRefGoogle Scholar
  8. Ding S (2015) The α-maximum flow model with uncertain capacities. Appl Math Model 39:2056–2063MathSciNetCrossRefGoogle Scholar
  9. Durillo JJ, Nebro AJ (2011) jMetal: a Java framework for multi-objective optimization. Adv Eng Softw 42(10):760–771CrossRefGoogle Scholar
  10. Erdős P, Rényi A (1959) On random graphs. Publ Math 6:290–297MathSciNetzbMATHGoogle Scholar
  11. Eshelman LJ (1991) The CHC adaptive search algorithm: how to have safe search when engaging. Found Genet Algorithm 1:265–283Google Scholar
  12. Fonseca CM, Fleming PJ (1993) Genetic algorithms for multi-objective optimization: formulation, discussion and generalization. In: Proceedings of the fifth international conference on genetic algorithms, San Francisco, CA, USA, pp 416–423Google Scholar
  13. Gao Y (2011) Shortest path problem with uncertain arc lengths. Comput Math Appl 62:2591–2600MathSciNetzbMATHCrossRefGoogle Scholar
  14. Gao R, Sun Y, Ralescu D (2016) Order statistics of uncertain random variables with application to k-out-of-n system. Fuzzy Optim Decis Mak 16(2):159–181MathSciNetzbMATHCrossRefGoogle Scholar
  15. Gilbert E (1959) Random graphs. Ann Math Stat 30(4):1141–1144zbMATHCrossRefGoogle Scholar
  16. Golden B, Wong R (1981) Capacitated arc routing problems. Networks 11(3):305–315MathSciNetzbMATHCrossRefGoogle Scholar
  17. Grandinetti L, Guerriero F, Laganà D, Pisacane O (2010) An approximate ε-constraint method for the multi-objective undirected capacitated arc routing problem. In: SEA’10 proceedings of the 9th international conference on experimental algorithms, Naples, Italy, pp 214–225CrossRefGoogle Scholar
  18. Guan M (1984) On the windy postman problem. Discrete Appl Math 9(1):41–46MathSciNetzbMATHCrossRefGoogle Scholar
  19. Guo C, Gao J (2017) Optimal dealer pricing under transaction uncertainty. J Intell Manuf 28(3):657–665CrossRefGoogle Scholar
  20. Han S, Peng Z, Wang S (2014) The maximum flow problem of uncertain network. Inf Sci 265:167–175MathSciNetzbMATHCrossRefGoogle Scholar
  21. Hu Z, Gao J (2018) Uncertain Gompertz regression model with imprecise observations. Soft Comput.  https://doi.org/10.1007/s00500-018-3611-1 CrossRefGoogle Scholar
  22. Kar MB, Majumder S, Kar S, Pal T (2017) Cross-entropy based multi-objective uncertain portfolio selection problem. J Intell Fuzzy Syst 32(6):4467–4483zbMATHCrossRefGoogle Scholar
  23. Kwan MK (1962) Graphic programming using odd or even points. Chin Math 1:273–277MathSciNetzbMATHGoogle Scholar
  24. Lacomme P, Prins C, Sevaux M (2006) A genetic algorithm for a bi-objective capacitated arc routing problem. Comput Oper Res 33(12):3473–3493zbMATHCrossRefGoogle Scholar
  25. Lin YX, Zhao YC (1988) A new algorithm for the directed Chinese postman problem. Comput Oper Res 15(6):577–584MathSciNetzbMATHCrossRefGoogle Scholar
  26. Liu B (2007) Uncertainty theory, 2nd edn. Springer, BerlinzbMATHGoogle Scholar
  27. Liu B (2009a) Some research problems in uncertainty theory. J Uncertain Syst 3(1):3–10Google Scholar
  28. Liu B (2009b) Theory and practice of uncertain programming, 2nd edn. Springer, BerlinzbMATHCrossRefGoogle Scholar
  29. Liu B (2010) Uncertainty theory: a branch of mathematics for modeling human uncertainty. Springer, BerlinCrossRefGoogle Scholar
  30. Liu B (2012) Why is there a need for uncertainty theory? J Uncertain Syst 6(1):3–10Google Scholar
  31. Liu YH, Ha MH (2010) Expected value of function of uncertain variables. J Uncertain Syst 4(3):181–186Google Scholar
  32. Liu L, Zhang B, Ma W (2017) Uncertain programming models for fixed charge multi-item solid transportation problem. Soft Comput.  https://doi.org/10.1007/s00500-017-2718-0 CrossRefzbMATHGoogle Scholar
  33. Majumder S, Kundu P, Kar S, Pal T (2018a) Uncertain multi-objective multi-item fixed charge solid transportation problem with budget constraint. Soft Comput.  https://doi.org/10.1007/s00500-017-2987-7 CrossRefzbMATHGoogle Scholar
  34. Majumder S, Kar S, Pal T (2018b) Mean-entropy model of uncertain portfolio selection problem. In: Mandal JK, Mukhopadhyay S, Dutta P (eds) Multi-objective optimization: evolutionary to hybrid framework. Springer, Singapore.  https://doi.org/10.1007/978-981-13-1471-1_2 CrossRefGoogle Scholar
  35. Nag K, Pal T, Pal NR (2015) ASMiGA: an archive-based steady-state micro genetic algorithm. IEEE Trans Cybern 45(1):40–52CrossRefGoogle Scholar
  36. Nebro AJ, Alba E, Molina G, Chicano F, Luna F, Durillo JJ (2007) Optimal antenna placement using a new multi-objective CHC algorithm. In: GECCO ‘07 proceedings of the 9th annual conference on genetic and evolutionary computation, New York, NY, USA, pp 876–883Google Scholar
  37. Nobert Y, Picard JC (1996) An optimal algorithm for the mixed Chinese postman problem. Networks 27(2):95–108MathSciNetzbMATHCrossRefGoogle Scholar
  38. Nossack J, Golden B, Pesch E, Zhang R (2017) The windy rural postman problem with a time-dependent zigzag option. Eur J Oper Res 258(3):1131–1142MathSciNetzbMATHCrossRefGoogle Scholar
  39. Pearn WL (1994) Solvable cases of the k-person Chinese postman problem. Oper Res Lett 16(4):241–244MathSciNetzbMATHCrossRefGoogle Scholar
  40. Pearn WL, Chou JB (1999) Improved solutions for the Chinese postman problem on mixed networks. Comput Oper Res 26(8):819–827MathSciNetzbMATHCrossRefGoogle Scholar
  41. Pearn WL, Wang KH (2003) On the maximum benefit Chinese postman problem. Omega 31(4):269–273CrossRefGoogle Scholar
  42. Qin Z, Kar S (2013) Single-period inventory problem under uncertain environment. Appl Math Comput 219:9630–9638MathSciNetzbMATHGoogle Scholar
  43. Rao SS (2006) Engineering optimization-theory and practice, 3rd edn. New Age International Publishers, New DelhiGoogle Scholar
  44. Sheng Y, Yao K (2012) A transportation model with uncertain costs and demands. Information 15(8):3179–3186MathSciNetzbMATHGoogle Scholar
  45. Tan G, Cui X, Zhang Y (2005) Chinese postman problem in stochastic networks. In: ICAS/ICNS 2005 proceedings of the joint international conference on autonomic and autonomous systems and international conference on networking and services. IEEE Computer Society, Papeete, Tahiti, pp 78–78Google Scholar
  46. Van Veldhuizen DA, Lamont GB (1998) Multi-objective evolutionary algorithm research: a history and analysis. Technical report TR-98-03, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright-Patterson, AFB, OHGoogle Scholar
  47. Wang H-F, Wen Y-P (2002) Time-constrained Chinese postman problems. Comput Math Appl 44(3–4):375–387MathSciNetzbMATHCrossRefGoogle Scholar
  48. Yan L (2009) Optimal portfolio selection models with uncertain returns. Mod Appl Sci 3(8):76–81zbMATHCrossRefGoogle Scholar
  49. Yang X, Gao J (2013) Uncertain differential games with application to capitalism. J Uncertain Anal Appl.  https://doi.org/10.1186/2195-5468-1-17 CrossRefGoogle Scholar
  50. Yang X, Gao J (2016) Linear-quadratic uncertain differential game with application to resource extraction problem. IEEE Trans Fuzzy Syst 24(4):819–826CrossRefGoogle Scholar
  51. Yang X, Gao J (2017) Bayesian equilibria for uncertain bimatrix game with asymmetric information. J Intell Manuf 28(3):515–525CrossRefGoogle Scholar
  52. Zhang X, Chen X (2012) A new uncertain programming model for project scheduling problem. Information 15(10):3901–3910MathSciNetzbMATHGoogle Scholar
  53. Zhang B, Peng J (2012) Uncertain programming model for Chinese postman problem with uncertain weights. Ind Eng Manag Syst 11(1):18–25Google Scholar
  54. Zhang B, Peng J (2013) Uncertain programming model for uncertain optimal assignment problem. Appl Math Model 37(9):6458–6468MathSciNetzbMATHCrossRefGoogle Scholar
  55. Zhang B, Peng J, Li S, Chen L (2016) Fixed charge solid transportation problem in uncertain environment and its algorithm. Comput Ind Eng 102(2016):186–197CrossRefGoogle Scholar
  56. Zhang Y, Gao J, An Q (2018) International investing in uncertain financial market. Soft Comput 22(16):5335–5346zbMATHCrossRefGoogle Scholar
  57. Zhou A, Jin Y, Zhang Q, Sendho B, Tsang E (2006) Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence criterion. In: IEEE congress on evolutionary computation, Sheraton Vancouver Wall Center Vancouver, BC, Canada, pp 3234–3241Google Scholar
  58. Zhou J, He X, Wang K (2014) Uncertain quadratic minimum spanning tree problem. J Commun 9(5):385–390CrossRefGoogle Scholar
  59. Zhou J, Chen L, Wang K (2015) Path optimality conditions for minimum spanning tree problem with uncertain edge weights. Int J Uncertain Fuzziness Knowl Based Syst 23(1):49–71MathSciNetzbMATHCrossRefGoogle Scholar
  60. Zimmermann H-J (1978) Fuzzy programming and linear programming with several objective functions. Fuzzy Sets Syst 1(1):45–55MathSciNetzbMATHCrossRefGoogle Scholar
  61. Zitzler E, Thiele L (1999) Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceNational Institute of Technology DurgapurDurgapurIndia
  2. 2.Department of MathematicsNational Institute of Technology DurgapurDurgapurIndia

Personalised recommendations