Pages that link to "Item:Q2480256"

The following pages link to The dial-a-ride problem: Models and algorithms (Q2480256):

Displaying 50 items.

• The prisoner transportation problem (Q2178139) (← links)
• Mathematical models to improve the current practice in a home healthcare unit (Q2178910) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
• A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network (Q2196017) (← links)
• An inverse optimization approach for a capacitated vehicle routing problem (Q2242401) (← links)
• Optimization for dynamic ride-sharing: a review (Q2253345) (← links)
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
• Dynamic transportation of patients in hospitals (Q2267375) (← links)
• A tabu search heuristic for the dynamic transportation of patients between care units (Q2275836) (← links)
• Pricing and allocation algorithm designs in dynamic ridesharing system (Q2283011) (← links)
• An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
• An exact solution method for the capacitated item-sharing and crowdshipping problem (Q2312351) (← links)
• Recovery management for a dial-a-ride system with real-time disruptions (Q2327632) (← links)
• Optimal charging and repositioning of electric vehicles in a free-floating carsharing system (Q2333127) (← links)
• Pickup and delivery problem with incompatibility constraints (Q2333153) (← links)
• The paired many-to-many pickup and delivery problem: an application (Q2343076) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem (Q2632513) (← links)
• Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
• Variable neighborhood search for the dial-a-ride problem (Q2655965) (← links)
• Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms (Q2664292) (← links)
• Synchronizing transportation of people with reduced mobility through airport terminals (Q2664455) (← links)
• A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
• A data-driven matching algorithm for ride pooling problem (Q2669782) (← links)
• Pickup and delivery problems with autonomous vehicles on rings (Q2670581) (← links)
• A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction (Q2672126) (← links)
• Interrelated trips in the rural dial-a-ride problem with autonomous vehicles (Q2673572) (← links)
• The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach (Q2676335) (← links)
• The real-time on-demand bus routing problem: the cost of dynamic requests (Q2676345) (← links)
• Modeling and optimizing dynamic dial-a-ride problems (Q2767691) (← links)
• A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem (Q2815449) (← links)
• Algorithmic Analysis for Ridesharing of Personal Vehicles (Q2958336) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem (Q3392004) (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (Q4921475) (← links)
• (Q4944966) (← links)
• Simulated annealing heuristic for the general share-a-ride problem (Q5058863) (← links)
• Fleet management for autonomous vehicles: Online PDP under special constraints (Q5242278) (← links)
• A simulation study of an on‐demand transportation system (Q5374512) (← links)
• Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints (Q5449876) (← links)
• The pickup and delivery problem with time windows and scheduled lines (Q5879649) (← links)
• Fleet management for autonomous vehicles using flows in time-expanded networks (Q5918172) (← links)
• Euler is standing in line dial-a-ride problems with precedence-constraints (Q5948963) (← links)
• Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
• Distribution of waiting time for dynamic pickup and delivery problems (Q5963102) (← links)
• Scheduling issues in vehicle routing (Q5963106) (← links)
• Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels (Q6053530) (← links)
• Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system (Q6069239) (← links)