Pages that link to "Item:Q296680"

The following pages link to Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem (Q296680):

Displaying 27 items.

• Time-dependent routing problems: a review (Q342083) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
• Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← links)
• Comments on: ``Disruption management in vehicle routing and scheduling for road freight transport: a review'' (Q1752348) (← links)
• Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration (Q2028763) (← links)
• A colored traveling salesman problem with varying city colors (Q2065425) (← links)
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review (Q2076861) (← links)
• Opportunities for reinforcement learning in stochastic dynamic vehicle routing (Q2108171) (← links)
• Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
• Event-based MILP models for ridepooling applications (Q2140290) (← links)
• Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing (Q2303337) (← links)
• Solving a dial-a-flight problem using composite variables (Q2307323) (← links)
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem (Q2632513) (← links)
• Vehicle routing and scheduling of flex-route transit under a dynamic operating environment (Q2657443) (← 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)
• Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function (Q5139622) (← links)
• Rough approximation-based approach for designing a personalized tour route under a fuzzy environment (Q6065999) (← links)
• Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system (Q6069239) (← links)
• Dynamic priority rules for combining on-demand passenger transportation and transportation of goods (Q6112779) (← links)
• Dynamic scheduling of patients in emergency departments (Q6113312) (← links)
• Robotized sorting systems: large-scale scheduling under real-time conditions with limited lookahead (Q6113359) (← links)
• Stochastic inventory routing with dynamic demands and intra-day depletion (Q6551100) (← links)
• An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem (Q6551141) (← links)
• Dynamic migratory beekeeping route recommendation based on spatio-temporal distribution of nectar sources (Q6644376) (← links)
• The rich heterogeneous dial-a-ride problem with trip time prediction (Q6659104) (← links)