Pages that link to "Item:Q443822"

The following pages link to Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822):

Displaying 24 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)
• Ambulance routing for disaster response with patient groups (Q337463) (← links)
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← 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)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
• Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects (Q2070134) (← links)
• Event-based MILP models for ridepooling applications (Q2140290) (← links)
• The prisoner transportation problem (Q2178139) (← links)
• A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
• The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
• A survey on matheuristics for routing problems (Q2513752) (← 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)
• A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (Q4921475) (← links)
• The pickup and delivery problem with time windows and scheduled lines (Q5879649) (← links)
• Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)
• Efficient GRASP solution approach for the prisoner transportation problem (Q6164367) (← links)
• Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers (Q6551071) (← links)
• The rich heterogeneous dial-a-ride problem with trip time prediction (Q6659104) (← links)