scientific article; zbMATH DE number 1082106
From MaRDI portal
Publication:4365133
zbMath0947.90612MaRDI QIDQ4365133
L. A. McGeoch, David S. Johnson
Publication date: 30 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot ⋮ A guided local search heuristic for the capacitated arc routing problem ⋮ Traveling salesman problems with PageRank distance on complex networks reveal community structure ⋮ Embedded local search approaches for routing optimization ⋮ Multiheuristic approach to discrete optimization problems ⋮ Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP ⋮ Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP ⋮ Simulated annealing versus Metropolis for a TSP instance ⋮ TSP race: minimizing completion time in time-sensitive applications ⋮ A memetic algorithm for the travelling salesperson problem with hotel selection ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem ⋮ Two level general variable neighborhood search for attractive traveling salesman problem ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem ⋮ An efficient implementation of a static move descriptor-based local search heuristic ⋮ A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows ⋮ Matheuristic algorithms for the parallel drone scheduling traveling salesman problem ⋮ Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem ⋮ The simultaneous semi-random model for TSP ⋮ Analysis of crossovers and selections in a coarse-grained parallel genetic algorithm ⋮ Solving large-scale TSP using a fast wedging insertion partitioning approach ⋮ The parameterized complexity of local search for TSP, more refined ⋮ Motion planning algorithms for the Dubins Travelling Salesperson Problem ⋮ A general variable neighborhood search variants for the travelling salesman problem with draft limits ⋮ Coupling ant colony systems with strong local searches ⋮ Finding the largest triangle in a graph in expected quadratic time ⋮ Hybrid Metaheuristics: An Introduction ⋮ Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems ⋮ Multi-objective optimal design of laminated composite skirt using hybrid NSGA ⋮ Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems ⋮ Discovering the suitability of optimisation algorithms by learning from evolved instances ⋮ Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs ⋮ Traveling salesman problem heuristics: leading methods, implementations and latest advances ⋮ The late acceptance hill-climbing heuristic ⋮ A local search template. ⋮ Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times ⋮ A general VNS heuristic for the traveling salesman problem with time windows ⋮ Variable neighborhood search: basics and variants ⋮ Unnamed Item ⋮ The multi-alternative cargo routing problem: solution by evolutionary methods ⋮ Seeking global edges for traveling salesman problem in multi-start search ⋮ Searching the \(k\)-change neighborhood for TSP is W[1-hard] ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ Switching codes and designs ⋮ On the computational complexity of the probabilistic traveling salesman problem with deadlines ⋮ Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem ⋮ \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems ⋮ A note on the traveling salesman reoptimization problem under vertex insertion ⋮ Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches ⋮ Converging marriage in honey-bees optimization and application to stochastic dynamic programming ⋮ Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier ⋮ Path planning on a cuboid using genetic algorithms ⋮ A survey on optimization metaheuristics ⋮ A discrete gravitational search algorithm for solving combinatorial optimization problems ⋮ 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 ⋮ Local search algorithms for finding the Hamiltonian completion number of line graphs ⋮ Generalization of machine learning for problem reduction: a case study on travelling salesman problems ⋮ A linearithmic heuristic for the travelling salesman problem ⋮ Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal ⋮ Local search inequalities ⋮ Bi-objective approaches for home healthcare medical team planning and scheduling problem ⋮ A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem ⋮ Memetic algorithms: The polynomial local search complexity theory perspective ⋮ A survey of very large-scale neighborhood search techniques ⋮ Genetic algorithm for combinatorial path planning: the subtour problem ⋮ Sequential search and its application to vehicle-routing problems ⋮ Expanding neighborhood GRASP for the traveling salesman problem ⋮ The multiagent planning problem ⋮ Estimation-based metaheuristics for the probabilistic traveling salesman problem ⋮ On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm ⋮ Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation ⋮ Iterated local search for the quadratic assignment problem ⋮ Hybrid metaheuristics for the vehicle routing problem with stochastic demands ⋮ An empirical study of tests for uniformity in multidimensional data ⋮ A metaheuristic for the delivery man problem with time windows ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ Guided local search and its application to the traveling salesman problem ⋮ Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes ⋮ Average-case approximation ratio of the 2-opt algorithm for the TSP ⋮ Combined location-routing problems -- a neural network approach ⋮ A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data ⋮ Speed-up techniques for solving large-scale biobjective TSP ⋮ An efficient GVNS for solving Traveling Salesman Problem with Time Windows ⋮ Nature's way of optimizing ⋮ A computational study of smoothing heuristics for the traveling salesman problem ⋮ 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 ⋮ Application of the noising method to the travelling salesman problem ⋮ Heuristics for the rural postman problem ⋮ 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 ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem ⋮ A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem ⋮ Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis ⋮ Metaheuristics in combinatorial optimization
This page was built for publication:
