A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem (Q1919781): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0305-0548(95)00052-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1999658852
@@ Property / OpenAlex ID: W1999658852 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
+Normal rank
@@ Property / cites work @@
+A Tabu Search Heuristic for the Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Parallel iterative search methods for vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Implementing an insertion heuristic for vehicle routing on parallel hardware
+Normal rank
@@ Property / cites work @@
+A TSSP+1 decomposition strategy for the vehicle routing problem
+Normal rank
@@ Property / cites work @@
+An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
+Normal rank
@@ Property / cites work @@
+A Heuristic Algorithm for the Vehicle-Dispatch Problem
+Normal rank
@@ Property / cites work @@
+A generalized exchange heuristic for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+A Lagrangean relaxation heuristic for vehicle routing
+Normal rank