Fuzzy stochastic linear programming-based approach for multiple departures single destination multiple travelling salesman problem Online publication date: Tue, 29-Jul-2014
by Seyed Gholamreza Jalali Naini; Mohammad Mahdi Paydar; Javid Jouzdani; Mohammad Fathian
International Journal of Operational Research (IJOR), Vol. 17, No. 4, 2013
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook