Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times

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

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
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
The traveling salesman problem: An overview of exact and approximate algorithms
On comparing interval numbers
Interval-arithmetic-oriented interval computing technique for global optimization
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
Solution of large-scale symmetric travelling salesman problems
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
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
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
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem

Cited In (8)

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
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
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

Genocop
Concorde

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)