An Effective Heuristic Algorithm for the Traveling-Salesman Problem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Hybrid parallel tempering and simulated annealing method
- Exemplar-based clustering via simulated annealing
- Performance evaluation of distribution strategies for the inventory routing problem
- An effective local search for the maximum clique problem
- Transgenetic algorithm for the traveling purchaser problem
- A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- The optimum assignments and a new heuristic approach for the traveling salesman problem
- GENFOLD 2: A set of models and algorithms for the GENeral unFOLDing analysis of preference/dominance data
- Production planning and scheduling for an integrated container company
- Randomized algorithms in combinatorial optimization: A survey
- Probabilistic exchange algorithms and Euclidean traveling salesman problems
- Average and worst-case analysis of heuristics for the maximum tardiness problem
- Implementation techniques for the vehicle routing problem
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Structural analysis of local search heuristics in combinatorial optimization
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- A bi-criteria heuristic for the vehicle routing problem with time windows
- How easy is local search?
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- Optimization of the movements of a component placement machine
- A new approach to choosing initial points in local search
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- The vehicle routing problem with backhauls
- Boltzmann machines for travelling salesman problems
- A probabilistic analysis of the switching algorithm for the Euclidean TSP
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
- Heuristics and their design: A survey
- On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem. I
- A modular algorithm for an extended vehicle scheduling problem
- Verschnittoptimierung im praktischen Einsatz. Eine Fallstudie
- Systematic choice of initial points in local search: Extensions and application to neural networks
- Iterative rule induction methods
- A note on the effect of neighborhood structure in simulated annealing
- Travelling salesman problem tools for microcomputers
- The traveling salesman problem: An overview of exact and approximate algorithms
- A multiperiod traveling salesman problem: Heuristic algorithms
- Large-step Markov chains for the TSP incorporating local search heuristics
- New \(({\Delta{}}, D)\) graphs discovered by heuristic search
- Paroids: A canonical format for combinatorial optimization
- On the solving strategy in composite heuristics
- The Euclidean traveling salesman problem is NP-complete
- Completely nonmetric multidimensional scaling
- New evolutionary genetic algorithms for NP-complete combinatorial optimization problems
- Optimizing tabu list size for the traveling salesman problem
- Mechanisms for local search
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- Genetic algorithms and traveling salesman problems
- Vehicle routing problem with trailers
- The use of dynamic programming in genetic algorithms for permutation problems
- The life span method -- a new variant of local search
- Combination of local search and CLP in the vehicle-fleet scheduling problem
- An empirical study of a new metaheuristic for the traveling salesman problem
- A model for warehouse order picking
- A bicriteria two-machine permutation flowshop problem
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
- Set-up saving schemes for printed circuit boards assembly
- Optimization by hierarchical mutant production
- Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
- Genetic local search in combinatorial optimization
- A two-dimensional mapping for the traveling salesman problem
- Coordination of production and distribution planning
- A parallel tabu search algorithm for large traveling salesman problems
- A fast optimization method based on a hierarchical strategy for the travelling salesman problem
- The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem
- Genetically improved presequences for Euclidean traveling salesman problems
- A robust strategy approach to a strategic mobility problem
- Tabu search performance on the symmetric travelling salesman problem
- A TSSP+1 decomposition strategy for the vehicle routing problem
- Neural methods for the traveling salesman problem: Insights from operations research
- The Convex-hull-and-k-line Travelling Salesman Problem
- A linear programming approach to reasoning about probabilities
- Scaling features in complex optimization problems
- TSP ejection chains
- Landscapes and their correlation functions
- Using tabu search for solving a dynamic multi-terminal truck dispatching problem
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Coalitions among computationally bounded agents
- Finding optimal subgraphs by local search
- A local search template.
- Genetic local search with distance preserving recombination operator for a vehicle routing problem.
- A direct stochastic algorithm for global search
- Integrating purchasing and routing in a propane gas supply chain.
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
- Local search algorithms for the multiprocessor flow shop scheduling problem
- Method to solve the travelling salesman problem using the inverse of diffusion process
- Relaxed tours and path ejections for the traveling salesman problem
- Traveling salesman problems with PageRank distance on complex networks reveal community structure
- Making a state-of-the-art heuristic faster with data mining
- A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- An iterated local search for the traveling salesman problem with release dates and completion time minimization
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- Bi-objective data gathering path planning for vehicles with bounded curvature
- Solving large batches of traveling salesman problems with parallel and distributed computing
This page was built for publication: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5671788)
