An adaptive large neighborhood search heuristic for the share-a-ride problem (Q342178): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2015.08.008
@@ Property / DOI: 10.1016/j.cor.2015.08.008 / rank @@
-Normal rank
@@ Property / cites work @@
+An adaptive large neighborhood search heuristic for the pollution-routing problem
+Normal rank
@@ Property / cites work @@
+The dial-a-ride problem (DARP): variants, modeling issues and algorithms
+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 @@
+Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
+Normal rank
@@ Property / cites work @@
+The share-a-ride problem: people and parcels sharing taxis
+Normal rank
@@ Property / cites work @@
+A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
+Normal rank
@@ Property / cites work @@
+An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
+Normal rank
@@ Property / cites work @@
+The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the dial-a-ride problem
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2015.08.008
@@ Property / DOI: 10.1016/J.COR.2015.08.008 / rank @@
+Normal rank