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 (only showing first 100 items - show all)
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
This page was built for publication: Computer Solutions of the Traveling Salesman Problem
