Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions
From MaRDI portal
Publication:1933544
DOI10.1007/s12543-011-0062-0zbMath1255.90132OpenAlexW2094766938MaRDI QIDQ1933544
Publication date: 24 January 2013
Published in: Fuzzy Information and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12543-011-0062-0
Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items
A goal programming approach for a multi-objective multi-choice assignment problem, Unnamed Item, Mehar's Methods for Fuzzy Assignment Problems with Restrictions, Applications of Fuzzy Linear Programming with Generalized LR Flat Fuzzy Parameters, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elitist genetic algorithm for assignment problem with imprecise goal
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- On the relationship between ATSP and the cycle cover problem
- Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Fuzzy sets and systems. Theory and applications
- A procedure for ordering fuzzy subsets of the unit interval
- A labeling algorithm for the fuzzy assignment problem.
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- The linear convolution of criteria in the bicriteria traveling salesman problem
- A two-objective fuzzy \(k\)-cardinality assignment problem
- On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
- An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
- Solving a multiobjective traveling salesman problem by dynamic programming
- Fuzzy sets
- Interactive fuzzy programming for two-level linear and linear fractional production and assignment problems: a case study