Computer Solutions of the Traveling Salesman Problem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- 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
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- 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
- Introducing possibilistic logic in ILP for dealing with exceptions
- 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
- Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
- 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 matheuristic approach to the orienteering problem with service time dependent profits
- 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
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- Multi-trip pickup and delivery problem with time windows and synchronization
- 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
- Tour recommendation for groups
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
- A heuristic algorithm for the truckload and less-than-truckload problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- 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
- 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
This page was built for publication: Computer Solutions of the Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5510390)
