Abstract
We consider two classic problems: the Traveling Salesman Problem and the p-Median Problem. In both problems the total traveling cost (in some sense) is minimized, assuming that all traveling times are known. In most real-word applications the input data are uncertain, and this fact should be taken into account when a solution is constructed. In this paper we investigate bi-objective versions of the problems, where the total cost and fuzzy uncertainty associated with the traveling times (membership function) are optimized. A greedy approximation algorithm is proposed and experimentally tested on instances from TSPLIB library.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
