oaioai:ir.iscas.ac.cn:311060/8756

extended tabu search on fuzzy traveling salesman problem in multi-criteria analysis

Authors
Publication date
1 January 2010
Publisher
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
Doi

    Abstract

    Montana State Univ, Univ Warwick, Shandong Univ, Natl Nat Sci Fdn ChinaThe paper proposes an extended tabu search algorithm for the traveling salesman problem (TSP) with fuzzy edge weights. The algorithm considers three important fuzzy ranking criteria including expected value, optimistic value and pessimistic value, and performs a three-stage search towards the Pareto front, involving a preferred criterion at each stage. Simulations demonstrate that our approach can produce a set of near optimal solutions for fuzzy TSP instances with up to 750 uniformly randomly generated nodes

    Similar works

    Full text

    thumbnail-image

    Institute Of Software, Chinese Academy Of Sciences

    redirect
    oaioai:ir.iscas.ac.cn:311060/8756
    Last time updated on 30/12/2017

    This paper was published in Institute Of Software, Chinese Academy Of Sciences.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.