Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions

Mukherjee and Basu proposed a new method for solving fuzzy assignment problems. In this paper, some fuzzy assignment problems and fuzzy travelling salesman problems are chosen which cannot be solved by using the fore-mentioned method. Two new methods are proposed for solving such type of fuzzy assignment problems and fuzzy travelling salesman problems. The fuzzy assignment problems and fuzzy travelling salesman problems which can be solved by using the existing method, can also be solved by using the proposed methods. But, there exist certain fuzzy assignment problems and fuzzy travelling salesman problems which can be solved only by using the proposed methods. To illustrate the proposed methods, a fuzzy assignment problem and a fuzzy travelling salesman problem is solved. The proposed methods are easy to understand and apply to find optimal solution of fuzzy assignment problems and fuzzy travelling salesman problems occurring in real life situations.

[1]  Bobby Schmidt,et al.  Fuzzy math , 2001 .

[2]  I. Melamed,et al.  The linear convolution of criteria in the bicriteria traveling salesman problem , 1997 .

[3]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[4]  Didier Dubois,et al.  Fuzzy sets and systems ' . Theory and applications , 2007 .

[5]  Knut Richter,et al.  Solving a multiobjective traveling salesman problem by dynamic programming , 1982 .

[6]  Laura J. Oliver.  The optimal assignment problem. , 2012 .

[7]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[8]  Amna Rehmat,et al.  Fuzzy Multi-objective Linear Programming Approach for Traveling Salesman Problem , 2007 .

[9]  Amna Rehmat,et al.  Fuzzy Multi-objective Linear Programming Approach , 2007 .

[10]  Jirí Sgall,et al.  An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality , 2003, J. Discrete Algorithms.

[11]  Tapan Kumar Pal,et al.  Travelling Salesman Problem with Interval Cost Constraints , 2009 .

[12]  L. Sunil Chandran,et al.  On the relationship between ATSP and the cycle cover problem , 2007, Theor. Comput. Sci..

[13]  Thomas Andreae,et al.  On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality , 2001, Networks.

[14]  Chi-Jen Lin,et al.  A labeling algorithm for the fuzzy assignment problem , 2004, Fuzzy Sets Syst..

[15]  Elena Nechita,et al.  Solving Fuzzy TSP with Ant Algorithms , 2008 .

[16]  Lixing Yang,et al.  A two-objective fuzzy k -cardinality assignment problem , 2006 .

[17]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[18]  Ronald R. Yager,et al.  A procedure for ordering fuzzy subsets of the unit interval , 1981, Inf. Sci..

[19]  Asoke Kumar Bhunia,et al.  Elitist genetic algorithm for assignment problem with imprecise goal , 2007, Eur. J. Oper. Res..

[20]  An algorithm for solving large-scale travelling-salesman problems and its numerical implementation , 1987 .

[21]  Linzhong Liu,et al.  Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm , 2009 .

[22]  Ichiro Nishizaki,et al.  Interactive fuzzy programming for two-level linear and linear fractional production and assignment problems: A case study , 2001, Eur. J. Oper. Res..

[23]  Juraj Hromkovic,et al.  Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem , 2002, Theor. Comput. Sci..

[24]  Jiuping Xu,et al.  A fuzzy vehicle routing assignment model with connection network based on priority-based genetic algorithm , 2008 .

[25]  Tapan Kumar Pal,et al.  Fuzzy Preference Ordering of Interval Numbers in Decision Problems , 2009, Studies in Fuzziness and Soft Computing.

[26]  Juraj Hromkovic,et al.  Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem , 2000, CIAC.