An effective and fast heuristic for the dial-a-ride problem (Q2644373): Difference between revisions

@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+The dial-a-ride problem (DARP): variants, modeling issues and algorithms
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Q5687193
@@ Property / cites work: Q5687193 / rank @@
+Normal rank
@@ Property / cites work @@
+The pickup and delivery problem with time windows
@@ Property / cites work: The pickup and delivery problem with time windows / rank @@
+Normal rank
@@ Property / cites work @@
+A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
+Normal rank
@@ Property / cites work @@
+A GRASP for the Vehicle Routing Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+The General Pickup and Delivery Problem
@@ Property / cites work: The General Pickup and Delivery Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Pickup and Delivery of Partial Loads with “Soft” Time Windows
+Normal rank
@@ Property / cites work @@
+Heuristic Algorithms for the Handicapped Persons Transportation Problem
+Normal rank
@@ Property / cites work @@
+A New Heuristic for the Traveling Salesman Problem with Time Windows
+Normal rank