Computer Solutions of the Traveling Salesman Problem
From MaRDI portal
Publication:5510390
DOI10.1002/j.1538-7305.1965.tb04146.xzbMath0136.14705MaRDI 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
A Lagrangean relaxation heuristic for vehicle routing, On the number of iterations of local improvement algorithms, The decomposition of a communication network considering traffic demand interrelations, A survey of very large-scale neighborhood search techniques, 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, Markovian neural networks, Transforming asymmetric into symmetric traveling salesman problems, On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem, A parallel insert method for the capacitated arc routing problem, The multi-depot vehicle routing problem with inter-depot routes, The vehicle routing problem with flexible time windows and traveling times, On randomization and discovery, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, An efficient implementation of local search algorithms for constrained routing problems, The Hamiltonian p-median problem, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms, The optimum assignments and a new heuristic approach for the traveling salesman 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, Experimentation in optimization, Implementation techniques for the vehicle routing problem, Methods for a network design problem in solar power systems, The savings algorithm for the vehicle routing problem, Mapping DNA by stochastic relaxation, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, A comparative study of heuristics for a two-level routing-location problem, Heuristics and their design: A survey, 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, An effective structured approach to finding optimal partitions of networks, Identification of non-optimal arcs for the traveling salesman problem, The symmetric traveling salesman problem and edge exchanges in minimal 1- trees, Travelling salesman problem tools for microcomputers, The traveling salesman problem: An overview of exact and approximate algorithms, 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, Operational estimators for the length of a traveling salesman tour, Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient, 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, The life span method -- a new variant of local search, Combination of local search and CLP in the vehicle-fleet scheduling problem, An empirical study of a new metaheuristic for the traveling 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, Iterative improvement methods for a multiperiod network design 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, A two-dimensional mapping for the traveling salesman problem, A generalized insertion algorithm for the seriation problem, A fast optimization method based on a hierarchical strategy for the travelling salesman problem, A heuristic solution to the warehouse location-routing problem, The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem, A robust heuristic for the generalized assignment problem, 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 new extension of local search applied to the Dial-A-Ride problem, 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, \(k\)-interchange heuristic as an optimization procedure for material handling applications, A composite heuristic for the single machine early/tardy job scheduling problem., A heuristic for the pickup and delivery traveling salesman problem, Application of the noising method to the travelling salesman problem, An effective implementation of the Lin-Kernighan traveling salesman heuristic, 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, A heuristic algorithm for the truckload and less-than-truckload problem, Solving the vehicle routing problem with adaptive memory programming methodology, 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, k-interchange procedures for local search in a precedence-constrained routing problem, A sweep-based algorithm for the fleet size and mix vehicle routing problem, The time-dependent traveling salesman 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, A guided local search heuristic for the capacitated arc routing problem, Data structures and ejection chains for solving large-scale traveling salesman problems, A new heuristic for the period traveling salesman problem, Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison, A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions, Dynamic weighting in Monte Carlo and optimization, Heuristically aided set-covering algorithms, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, An adaptive memory programming method for risk logistics operations, Low order polynomial bounds on the expected performance of local improvement algorithms, Neighborhood Size in the Simulated Annealing Algorithm, Networks and vehicle routing for municipal waste collection, An improved heuristic for the period vehicle routing problem, A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems, Cutting path optimization in CNC cutting processes using a two-step genetic algorithm, Cluster-level operations planning for the out-of-position robotic arc-welding, The traveling-salesman problem and minimum spanning trees: Part II, Optimal design of centralized computer networks, Heuristic programming: A survey, Design of unidirectional cyclic layouts, 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, 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, Record breaking optimization results using the ruin and recreate principle, 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, 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, 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, Ant colony optimization for the traveling purchaser problem, Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem, The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments, Discrete optimization by optimal control methods. II: The static traveling salesman problem, 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., 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, Aggregation for the probabilistic traveling salesman problem, Expanding neighborhood GRASP for the traveling salesman problem, Dynamics of local search trajectory in traveling salesman problem, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, 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, On the complexity of the marriage problem, Heuristic approaches to vehicle routing with backhauls and time windows, 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, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, 2-change for k-connected networks, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), The travelling salesman problem: selected algorithms and heuristics†, Unnamed Item, On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles, Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach, Locating a cycle in a transportation or a telecommunications network, The traveling salesman problem: An update of research, Unnamed Item, Extracting embedded generalized networks from linear programming problems, Improving Christofides' lower bound for the traveling salesman problem, Using simulated annealing to solve routing and location problems, The Multi-Depot Routing Allocation Problem, Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Accelerated branch exchange heuristics for symmetric traveling salesman problems, Simulated annealing: An introduction, On the worst-case performance of some algorithms for the asymmetric traveling salesman problem, Heuristische Lösungsverfahren für Lieferplanprobleme, Some theoretical implications of local optimization, Implementing vehicle routing algorithms, The adjacency relation on the traveling salesman polytope is NP-Complete, 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
