An Effective Heuristic Algorithm for the Traveling-Salesman Problem
From MaRDI portal
Publication:5671788
DOI10.1287/opre.21.2.498zbMath0256.90038OpenAlexW2042986967WikidataQ57406542 ScholiaQ57406542MaRDI QIDQ5671788
No author found.
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cf111ab889611f1b08f885ab783bde7157807641
Related Items
The clustered orienteering problem, Master surgery scheduling with consideration of multiple downstream units, Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem, A distribution-free TSP tour length estimation model for random graphs, TSP race: minimizing completion time in time-sensitive applications, The \(k\)-dissimilar vehicle routing problem, Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem, A matheuristic for the team orienteering arc routing problem, The multi-compartment vehicle routing problem with flexible compartment sizes, Classical simulated annealing using quantum analogues, MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem, Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations, 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, A hybrid data mining GRASP with path-relinking, The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis, Location-arc routing problem: heuristic approaches and test instances, Ambulance routing for disaster response with patient groups, A simulated annealing heuristic for the open location-routing problem, A two-phase hybrid heuristic algorithm for the capacitated location-routing problem, Insertion based Lin-Kernighan heuristic for single row facility layout, A nonmonotone GRASP, Social structure optimization in team formation, Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking, On the number of local minima for the multidimensional assignment problem, A Lagrangean relaxation heuristic for vehicle routing, A hybrid scatter search for the probabilistic traveling salesman problem, DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic, Design and control of warehouse order picking: a literature review, A heuristic procedure for the capacitated \(m\)-ring-star problem, Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems, The balanced traveling salesman problem, Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem, Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs, Discovering the suitability of optimisation algorithms by learning from evolved instances, Traveling salesman problem heuristics: leading methods, implementations and latest advances, Cyclic transfers in school timetabling, Determination method for power-saved driving motions of manipulators by heuristic algorithms (in case of PTP control), Survivable network design with demand uncertainty, Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times, Using Markov chains to analyze the effectiveness of local search algorithms, Hybridizing evolutionary algorithms with variable-depth search to overcome local optima, An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem, Local search: is brute-force avoidable?, Introduction to computation and learning in artificial neural networks, A variable depth search branching, An efficient implementation of local search algorithms for constrained routing problems, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, The Hamiltonian p-median problem, Facet identification for the symmetric traveling salesman polytope, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, Seeking global edges for traveling salesman problem in multi-start search, Vehicle routing with compartments: applications, modelling and heuristics, Political districting: From classical models to recent approaches, Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem, Algorithm runtime prediction: methods \& evaluation, On single courier problem, On fast trust region methods for quadratic models with linear constraints, Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm, Optimal partitioning of a data set based on the \(p\)-median model, Golden ratio versus pi as random sequence sources for Monte Carlo integration, A \(k\)-level data structure for large-scale traveling salesman problems, A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, Bounding, filtering and diversification in CP-based local branching, Experimental analysis of heuristics for the bottleneck traveling salesman problem, A filter-and-fan approach to the job shop scheduling problem, Shift-and-propagate, A modified Lin--Kernighan traveling-salesman heuristic, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, A hybrid evolutionary algorithm for the periodic location-routing problem, A survey of very large-scale neighborhood search techniques, Models, relaxations and exact approaches for the capacitated vehicle routing problem, A solution approach to the inventory routing problem in a three-level distribution system, Adaptive memory programming for matrix bandwidth minimization, Budgeted matching and budgeted matroid intersection via the gasoline puzzle, NeuroGenetic approach for combinatorial optimization: an exploratory analysis, A framework for analyzing sub-optimal performance of local search algorithms, Two-phase Pareto local search for the biobjective traveling salesman problem, Match twice and stitch: a new TSP tour construction heuristic., A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, A GRASP\(\times \)ELS approach for the capacitated location-routing problem, A heuristic approach for the travelling purchaser problem, A library of local search heuristics for the vehicle routing problem, An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem, A diagonal completion and 2-optimal procedure for the travelling salesman problem, Randomized gravitational emulation search algorithm for symmetric traveling salesman problem, A novel iterative shape from focus algorithm based on combinatorial optimization, Global versus local search: the impact of population sizes on evolutionary algorithm performance, An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms, Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem, Markovian neural networks, A study of the application of Kohonen-type neural networks to the travelling salesman problem, Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem, Efficiently solving the traveling thief problem using hill climbing and simulated annealing, Recent trends in combinatorial optimization, Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry, Solution of large-scale symmetric travelling salesman problems, Performance analysis of cyclical simulated annealing algorithms, Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability, A new heuristic algorithm for laser antimissile strategy optimization, A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Variable and large neighborhood search to solve the multiobjective set covering problem, A user's guide to tabu search, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Multi-way graph partition by stochastic probe, Further results on the probabilistic traveling salesman problem, Problems of discrete optimization: challenges and main approaches to solve them, Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics, Genetic operators for combinatorial optimization in TSP and microarray gene ordering, Special cases of travelling salesman problems and heuristics, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Political districting: from classical models to recent approaches, Proper balance between search towards and along Pareto front: biobjective TSP case study, Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery, Improving the robustness of EPS to solve the TSP, An effective hybrid search algorithm for the multiple traveling repairman problem with profits, The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem, An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem, Order batching using an approximation for the distance travelled by pickers, A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes, Discrete heat transfer search for solving travelling salesman problem, Large multiple neighborhood search for the soft-clustered vehicle-routing problem, A progressive filtering heuristic for the location-routing problem and variants, Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach, The traveling salesman problem with job-times (\textit{TSPJ}), A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection, An iterative matheuristic for the inventory routing problem, Reinforcement learning for combinatorial optimization: a survey, A variable depth neighborhood search algorithm for the min-max arc crossing problem, Wave order picking under the mixed-shelves storage strategy: a solution method and advantages, The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms, Capping methods for the automatic configuration of optimization algorithms, Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems, A partitioning column approach for solving LED sorter manipulator path planning problems, Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems, Optimal composition of real-time systems, A stabilized column generation scheme for the traveling salesman subtour problem, \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices, A study on the effects of normalized TSP features for automated algorithm selection, Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP, Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs, Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem, Generation techniques for linear programming instances with controllable properties, Hybrid evolutionary search for the traveling repairman problem with profits, Searching for better fill-in, Discrete optimization by optimal control methods. II: The static traveling salesman problem, Heuristics for the lexicographic Max-ordering vehicle routing problem, FINITE SIZE SCALING AND CRITICAL TRANSITION IN CONSTRAINED TRAVELING SALESMAN PROBLEM, An improved simulated annealing algorithm for bandwidth minimization, On the neighborhood structure of the traveling salesman problem generated by local search moves, Exploiting relaxation in local search for LABS, Generalization of machine learning for problem reduction: a case study on travelling salesman problems, A linearithmic heuristic for the travelling salesman problem, A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem, On the variable-depth-search heuristic for the linear-cost generalized assignment problem, The component model for elementary landscapes and partial neighborhoods, Emergency response in natural disaster management: allocation and scheduling of rescue units, Solution of real-world postman problems, Determination of the candidate arc set for the asymmetric traveling salesman problem, A unified framework for partial and hybrid search methods in constraint programming, Sequential search and its application to vehicle-routing problems, A simple filter-and-fan approach to the facility location problem, Expanding neighborhood GRASP for the traveling salesman problem, Fast and high precision algorithms for optimization in large-scale genomic problems, Dynamics of local search trajectory in traveling salesman problem, Algorithms for the design of network topologies with balanced disjoint rings, An efficient heuristic algorithm for the bottleneck traveling salesman problem, A Neural-Network-Based Approach to the Double Traveling Salesman Problem, Theoretical insights into the augmented-neural-network approach for combinatorial optimization, The clustered team orienteering problem, Iterated greedy for the maximum diversity problem, A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints, Patch Ordering as a Regularization for Inverse Problems in Image Processing, A greedy randomized adaptive search procedure for the orienteering problem with hotel selection, A survey on matheuristics for routing problems, Continuous relaxations for the traveling salesman problem, Nonoblivious 2-Opt heuristics for the traveling salesman problem, A stochastic inventory routing problem for infectious medical waste collection, A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem, A Hybrid Heuristic for an Inventory Routing Problem, The Generalized Covering Salesman Problem, A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP, Learning directed acyclic graph SPNs in sub-quadratic time, Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories, ``Conscientious neural nets for tour construction in the traveling salesman problem: The vigilant net, Dynamic traveling salesman problem with stochastic release dates, An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity, Implementation analysis of efficient heuristic algorithms for the traveling salesman problem, A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems, 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 heuristic and an exact method for the gate matrix connection cost minimization problem, A fast metaheuristic for the travelling salesperson problem with hotel selection, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, An efficient evolutionary algorithm for the ring star problem, Randomized algorithms in combinatorial optimization: A survey, Coordination of production and distribution planning, Probabilistic exchange algorithms and Euclidean traveling salesman problems, A parallel tabu search algorithm for large traveling salesman problems, A fast optimization method based on a hierarchical strategy for the travelling salesman problem, Average and worst-case analysis of heuristics for the maximum tardiness problem, The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem, Traveling salesman problems with PageRank distance on complex networks reveal community structure, Implementation techniques for the vehicle routing problem, Optimization of a 532-city symmetric traveling salesman problem by branch and cut, 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, Structural analysis of local search heuristics in combinatorial optimization, Generalized travelling salesman problem through n sets of nodes: The asymmetrical case, Making a state-of-the-art heuristic faster with data mining, The Convex-hull-and-k-line Travelling Salesman Problem, A linear programming approach to reasoning about probabilities, A bi-criteria heuristic for the vehicle routing problem with time windows, Scaling features in complex optimization problems, 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, GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem, TSP ejection chains, 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, 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., Multiobjective network scheduling with efficient use of renewable and nonrenewable resources, Heuristics and their design: A survey, Genetic local search with distance preserving recombination operator for a vehicle routing problem., A direct stochastic algorithm for global search, 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, Integrating purchasing and routing in a propane gas supply chain., 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, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, 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, Hybrid parallel tempering and simulated annealing method, The life span method -- a new variant of local search, Combination of local search and CLP in the vehicle-fleet scheduling problem, 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, An empirical study of a new metaheuristic for the traveling salesman problem, A model for warehouse order picking, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, A bicriteria two-machine permutation flowshop problem, An effective implementation of the Lin-Kernighan traveling salesman 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, The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling, Local search algorithms for the multiprocessor flow shop scheduling problem, Production planning and scheduling for an integrated container company, 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, Method to solve the travelling salesman problem using the inverse of diffusion process, Genetic local search in combinatorial optimization, Relaxed tours and path ejections for the traveling salesman problem, A two-dimensional mapping for the traveling salesman problem, Using entropy-based methods to study general constrained parameter optimization problems, Embedded local search approaches for routing optimization, A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem, Data structures and ejection chains for solving large-scale traveling salesman problems, The split delivery vehicle scheduling problem with time windows and grid network distances, Hybrid search with neighborhood reduction for the multiple traveling salesman problem, An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem, Physical mapping of chromosomes: A combinatorial problem in molecular biology, A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection, An efficient implementation of a static move descriptor-based local search heuristic, Picker routing in rectangular mixed shelves warehouses, Many-objective Pareto local search, A two-phase solution algorithm for the flexible periodic vehicle routing problem, Technical note: the expected length of an orderly path, A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations, Heuristic solution approaches to operational forest planning problems, Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem, Mathematical programming in computational biology: an annotated bibliography, Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics, Ejection chains, reference structures and alternating path methods for traveling salesman problems, Divide and conquer strategies for parallel TSP heuristics, Combining simulated annealing with local search heuristics, Dynamic tabu search strategies for the traveling purchaser problem, Genetic algorithms for the traveling salesman problem, Genetic and hybrid algorithms for graph coloring, Designing and reporting on computational experiments with heuristic methods, Parallel local search, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, Variable neighbourhood structures for cycle location problems, A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem, A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution, Optimally solving the joint order batching and picker routing problem, Typology and literature review for dial-a-ride problems, An ILP-based local search procedure for the VRP with pickups and deliveries, A survey of the standard location-routing problem, The late acceptance hill-climbing heuristic, The selective traveling salesman problem with emission allocation rules, A constrained power method for community detection in complex networks, A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem., HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle, Knowledge-guided local search for the vehicle routing problem, Dynamic vehicle routing problems with enhanced ant colony optimization, A hybrid ant colony optimization for dynamic multidepot vehicle routing problem, A self-organizing neural network approach for the single AGV routing problem, Solving the traveling salesman problem with interdiction and fortification, Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches, What makes a VRP solution good? The generation of problem-specific knowledge for heuristics, Record breaking optimization results using the ruin and recreate principle, An efficient local search for the feedback vertex set problem, Automating planning and scheduling of shuttle payload operations, Efficiently solving very large-scale routing problems, A comparison of algorithms for finding an efficient theme park tour, A genetic algorithm for a green vehicle routing problem, POPMUSIC for the travelling salesman problem, An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing, Visualizing network communities with a semi-definite programming method, The traveling purchaser problem and its variants, The set orienteering problem, Large multiple neighborhood search for the clustered vehicle-routing problem, Solving travelling salesman problem using ant systems: a programmer's approach, A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations, An integer programming-based local search for the covering salesman problem, An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem, Measuring instance difficulty for combinatorial optimization problems, A self-guided genetic algorithm for permutation flowshop scheduling problems, The effect of the asymmetry of road transportation networks on the traveling salesman problem, A TABU search heuristic for the team orienteering problem, A heuristic algorithm for the truckload and less-than-truckload problem, Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem, A theoretical study on the behavior of simulated annealing leading to a new cooling schedule, A hybrid heuristic for the maximum dispersion problem, Routing automated lane-guided transport vehicles in a warehouse handling returns, Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem, Exact and heuristic algorithms for routing AGV on path with precedence constraints, On the depth of combinatorial optimization problems, Paroid search: Generic local combinatorial optimization, Distances between traveling salesman tours, Guided local search and its application to the traveling salesman problem, Adaptive schedules for ensemble-based threshold accepting, Analysis of static simulated annealing algorithms, A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing, TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer, Asymptotic expected performance of some TSP heuristics: An empirical evaluation, Heuristic methods and applications: A categorized survey, A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows, A parallel variable neighborhood search for solving covering salesman problem, A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak, A covering traveling salesman problem with profit in the last mile delivery, Stronger \(K\)-tree relaxations for the vehicle routing problem, Computing in combinatorial optimization, Approximate algorithms for the travelling purchaser problem, k-interchange procedures for local search in a precedence-constrained routing problem, Approximation algorithms with constant ratio for general cluster routing problems, Adjacency on combinatorial polyhedra, An efficient genetic algorithm for the traveling salesman problem with precedence constraints, A search heuristic for the sequence-dependent economic lot scheduling problem, Analyzing the performance of TSP solver methods, Case injected genetic algorithms for traveling salesman problems, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, Complex adaptive systems: Exploring the known, the unknown and the unknowable, A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization, Smoothed Analysis of Local Search Algorithms, Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem, An algorithm for constructing optimal resolvable incomplete block designs, A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths, A generalized model and a heuristic algorithm for the large-scale covering tour problem, A STUDY OF MASSIVELY PARALLEL SIMULATED ANNEALING ALGORITHMS FOR CHROMOSOME RECONSTRUCTION VIA CLONE ORDERING, Branch and bound algorithms for the multidimensional assignment problem, D-Wave and predecessors: From simulated to quantum annealing, A continuous linear optimization model for the exact solution of travelling-salesman-problems in connexion with expansion planning of ring networks, An efficient heuristic algorithm for minimum matching, xegaPermGene, Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case, Analysis of a High-Performance TSP Solver on the GPU, A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem, On the complexity of incremental computation, New TSP construction heuristics and their relationships to the 2-opt, HYBRID NEWTON-RAPHSON GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, 2-Opt Moves and Flips for Area-optimal Polygonizations, Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Approximation performance of ant colony optimization for the TSP(1,2) problem, Scheduling Large-Scale Advance-Request Dial-A-Ride Systems, A Matheuristic for the Multivehicle Inventory Routing Problem, Unnamed Item, Bounds for the symmetric 2-peripatetic salesman problem, Hybrid Nested Partitions Method for the Traveling Salesman Problem, Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem, Optimization of logistics services in hospitals, Unnamed Item, Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme, A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming, A Local-Search Algorithm for Steiner Forest, Visiting near-optimal solutions using local search algorithms, A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search, An experimental study of variable depth search algorithms for the quadratic assignment problem, Integrating operations research in constraint programming, Implementation of a linear time algorithm for certain generalized traveling salesman problems, Dynamic weighting in Monte Carlo and optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, The Period Vehicle Routing Problem and its Extensions, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, Vehicle Routing Problems with Inter-Tour Resource Constraints, Integrating operations research in constraint programming, Ejection chain and filter-and-fan methods in combinatorial optimization, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Analytic constant thermodynamic speed-cooling strategies in simulated annealing, Neutrality in fitness landscapes., The travelling salesman problem: selected algorithms and heuristics†, Feature-based operation sequence generation in CAPP, Facilities layout design optimization with single loop material flow path configuration, Variable neighborhood search: Principles and applications, A stochastic local search algorithm for constrained continuous global optimization, Monitoring and control of anytime algorithms: A dynamic programming approach, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem, The adjacency relation on the traveling salesman polytope is NP-Complete, Optimizing marine cargo in the Aegean with the simulated annealing algorithm, Cyclic job scheduling in paced assembly lines with cross-trained workers, The landscape of the traveling salesman problem, Algorithms for Euclidean Degree Bounded Spanning Tree Problems, Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem, Affinity propagation and uncapacitated facility location problems, A generalized exchange heuristic for the capacitated vehicle routing problem, Provably good solutions for the traveling salesman problem, Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP, Chain partitioning as a key element for building vehicle routing problem heuristics, Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP, Unnamed Item, The snake for visualizing and for counting clusters in multivariate data, A hybrid data mining metaheuristic for the p‐median problem, The Mothership and Drone Routing Problem, NP-Complete operations research problems and approximation algorithms, PARALLEL TEMPERING FOR THE TRAVELING SALESMAN PROBLEM, The ALGACEA‐1 method for the capacitated vehicle routing problem, COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS, Cluster-level operations planning for the out-of-position robotic arc-welding, Low order polynomial bounds on the expected performance of local improvement algorithms, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Unnamed Item, Discrete/Binary Approach, Discrete Set Handling, COBLOC: A hierarchical method for blocking network data, Modeling Single-Picker Routing Problems in Classical and Modern Warehouses, Improving TSP Tours Using Dynamic Programming over Tree Decompositions., Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints, Toward unification of exact and heuristic optimization methods, On line Routing per Mobile Phone A Case on Subsequent Deliveries of Newspapers, Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order, Self-configuring Nature Inspired Algorithms for Combinatorial Optimization Problems, Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem, Template design under demand uncertainty by integer linear local search, SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS, On the refinement of bounds of heuristic algorithms for the traveling salesman problem, The multiobjective multidimensional knapsack problem: a survey and a new approach, Extracting embedded generalized networks from linear programming problems, A GRASP/Path‐Relinking algorithm for the traveling purchaser problem, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, Exact models for the flying sidekick traveling salesman problem, Effective metaheuristics for the latency location routing problem, Heuristic sequencing methods for time optimal tracking of nested, open and closed paths, Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery, Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time, CBAC4C: conflict‐based VM isolation control for cloud computing, A Survey of the Generalized Assignment Problem and Its Applications, A reinforced hybrid genetic algorithm for the traveling salesman problem, An iterated local search algorithm for latency vehicle routing problems with multiple depots, A three-phase heuristic for the fairness-oriented crew rostering problem, A 3/4 differential approximation algorithm for traveling salesman problem, An adaptive memory matheuristic for the set orienteering problem, The generalized close enough traveling salesman problem, New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem, A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms, Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems, The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem, Memetic search for the minmax multiple traveling salesman problem with single and multiple depots, Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness, Some contributions of Ailsa H. Land to the study of the traveling salesman problem, On the generation of metric TSP instances with a large integrality gap by branch-and-cut, The seeds of the NEH algorithm: an overview using bibliometric analysis, Time complexity of the analyst's traveling salesman algorithm
