Pages that link to "Item:Q1432014"
From MaRDI portal
The following pages link to The dial-a-ride problem (DARP): variants, modeling issues and algorithms (Q1432014):
Displaying 43 items.
- The share-a-ride problem: people and parcels sharing taxis (Q296683) (← links)
- Tabu search for the real-world carpooling problem (Q306096) (← links)
- Measures of dynamism and urgency in logistics (Q323225) (← links)
- An adaptive large neighborhood search heuristic for the share-a-ride problem (Q342178) (← links)
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← links)
- Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
- An optimization model and a solution algorithm for the many-to-many car pooling problem (Q763101) (← links)
- Real-time split-delivery pickup and delivery time window problems with transfers (Q940817) (← links)
- A two-stage model for a day-ahead paratransit planning problem (Q1014313) (← links)
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
- Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
- Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
- Surveys in operations research (Q1730527) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
- Designing the master schedule for demand-adaptive transit systems (Q1761898) (← links)
- A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
- A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty (Q2030315) (← links)
- The complexity of the unit stop number problem and its implications to other related problems (Q2136280) (← links)
- Complexity and approximation results on the shared transportation problem (Q2149862) (← links)
- A truck scheduling problem arising in intermodal container transportation (Q2356036) (← links)
- A dial-a-ride problem for client transportation in a health-care organization (Q2433383) (← links)
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints (Q2455613) (← links)
- Eleven surveys in operations research (Q2480255) (← links)
- The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
- A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
- Twelve surveys in operations research (Q2630815) (← links)
- An effective and fast heuristic for the dial-a-ride problem (Q2644373) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations (Q2669602) (← links)
- A note on the online interval scheduling secretary problem (Q2670476) (← links)
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles (Q2673572) (← links)
- The dial-a-ride problem with private fleet and common carrier (Q2676338) (← links)
- Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation (Q3564375) (← links)
- The school bus routing and scheduling problem with transfers (Q4642460) (← links)
- A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (Q4921475) (← links)
- New Notation and Classification Scheme for Vehicle Routing Problems (Q5247680) (← links)
- A scheme for determining vehicle routes based on Arc-based service network design (Q5881488) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)