Pages that link to "Item:Q4367065"

The following pages link to Heuristic Algorithms for the Handicapped Persons Transportation Problem (Q4367065):

Displaying 36 items.

• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← 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)
• Metaheuristics in combinatorial optimization (Q817206) (← links)
• An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services (Q880577) (← links)
• A two-stage model for a day-ahead paratransit planning problem (Q1014313) (← links)
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← 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)
• Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
• The prisoner transportation problem (Q2178139) (← links)
• A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network (Q2196017) (← links)
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
• Dynamic transportation of patients in hospitals (Q2267375) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows (Q2433432) (← 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)
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← 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)
• Variable neighborhood search for the dial-a-ride problem (Q2655965) (← links)
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
• Competition and Cooperation in Pickup and Multiple Delivery Problems (Q2980177) (← 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)
• A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (Q4921475) (← links)
• The time‐consistent dial‐a‐ride problem (Q6065902) (← links)
• Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)
• Efficient GRASP solution approach for the prisoner transportation problem (Q6164367) (← links)
• Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)