Pages that link to "Item:Q2480256"
From MaRDI portal
The following pages link to The dial-a-ride problem: Models and algorithms (Q2480256):
Displayed 50 items.
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem (Q296680) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- The dial-A-ride problem with transfers (Q336745) (← links)
- Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
- Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives (Q339640) (← links)
- An adaptive large neighborhood search heuristic for the share-a-ride problem (Q342178) (← links)
- An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360) (← links)
- Special issue on vehicle routing and scheduling: recent trends and advances (Q375973) (← links)
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
- A reduction approach to the two-campus transport problem (Q490382) (← links)
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
- A stochastic model for a vehicle in a dial-a-ride system (Q613349) (← 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)
- Dynamic pickup and delivery problems (Q1038370) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- Algorithmic analysis for ridesharing of personal vehicles (Q1630989) (← links)
- Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation (Q1652021) (← links)
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211) (← links)
- Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
- Trends in transportation and logistics (Q1681388) (← links)
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
- Crane scheduling in railway yards: an analysis of computational complexity (Q1707828) (← links)
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (Q1730662) (← links)
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
- Dynamic courier routing for a food delivery service (Q1738833) (← links)
- Benchmarking online dispatch algorithms for emergency medical services (Q1751696) (← links)
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
- Optimisation of maintenance routing and scheduling for offshore wind farms (Q1752172) (← links)
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
- A comparison of two meta-heuristics for the pickup and delivery problem with transshipment (Q1782171) (← links)
- Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive (Q1786606) (← links)
- A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
- The EMS vehicle patient transportation problem during a demand surge (Q2022301) (← links)
- Serving rides of equal importance for time-limited dial-a-ride (Q2117614) (← links)
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
- A dynamic tree algorithm for peer-to-peer ridesharing matching (Q2129373) (← links)
- The complexity of the unit stop number problem and its implications to other related problems (Q2136280) (← links)
- Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
- Event-based MILP models for ridepooling applications (Q2140290) (← links)
- A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
- Complexity and approximation results on the shared transportation problem (Q2149862) (← links)
- The prisoner transportation problem (Q2178139) (← links)
- Mathematical models to improve the current practice in a home healthcare unit (Q2178910) (← links)