Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times

DOI10.1016/j.cam.2010.12.027zbMath1210.65113OpenAlexW2046996444MaRDI QIDQ631908

Asoke Kumar Bhunia, Jayanta Majumdar

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

zbMATH Keywords

numerical examplescombinatorial optimizationinterval arithmeticgenetic algorithmasymmetric traveling salesman probleminterval order relation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Combinatorial optimization (90C27) Numerical solutions to stochastic differential and integral equations (65C30)

Related Items (6)

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 ⋮ High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows ⋮ A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems ⋮ Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management

Uses Software

• Genocop
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Solution of large-scale symmetric travelling salesman problems
• Elitist genetic algorithm for assignment problem with imprecise goal
• ``Neural computation of decisions in optimization problems
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• The traveling salesman problem: An overview of exact and approximate algorithms
• Parallel problem solving from nature. 1st workshop, PPSN 1, Dortmund, Germany, October 1-3, 1990. Proceedings
• Multiobjective programming in optimization of interval objective functions -- a generalized approach
• On comparing interval numbers
• Some issues of designing genetic algorithms for traveling salesman problems
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
• A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
• Fuzzy preference ordering of interval numbers in decision problems
• Multiobjective programming in optimization of the interval objective function
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Interval-arithmetic-oriented interval computing technique for global optimization
• Using simulated annealing to solve routing and location problems
• On the symmetric travelling salesman problem: A computational study
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• A restricted Lagrangean approach to the traveling salesman problem
• On the Complexity of Local Search for the Traveling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times