Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times

DOI10.1016/J.CAM.2010.12.027MaRDI QIDQ631908zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatorial optimizationnumerical examplesgenetic algorithminterval arithmeticasymmetric traveling salesman probleminterval order relation

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(10)

• A multiobjective optimization framework for optimal selection of supplier portfolio
• Elitist genetic algorithm for assignment problem with imprecise goal
• Coordinating particle swarm optimization, ant colony optimization and \(K\)-Opt algorithm for traveling salesman problem
• Imprecise constrained covering solid travelling salesman problem with credibility
• 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
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
• 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

Describes a project that uses

Uses Software

• Concorde
• Genocop

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)