Solving large batches of traveling salesman problems with parallel and distributed computing
From MaRDI portal
Publication:1652354
DOI10.1016/J.COR.2017.04.001zbMath1458.90558OpenAlexW2604586603MaRDI QIDQ1652354
S. G. Ozden, Alice E. Smith, Kevin R. Gue
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.04.001
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (4)
A computational software system to design order picking warehouses ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem ⋮ Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- New parallel randomized algorithms for the traveling salesman problem
- Tabu search performance on the symmetric travelling salesman problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Divide and conquer strategies for parallel TSP heuristics
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- Case-based reasoning for repetitive combinatorial optimization problems. II: Numerical results
- A Dynamic Programming Approach to Sequencing Problems
- Bounds on Multiprocessing Timing Anomalies
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- In Pursuit of the Traveling Salesman
This page was built for publication: Solving large batches of traveling salesman problems with parallel and distributed computing
