A method for solving traveling-salesman problems
From MaRDI portal
Recommendations
- Travelling salesman problem tools for microcomputers
- The traveling-salesman problem
- An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem
- Travelling salesman problem solved with simulation techniques
Cited in
(only showing first 100 items - show all)- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- A review of Hopfield neural networks for solving mathematical programming problems
- Some properties of the solution space of the N-city traveling-salesman problem
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- A note on the effect of neighborhood structure in simulated annealing
- Travelling salesman problem tools for microcomputers
- Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- A new extension of local search applied to the Dial-A-Ride problem
- \(k\)-interchange heuristic as an optimization procedure for material handling applications
- A local search template.
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- Dispatching of small containers via coastal freight liners: The case of the Aegean sea.
- Combination of geographical information system and efficient routing algorithms for real life distribution operations.
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Method to solve the travelling salesman problem using the inverse of diffusion process
- Use of the BATA algorithm and MIS to solve the mail carrier problem
- The bi-objective traveling purchaser problem with deliveries
- Evaluating the quality of online optimization algorithms by discrete event simulation
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks
- Stochastic local search with learning automaton for the swap-body vehicle routing problem
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
- Heuristics for synthesizing robust networks with a diameter constraint
- Advancing Shannon entropy for measuring diversity in systems
- The green location-routing problem
- Dynamic vehicle routing problems with enhanced ant colony optimization
- A hybrid ant colony optimization for dynamic multidepot vehicle routing problem
- Fresh seafood delivery routing problem using an improved ant colony optimization
- Application of imperialist competitive algorithm on solving the traveling salesman problem
- Exact algorithms for the equitable traveling salesman problem
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- Paroid search: Generic local combinatorial optimization
- Guided local search and its application to the traveling salesman problem
- TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
- Constrained spanning trees and the traveling salesman problem
- The heuristic search under conditions of error
- Heuristics for the black and white traveling salesman problem
- A guided local search heuristic for the capacitated arc routing problem
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
- Algorithms for the metric ring star problem with fixed edge-cost ratio
- Circular Jaccard distance based multi-solution optimization for traveling salesman problems
- A branch-and-price algorithm for the ring-tree facility location problem
- Novel concave hull-based heuristic algorithm for TSP
- Multiple k-opt evaluation multiple k-opt moves with GPU high performance local search to large-scale traveling salesman problems
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
- Emergency relief routing models for injured victims considering equity and priority
- Combining local search and elicitation for multi-objective combinatorial optimization
- New mathematical model for the bi-objective inventory routing problem with a step cost function: a multi-objective particle swarm optimization solution approach
- The influence of problem specific neighborhood structures in metaheuristics performance
- A fast metaheuristic for the travelling salesperson problem with hotel selection
- The multi-vehicle profitable pickup and delivery problem
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A variable neighborhood search heuristic for periodic routing problems
- Evolution-inspired local improvement algorithm solving orienteering problem
- An approximation of the customer waiting time for online restaurants owning delivery system
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A travelling salesman problem (TSP) with multiple job facilities.
- Time-dependent travelling salesman problem.
- Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies
- Sequential search and its application to vehicle-routing problems
- First vs. best improvement: an empirical study
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- 2-change for k-connected networks
- Heuristic methods to consecutive block minimization
- Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- Discrete heat transfer search for solving travelling salesman problem
- A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
- Reinforcement learning for combinatorial optimization: a survey
- A variable neighborhood search algorithm for an integrated physician planning and scheduling problem
- \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices
- A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem
- A new approach to solve the classical symmetric traveling salesman problem by zero suffix method
- Unified encoding for hyper-heuristics with application to bioinformatics
- TSP race: minimizing completion time in time-sensitive applications
- scientific article; zbMATH DE number 4191408 (Why is no real title available?)
- scientific article; zbMATH DE number 3882227 (Why is no real title available?)
- Ordered spatial sampling by means of the traveling salesman problem
- A hybrid algorithm for a class of vehicle routing problems
- An iterated local search heuristic for the split delivery vehicle routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- The multiple team formation problem using sociometry
- A large neighbourhood based heuristic for two-echelon routing problems
- Recent models and algorithms for one-to-one pickup and delivery problems
- A concise guide to the Traveling Salesman Problem
- Little's method with optimal reduction of a matrix
- Discrete set handling
- scientific article; zbMATH DE number 3906261 (Why is no real title available?)
- A continuous linear optimization model for the exact solution of travelling-salesman-problems in connexion with expansion planning of ring networks
- scientific article; zbMATH DE number 4031726 (Why is no real title available?)
- Travelling salesman problem solved with simulation techniques
- Birth of a salesman
This page was built for publication: A method for solving traveling-salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378825)
