Fuzzy stochastic linear programming-based approach for multiple departures single destination multiple travelling salesman problem (Q2627420): Difference between revisions

Summary: The multiple departures single destination multiple travelling salesmen problem (MDmTSP) is a problem in which two or more salesmen start from any node of departure and finish their tour by reaching a single specific destination node. In many real-life problems, the decision should be made according to information which is both possibilistically imprecise and probabilistically uncertain. Although consistency indexes provide a union nexus between possibilistic and probabilistic representation of uncertainty, there are no reliable transformations between them. A means to this end is fuzzy stochastic linear programming. In this paper, a realistic environment for MDmTSP with fuzzy stochastic distance between nodes is investigated. To justify the proposed approach and to illustrate its efficiency in real-life problems, a case of employees' bus transport routing problem (EBTRP) is presented.