arrow
Return

Uncertain multi-objective Chinese postman problem

delete2018-12-13
delete27
PRE
AI
S
Saibal Majumder
S
Samarjit Kar *
T
Tandra Pal
DOI:10.1007/s00500-018-03697-3delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Soft Computing cover
Soft Computing
IF:
2.5
Papers:
1.0W
Citations:
2.1W

Organization

N
national institute of technology (nit system)
Scholars:
4.0W
Papers: 3.7W
Citations: 31
N
National Institute of Technology Durgapur
Scholars:
1.2K
Papers: 1.1K
Citations: 1.8K