Computer Solutions of the Traveling Salesman Problem
From MaRDI portal
Publication:5510390
DOI10.1002/j.1538-7305.1965.tb04146.xzbMath0136.14705OpenAlexW2148673189MaRDI QIDQ5510390
Publication date: 1965
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1965.tb04146.x
Related Items
Experimentation in optimization, Implementation techniques for the vehicle routing problem, Methods for a network design problem in solar power systems, An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup, Iterated local search for the team orienteering problem with time windows, Quasiabelian landscapes of the traveling salesman problem are elementary, An optimization approach for communal home meal delivery service: A case study, Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, The savings algorithm for the vehicle routing problem, Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints, The multi-compartment vehicle routing problem with flexible compartment sizes, Mapping DNA by stochastic relaxation, The multi-depot vehicle routing problem with inter-depot routes, Ordered spatial sampling by means of the traveling salesman problem, A memetic algorithm for the travelling salesperson problem with hotel selection, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy, The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation, The production routing problem: a review of formulations and solution algorithms, A heuristic algorithm for a supply chain's production-distribution planning, The vehicle routing problem with flexible time windows and traveling times, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, On randomization and discovery, A Lagrangean relaxation heuristic for vehicle routing, On the number of iterations of local improvement algorithms, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism, The orienteering problem: a survey, An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows, A comparative study of heuristics for a two-level routing-location problem, Heuristics and their design: A survey, Instance-specific multi-objective parameter tuning based on fuzzy logic, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, A modular algorithm for an extended vehicle scheduling problem, A variable depth search branching, An effective structured approach to finding optimal partitions of networks, An efficient implementation of local search algorithms for constrained routing problems, The Hamiltonian p-median problem, Securing home health care in times of natural disasters, Identification of non-optimal arcs for the traveling salesman problem, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, Seeking global edges for traveling salesman problem in multi-start search, The symmetric traveling salesman problem and edge exchanges in minimal 1- trees, Travelling salesman problem tools for microcomputers, Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem, A discrete gravitational search algorithm for solving combinatorial optimization problems, The decomposition of a communication network considering traffic demand interrelations, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, The traveling salesman problem: An overview of exact and approximate algorithms, A \(k\)-level data structure for large-scale traveling salesman problems, Solving combinatorial optimization problems using Karmarkar's algorithm, Large-step Markov chains for the TSP incorporating local search heuristics, The vehicle routing problem: An overview of exact and approximate algorithms, Quick updates for \(p\)-opt TSP heuristics, On when to stop sampling for the maximum, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, Operational estimators for the length of a traveling salesman tour, A survey of very large-scale neighborhood search techniques, Honey bees mating optimization algorithm for large scale vehicle routing problems, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, A path relinking approach for the team orienteering problem, The multi-shift vehicle routing problem with overtime, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, A two-phase hybrid metaheuristic for the vehicle routing problem with time windows, On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm, Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite, Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient, Symmetric traveling salesman problems, Heuristics for the multi-period orienteering problem with multiple time windows, An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem, A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem, Optimizing tabu list size for the traveling salesman problem, A Lagrangean heuristic for the maximal covering location problem, The team orienteering problem, A fast and effective heuristic for the orienteering problem, A heuristic algorithm for the asymmetric capacitated vehicle routing problem, Genetic algorithms and traveling salesman problems, Markovian neural networks, Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, The life span method -- a new variant of local search, Introducing possibilistic logic in ILP for dealing with exceptions, On the tour planning problem, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, Decomposition, reformulation, and diving in university course timetabling, A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars, The school bus routing problem: a review, Transgenetic algorithm for the traveling purchaser problem, Heuristic algorithms for the multi-depot ring-star problem, Efficiently solving the traveling thief problem using hill climbing and simulated annealing, Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles, Transforming asymmetric into symmetric traveling salesman problems, The optimum assignments and a new heuristic approach for the traveling salesman problem, On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem, A parallel insert method for the capacitated arc routing problem, A note on finding a shortest complete cycle in an undirected graph, An algorithm for the traveling salesman problem with pickup and delivery customers, 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, A generalized insertion algorithm for the seriation problem, A fast optimization method based on a hierarchical strategy for the travelling salesman problem, SDP-based bounds for graph partition via extended ADMM, A heuristic solution to the warehouse location-routing problem, The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem, A matheuristic approach to the orienteering problem with service time dependent profits, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Solving real-life vehicle routing problems efficiently using tabu search, Incorporating vehicle into the vehicle routing fleet composition problem, Further results on the probabilistic traveling salesman problem, A robust heuristic for the generalized assignment problem, Ant colony optimization for solving an industrial layout problem, A heuristic for the routing and carrier selection problem, Problems of discrete optimization: challenges and main approaches to solve them, Data structures and ejection chains for solving large-scale traveling salesman problems, Tabu search performance on the symmetric travelling salesman problem, A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints, A guided tabu search for the vehicle routing problem with two-dimensional loading constraints, An evolutionary algorithm for the vehicle routing problem with route balancing, A variable neighborhood search heuristic for periodic routing problems, Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, A new heuristic for the period traveling salesman problem, Boosting ant colony optimization via solution prediction and machine learning, A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods, Ant colony optimization for the traveling purchaser problem, Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison, A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem, Improved exact approaches for row layout problems with departments of equal length, A hybrid genetic algorithm for the heterogeneous dial-a-ride problem, Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks, A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection, Using artificial neural networks to solve the orienteering problem, A tabu search heuristic for the multi-depot vehicle routing problem, Combining simulated annealing with local search heuristics, Genetic algorithms for the traveling salesman problem, Genetic and hybrid algorithms for graph coloring, Parallel local search, A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes, A new extension of local search applied to the Dial-A-Ride problem, Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands, Improvement heuristics for the vehicle routing problem based on simulated annealing, Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms, The Euclidean traveling salesman problem and a space-filling curve, Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems, \(k\)-interchange heuristic as an optimization procedure for material handling applications, Order matters -- a variable neighborhood search for the swap-body vehicle routing problem, Multi-trip pickup and delivery problem with time windows and synchronization, A composite heuristic for the single machine early/tardy job scheduling problem., Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem, Heuristics for routing heterogeneous unmanned vehicles with fuel constraints, HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle, A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem, Record breaking optimization results using the ruin and recreate principle, Tour recommendation for groups, A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem, Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system, Granular tabu search for the pickup and delivery problem with time windows and electric vehicles, A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation, Emergency response in natural disaster management: allocation and scheduling of rescue units, A heuristic algorithm for the truckload and less-than-truckload problem, Solving the vehicle routing problem with adaptive memory programming methodology, A guided local search procedure for the multi-compartment capacitated arc routing problem, An adaptive VNS algorithm for vehicle routing problems with intermediate stops, A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups, Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem, Exact and hybrid methods for the multiperiod field service routing problem, Sequential and parallel local search for the time-constrained traveling salesman problem, Guided local search and its application to the traveling salesman problem, Future paths for integer programming and links to artificial intelligence, Combination of local search and CLP in the vehicle-fleet scheduling problem, A heuristic for the pickup and delivery traveling salesman problem, Computing in combinatorial optimization, k-interchange procedures for local search in a precedence-constrained routing problem, An empirical study of a new metaheuristic for the traveling salesman problem, Application of the noising method to the travelling salesman problem, Combined location-routing problems: A synthesis and future research directions, A bicriteria two-machine permutation flowshop problem, Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study, An efficient composite heuristic for the symmetric generalized traveling salesman problem, An effective implementation of the Lin-Kernighan traveling salesman heuristic, The influence of problem specific neighborhood structures in metaheuristics performance, A sweep-based algorithm for the fleet size and mix vehicle routing problem, Iterative improvement methods for a multiperiod network design problem, The time-dependent traveling salesman problem, A branch and bound algorithm for symmetric 2-peripatetic salesman problems, Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation, Perturbation heuristics for the pickup and delivery traveling salesman problem, The period traveling salesman problem: A new heuristic algorithm, Heuristic solutions to multi-depot location-routing problems, A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls, A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints, A two-phase tabu search approach to the location routing problem, Heuristics for the black and white traveling salesman problem, A visual interactive approach to vehicle routing, Performance evaluation of acceptance probability functions for multi-objective SA, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows, A two-dimensional mapping for the traveling salesman problem, Improving Christofides' lower bound for the traveling salesman problem, A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit, A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems, Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem, Using simulated annealing to solve routing and location problems, 2-change for k-connected networks, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), REAL-LIFE VEHICLE ROUTING WITH TIME WINDOWS FOR VISUAL ATTRACTIVENESS AND OPERATIONAL ROBUSTNESS, Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery, Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions, A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions, Discrete heat transfer search for solving travelling salesman problem, Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics, The traveling purchaser problem with fast service option, The Multi-Depot Routing Allocation Problem, On using learning automata for fast graph partitioning, On the complexity of incremental computation, The traveling-salesman problem and minimum spanning trees: Part II, A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem, Optimal design of centralized computer networks, Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Heuristic programming: A survey, In-depth analysis of granular local search for capacitated vehicle routing, An improved heuristic for the period vehicle routing problem, Hybrid Nested Partitions Method for the Traveling Salesman Problem, Unnamed Item, Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems, Accelerated branch exchange heuristics for symmetric traveling salesman problems, An Investigation on Compound Neighborhoods for VRPTW, Heuristische Lösungsverfahren für Lieferplanprobleme, Dynamical Systems Theory and Algorithms for NP-hard Problems, The Vehicle Routing Problem with Release and Due Dates, Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach, Optimal sequential replenishment of ships during combat, Recent progress of local search in handling the time window constraints of the vehicle routing problem, The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments, Design of unidirectional cyclic layouts, Discrete optimization by optimal control methods. II: The static traveling salesman problem, Decomposing SAT Instances with Pseudo Backbones, A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm, Vehicle routing problems with simultaneous pick-up and delivery service., The travelling salesman and the PQ-tree, Dynamic weighting in Monte Carlo and optimization, Routing a Heterogeneous Fleet of Vehicles, The Split Delivery Vehicle Routing Problem: A Survey, Challenges and Advances in A Priori Routing, Simulated annealing: An introduction, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Some theoretical implications of local optimization, A particle swarm optimization algorithm with path relinking for the location routing problem, Determination of the candidate arc set for the asymmetric traveling salesman problem, The travelling salesman problem: selected algorithms and heuristics†, Implementing vehicle routing algorithms, Aggregation for the probabilistic traveling salesman problem, Expanding neighborhood GRASP for the traveling salesman problem, Heuristically aided set-covering algorithms, Dynamics of local search trajectory in traveling salesman problem, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, Locating a cycle in a transportation or a telecommunications network, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, An adaptive memory programming method for risk logistics operations, Cutting path optimization in CNC cutting processes using a two-step genetic algorithm, The adjacency relation on the traveling salesman polytope is NP-Complete, A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem, Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system, Facets and valid inequalities for the time-dependent travelling salesman problem, An iterated local search algorithm for the vehicle routing problem with backhauls, The one-dimensional cutting stock problem with sequence-dependent cut losses, Heuristiques pour le Problème du Vendeurm-Péripatétique, Nonoblivious 2-Opt heuristics for the traveling salesman problem, The split delivery capacitated team orienteering problem, A template-based adaptive large neighborhood search for the consistent vehicle routing problem, Interval estimation of a global optimum for large combinatorial problems, Point estimation of a global optimum for large combinatorial problems, Pairs of Adjacent Hamiltonian Circuits with Small Intersection, A statistical approach to the tsp, PARALLEL TEMPERING FOR THE TRAVELING SALESMAN PROBLEM, Cluster-level operations planning for the out-of-position robotic arc-welding, Integrated bus transit scheduling for the Beijing bus group based on a unified mode of operation, Low order polynomial bounds on the expected performance of local improvement algorithms, The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension, Self-tuning of the noising methods, On the complexity of the marriage problem, Neighborhood Size in the Simulated Annealing Algorithm, Heuristic approaches to vehicle routing with backhauls and time windows, Improving TSP Tours Using Dynamic Programming over Tree Decompositions., A set covering based matheuristic for a real‐world city logistics problem, A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems, A tabu search heuristic for the truck and trailer routing problem, MOAQ and ant-Q algorithm for multiple objective optimization problems, Fast local search algorithms for the handicapped persons transportation problem, On the worst-case performance of some algorithms for the asymmetric traveling salesman problem, The traveling salesman problem: An update of research, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles, Unnamed Item, Networks and vehicle routing for municipal waste collection, Extracting embedded generalized networks from linear programming problems, An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls, The intermittent travelling salesman problem, The r‐interdiction selective multi‐depot vehicle routing problem, A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints, A reinforced hybrid genetic algorithm for the traveling salesman problem, Routing in offshore wind farms: a multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat, New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem, A branch-and-cut algorithm for the balanced traveling salesman problem, Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems, Routing Courier Delivery Services with Urgent Demand, Planification des tournées dans le domaine de la messagerie rapide, The solution of some 100-city travelling salesman problems, Some contributions of Ailsa H. Land to the study of the traveling salesman problem, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Variable neighborhood search: Principles and applications, The noising methods: A generalization of some metaheuristics, A tabu search method for the truck and trailer routing problem, Statistical mechanics methods and phase transitions in optimization problems, Request evaluation strategies for carriers in auction-based collaborations
