An adapted heuristic approach for a clustered traveling salesman problem with loading constraints (Q693154): Difference between revisions

@@ Property / cites work @@
+Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
+Normal rank
@@ Property / cites work @@
+A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
+Normal rank
@@ Property / cites work @@
+Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
+Normal rank
@@ Property / cites work @@
+Metaheuristics for the vehicle routing problem with loading constraints
+Normal rank
@@ Property / cites work @@
+The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
+Normal rank
@@ Property / cites work @@
+Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
+Normal rank
@@ Property / cites work @@
+A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
+Normal rank
@@ Property / cites work @@
+An exact method for the double TSP with multiple stacks
+Normal rank
@@ Property / cites work @@
+Exact solutions to the double travelling salesman problem with multiple stacks
+Normal rank
@@ Property / cites work @@
+The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
+Normal rank