Pages that link to "Item:Q1698288"

The following pages link to Typology and literature review for dial-a-ride problems (Q1698288):

Displaying 44 items.

• The dial-A-ride problem with transfers (Q336745) (← links)
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms (Q1432014) (← links)
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
• Efficient feasibility testing for dial-a-ride problems (Q1866982) (← links)
• Improved bounds for revenue maximization in time-limited online dial-a-ride (Q1981946) (← links)
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm (Q2029308) (← links)
• Serving rides of equal importance for time-limited dial-a-ride (Q2117614) (← 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)
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
• Recovery management for a dial-a-ride system with real-time disruptions (Q2327632) (← links)
• Pickup and delivery problem with incompatibility constraints (Q2333153) (← links)
• An approximation of the customer waiting time for online restaurants owning delivery system (Q2419760) (← links)
• The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
• Synchronizing transportation of people with reduced mobility through airport terminals (Q2664455) (← links)
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
• Scheduling heterogeneous multi-load AGVs with battery constraints (Q2669605) (← 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)
• A branch-and-price algorithm for a routing problem with inbound and outbound requests (Q2676292) (← links)
• The real-time on-demand bus routing problem: the cost of dynamic requests (Q2676345) (← links)
• Computer-aided complexity classification of dial-a-ride problems (Q2890414) (← links)
• New Bounds for Maximizing Revenue in Online Dial-a-Ride (Q5041189) (← links)
• Approximate ridesharing of personal vehicles problem (Q5918279) (← links)
• An integrated ride-matching and vehicle-rebalancing model for shared mobility on-demand services (Q6047859) (← links)
• Trends in passenger transport optimisation (Q6056883) (← links)
• A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops (Q6064160) (← links)
• Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems (Q6065891) (← links)
• The time‐consistent dial‐a‐ride problem (Q6065902) (← links)
• Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system (Q6069239) (← links)
• The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment (Q6071075) (← links)
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
• Graph representation of the fixed route dial-a-ride problem (Q6090221) (← links)
• Budget-balanced and strategy-proof auctions for ridesharing (Q6109306) (← links)
• A deterministic annealing local search for the electric autonomous dial-a-ride problem (Q6167858) (← links)
• Branch and price algorithm for route optimization on customized bus service (Q6546992) (← links)
• Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP) (Q6551139) (← links)
• Model formulations for pickup and delivery problems in designated driver services (Q6551155) (← links)
• Transition towards sustainable mobility: the role of transport optimization (Q6558658) (← links)
• A ride time-oriented scheduling algorithm for dial-a-ride problems (Q6561235) (← links)
• Earliest deadline first is a 2-approximation for DARP with time windows (Q6606221) (← links)
• Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)