Pages that link to "Item:Q339608"

The following pages link to Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608):

Displaying 27 items.

• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem (Q296680) (← links)
• Hybrid large neighborhood search for the bus rapid transit route design problem (Q296775) (← links)
• Tabu search for the real-world carpooling problem (Q306096) (← links)
• The dial-A-ride problem with transfers (Q336745) (← links)
• Integrated timetabling and vehicle scheduling with balanced departure times (Q747749) (← links)
• Online spatio-temporal matching in stochastic and dynamic domains (Q1648078) (← links)
• Solving the bus evacuation problem and its variants (Q1651627) (← 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)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking (Q1652321) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds (Q1751896) (← links)
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm (Q2029308) (← links)
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
• On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
• Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
• Optimal charging and repositioning of electric vehicles in a free-floating carsharing system (Q2333127) (← links)
• The paired many-to-many pickup and delivery problem: an application (Q2343076) (← links)
• A survey on matheuristics for routing problems (Q2513752) (← 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)
• Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
• An integer programming column generation principle for heuristic search methods (Q6066729) (← links)
• The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment (Q6071075) (← links)
• Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP) (Q6551139) (← links)
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem (Q6659085) (← links)