scientific article; zbMATH DE number 177832
From MaRDI portal
Publication:4038710
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
Cited in
(83)- An effective local search for the maximum clique problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- The traveling salesman problem: An overview of exact and approximate algorithms
- Traveling salesman problem and local search
- Large-step Markov chains for the TSP incorporating local search heuristics
- On the solving strategy in composite heuristics
- Genetic algorithms and traveling salesman problems
- Estimating the Held-Karp lower bound for the geometric TSP
- New edges not used in shortest tours of TSP
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
- Minimizing flow time variance in a single machine system using genetic algorithms
- Genetic local search in combinatorial optimization
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
- Simulated annealing and tabu search: Lessons from a line search
- A new adaptive multi-start technique for combinatorial global optimizations
- Evolution based learning in a job shop scheduling environment
- TSP ejection chains
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- A new extension of local search applied to the Dial-A-Ride problem
- Hysteretic optimization for the traveling salesman problem
- Nature's way of optimizing
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
- An efficient evolutionary algorithm for the orienteering problem
- An efficient local search for the feedback vertex set problem
- Distances between traveling salesman tours
- Guided local search and its application to the traveling salesman problem
- One-dimensional cutting stock problem to minimize the number of different patterns
- A fuzzy genetic algorithm for driver scheduling
- Embedded local search approaches for routing optimization
- Routing problems: A bibliography
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- Divide and conquer strategies for parallel TSP heuristics
- Combining simulated annealing with local search heuristics
- Designing and reporting on computational experiments with heuristic methods
- Parallel local search
- On the classification of NP-complete problems in terms of their correlation coefficient
- Using tornado-related weather data to route unmanned aerial vehicles to locate damage and victims
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- Solution attractor of local search in travelling salesman problem: concept, construction and application
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- A user's guide to tabu search
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- Dynamics of local search trajectory in traveling salesman problem
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- Optimization as a multistage decision making
- Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
- Decomposition and local search based methods for the traveling umpire problem
- TSP race: minimizing completion time in time-sensitive applications
- Union search: a new meta-heuristic algorithm to the traveling salesman problem
- The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
- Neural networks for NP-complete problems
- A gene-pool based genetic algorithm for TSP
- scientific article; zbMATH DE number 2154256 (Why is no real title available?)
- scientific article; zbMATH DE number 2158373 (Why is no real title available?)
- Provably good solutions for the traveling salesman problem
- A survey on optimization metaheuristics
- Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem
- Global strategies for augmenting the efficiency of TSP heuristics
- A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Experiments on the minimum linear arrangement problem
- scientific article; zbMATH DE number 4189104 (Why is no real title available?)
- scientific article; zbMATH DE number 7651222 (Why is no real title available?)
- Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods
- On the landscape ruggedness of the quadratic assignment problem
- A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem
- Truly tight bounds for TSP heuristics
- MPILS: an automatic tuner for MILP solvers
- Automated slideshow design from a set of photos based on a hybrid Metaheuristic approach
- Seeking global edges for traveling salesman problem in multi-start search
- Solution attractor of local search system: a method to reduce computational complexity of the traveling salesman problem
- Hybridizing simulated annealing and genetic algorithms with Pythagorean fuzzy uncertainty for traveling salesman problem optimization
- HiTSP: towards a hierarchical neural framework for large-scale traveling salesman problems
- A modified Lin--Kernighan traveling-salesman heuristic
- A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits
- Iterated local search, iterated greedy and applications
- Reducing conveyor blockages at an automated food logistics warehouse via bounded metaheuristic exploration
- Efficiency of a local algorithm for solving the traveling salesman problem
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038710)
