The paired many-to-many pickup and delivery problem: an application (Q2343076): Difference between revisions

@@ Property / cites work @@
+A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
+Normal rank
@@ Property / cites work @@
+Dynamic pickup and delivery problems
@@ Property / cites work: Dynamic pickup and delivery problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4452941
@@ Property / cites work: Q4452941 / rank @@
+Normal rank
@@ Property / cites work @@
+The dial-a-ride problem: Models and algorithms
@@ Property / cites work: The dial-a-ride problem: Models and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
+Normal rank
@@ Property / cites work @@
+An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
+Normal rank
@@ Property / cites work @@
+General solutions to the single vehicle routing problem with pickups and deliveries
+Normal rank
@@ Property / cites work @@
+Solving the Dial-a-Ride problem using genetic algorithms
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Traveling Salesman Problem
@@ Property / cites work: An Algorithm for the Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the dial-a-ride problem
+Normal rank
@@ Property / cites work @@
+Hybrid column generation and large neighborhood search for the dial-a-ride problem
+Normal rank
@@ Property / cites work @@
+An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
+Normal rank