Publication:4365133
From MaRDI portal
zbMath0947.90612MaRDI QIDQ4365133
David S. Johnson, L. A. McGeoch
Publication date: 30 October 1997
Related Items
A Sensitive Metaheuristic for Solving a Large Optimization Problem, Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP, Ejection chain and filter-and-fan methods in combinatorial optimization, Construction heuristics for the asymmetric TSP., Variable neighborhood search: Principles and applications, A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem, Statistical mechanics methods and phase transitions in optimization problems, Analysis of crossovers and selections in a coarse-grained parallel genetic algorithm, A survey of very large-scale neighborhood search techniques, Metaheuristics in combinatorial optimization, Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, Searching the \(k\)-change neighborhood for TSP is W[1-hard], Path planning on a cuboid using genetic algorithms, An iterated local search algorithm for the vehicle routing problem with convex time penalty functions, Pareto memetic algorithm for multiple objective optimization with an industrial application, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, Average-case approximation ratio of the 2-opt algorithm for the TSP, Combined location-routing problems -- a neural network approach, Speed-up techniques for solving large-scale biobjective TSP, Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, Reoptimization of minimum and maximum traveling salesman's tours, Heuristics for the rural postman problem, Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP, A local search template., Nature's way of optimizing, A computational study of smoothing heuristics for the traveling salesman problem, Application of the noising method to the travelling salesman problem, Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation, Guided local search and its application to the traveling salesman problem, A guided local search heuristic for the capacitated arc routing problem, Embedded local search approaches for routing optimization, Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches, Multiheuristic approach to discrete optimization problems, Converging marriage in honey-bees optimization and application to stochastic dynamic programming, Local search algorithms for finding the Hamiltonian completion number of line graphs, Memetic algorithms: The polynomial local search complexity theory perspective, Sequential search and its application to vehicle-routing problems, Expanding neighborhood GRASP for the traveling salesman problem, Iterated local search for the quadratic assignment problem, Hybrid metaheuristics for the vehicle routing problem with stochastic demands, Implementation analysis of efficient heuristic algorithms for the traveling salesman problem, A note on single alternating cycle neighborhoods for the TSP, Fast local search algorithms for the handicapped persons transportation problem, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem, PARALLEL TEMPERING FOR THE TRAVELING SALESMAN PROBLEM, Continuous reformulations and heuristics for the Euclidean travelling salesperson problem, Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis
