Pages that link to "Item:Q2655965"

The following pages link to Variable neighborhood search for the dial-a-ride problem (Q2655965):

Displaying 33 items.

• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem (Q296680) (← links)
• The dial-A-ride problem with transfers (Q336745) (← links)
• Variable neighborhood search for location routing (Q339539) (← links)
• Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
• An adaptive large neighborhood search heuristic for the share-a-ride problem (Q342178) (← links)
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
• Ambulance location and relocation problems with time-dependent travel times (Q613443) (← links)
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← 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)
• Comparative study of metaheuristics for the curve-fitting problem: modeling neurotransmitter diffusion and synaptic receptor activation (Q1668874) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive (Q1786606) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm (Q2029308) (← 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 tabu search heuristic for the dynamic transportation of patients between care units (Q2275836) (← links)
• The paired many-to-many pickup and delivery problem: an application (Q2343076) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem (Q2632513) (← 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)
• Interrelated trips in the rural dial-a-ride problem with autonomous vehicles (Q2673572) (← links)
• Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare (Q2676325) (← links)
• The dial-a-ride problem with private fleet and common carrier (Q2676338) (← links)
• The school bus routing and scheduling problem with transfers (Q4642460) (← links)
• Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
• Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system (Q6069239) (← links)
• Planification des tournées dans le domaine de la messagerie rapide (Q6160412) (← links)