Pages that link to "Item:Q547122"

The following pages link to Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122):

Displaying 29 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)
• Effective truckload dispatch decision methods with incomplete advance load information (Q322842) (← links)
• Ambulance routing for disaster response with patient groups (Q337463) (← links)
• Heuristics for dynamic and stochastic routing in industrial shipping (Q339576) (← links)
• An adaptive large neighborhood search heuristic for the share-a-ride problem (Q342178) (← links)
• Recent trends in metaheuristics for stochastic combinatorial optimization (Q692975) (← 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)
• Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search (Q1695780) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• From theory to practice: maximizing revenues for on-line dial-a-ride (Q1702834) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects (Q2070134) (← links)
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
• Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
• A survey on the applications of variable neighborhood search algorithm in healthcare management (Q2240705) (← links)
• Optimization for dynamic ride-sharing: a review (Q2253345) (← links)
• Recovery management for a dial-a-ride system with real-time disruptions (Q2327632) (← 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 school bus routing and scheduling problem with transfers (Q4642460) (← links)
• Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
• Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions (Q6047851) (← links)
• Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems (Q6065891) (← links)
• Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system (Q6069239) (← links)
• A tutorial on value function approximation for stochastic and dynamic transportation (Q6489316) (← links)