Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
DOI10.1016/J.CAM.2010.12.027zbMATH Open1210.65113OpenAlexW2046996444MaRDI QIDQ631908FDOQ631908
Authors: Jayanta Majumdar, Asoke Kumar Bhunia 
Publication date: 14 March 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.12.027
Recommendations
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
- A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems
- A new memetic algorithm for the asymmetric traveling salesman problem
- An Efficient Genetic Algorithm for the Traveling Salesman Problem
combinatorial optimizationnumerical examplesgenetic algorithminterval arithmeticasymmetric traveling salesman probleminterval order relation
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Stochastic programming (90C15) Numerical solutions to stochastic differential and integral equations (65C30)
Cites Work
- The traveling salesman problem. A computational study.
- Title not available (Why is that?)
- Optimization by simulated annealing
- Solution of a Large-Scale Traveling-Salesman Problem
- A Method for Solving Traveling-Salesman Problems
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Multiobjective programming in optimization of interval objective functions -- a generalized approach
- Fuzzy preference ordering of interval numbers in decision problems
- Multiobjective programming in optimization of the interval objective function
- Title not available (Why is that?)
- The traveling salesman problem: An overview of exact and approximate algorithms
- On comparing interval numbers
- Interval-arithmetic-oriented interval computing technique for global optimization
- Title not available (Why is that?)
- The traveling-salesman problem and minimum spanning trees: Part II
- ``Neural computation of decisions in optimization problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Using simulated annealing to solve routing and location problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solution of large-scale symmetric travelling salesman problems
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- Title not available (Why is that?)
- On the Complexity of Local Search for the Traveling Salesman Problem
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
- A restricted Lagrangean approach to the traveling salesman problem
- On the symmetric travelling salesman problem: A computational study
- Elitist genetic algorithm for assignment problem with imprecise goal
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Title not available (Why is that?)
- Parallel problem solving from nature. 1st workshop, PPSN 1, Dortmund, Germany, October 1-3, 1990. Proceedings
- Some issues of designing genetic algorithms for traveling salesman problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- A multiobjective optimization framework for optimal selection of supplier portfolio
- Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem
- Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility
- Elitist genetic algorithm for assignment problem with imprecise goal
- A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems
- High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows
- A genetic distance metric to discriminate the selection of algorithms for the general ATSP problem
- Coordination of cyclic crossover and bat algorithm for the travelling salesman problems in different environments: a simulation approach
- Solution of uncertain constrained multi-objective travelling salesman problem with aspiration level based multi objective quasi oppositional Jaya algorithm
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
Uses Software
This page was built for publication: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631908)
