The parallel complexity of TSP heuristics
References (19)
An observation on time-storage trade-off
J. Comput. System Sci.
(1974)- et al.
The maximum flow problem is log space complete for P
Theoret. Comput. Sci.
(1982) The NP-completeness column: An ongoing guide
- et al.
An introduction to parallelism in combinatorial optimization
Discrete Appl. Math.
(1986) - et al.
Finding Euler circuits in logarithmic parallel time
- et al.
Efficient parallel algorithms for some graph problems
Comm. ACM
(1982) Towards a complexity theory of synchronous parallel computation
Enseign. Math.
(1981)- et al.
Matrix multiplication via arithmetic progressions
- et al.
Binary trees and parallel scheduling algorithms
IEEE Trans. Comput.
(1983)
Cited by (10)
Optimal in-store fulfillment policies for online orders in an omni-channel retail environment
2021, European Journal of Operational ResearchCitation Excerpt :This heuristic iteratively builds solutions by inserting the cheapest node in its cheapest position. In our case, the cheapest option is based on the travel distance and, most importantly, on the delivery time (i.e., if the node is served within the desired time window) (Kindervater, Lenstfca, & Shmoys, 1989). The number of vehicles results from the solution of the CVRP-TW and is generally a function of the number of orders and the capacity of the vehicles, which we assume to be readily available at the store at the beginning of each route.
Priority functions for the approximation of the metric TSP
2013, Information Processing LettersCitation Excerpt :In the third phase of the heuristic a Hamiltonian circuit is constructed from the Euler tour using shortcuts in case a vertex has been visited before. In the parallel setting the first occurrence of each vertex is determined and all duplicates are eliminated (see, e.g., [16]). More precisely, list ranking is used to indicate the tree edges with respect to a chosen starting point on the Euler tour.
New parallel randomized algorithms for the traveling salesman problem
1999, Computers and Operations ResearchDivide and conquer strategies for parallel TSP heuristics
1996, Computers and Operations ResearchA Comparison of Destination Clustering using Density-based Algorithm on the Trip Planning Optimization for Last-Mile Parcel Delivery
2020, ACM International Conference Proceeding SeriesAn efficient algorithm for the tabu clustered traveling salesman problem
2019, Proceedings - 2019 Brazilian Conference on Intelligent Systems, BRACIS 2019