Pages that link to "Item:Q1908288"

The following pages link to A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives (Q1908288):

Displaying 40 items.

• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• Measures of dynamism and urgency in logistics (Q323225) (← links)
• Heuristics for dynamic and stochastic routing in industrial shipping (Q339576) (← links)
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
• An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
• An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services (Q880577) (← links)
• A neural-tabu search heuristic for the real time vehicle routing problem (Q928694) (← links)
• A two-stage model for a day-ahead paratransit planning problem (Q1014313) (← links)
• Dynamic pickup and delivery problems (Q1038370) (← links)
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
• Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. (Q1406947) (← links)
• Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
• Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
• Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects (Q2070134) (← links)
• A dynamic tree algorithm for peer-to-peer ridesharing matching (Q2129373) (← links)
• Dynamic transportation of patients in hospitals (Q2267375) (← links)
• An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones (Q2273650) (← links)
• A tabu search heuristic for the dynamic transportation of patients between care units (Q2275836) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
• A multi-start local search heuristic for ship scheduling -- a computational study (Q2433394) (← links)
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows (Q2433432) (← links)
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem (Q2433528) (← links)
• Routing by ranking: a link analysis method for the constrained dial-a-ride problem (Q2450754) (← links)
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments (Q2455616) (← links)
• The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
• Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering (Q2483486) (← links)
• An effective and fast heuristic for the dial-a-ride problem (Q2644373) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
• Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations (Q2669602) (← links)
• A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem (Q2815449) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints (Q5449876) (← links)
• Management Policies in a Dynamic Multi Period Routing Problem (Q5850922) (← links)
• Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems (Q6065891) (← links)
• Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)
• Earliest deadline first is a 2-approximation for DARP with time windows (Q6606221) (← links)