Pages that link to "Item:Q3748044"

The following pages link to Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling (Q3748044):

Displayed 35 items.

• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868) ‎ (← 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 insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services (Q880577) ‎ (← links)
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) ‎ (← links)
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) ‎ (← links)
• The pickup and delivery problem with time windows (Q1179004) ‎ (← links)
• The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) ‎ (← links)
• Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) ‎ (← links)
• Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) ‎ (← links)
• Exact solutions for the collaborative pickup and delivery problem (Q1787916) ‎ (← links)
• Multi-depot vehicle scheduling problems with time windows and waiting costs (Q1806860) ‎ (← links)
• An iterative improvement approach for the nonpreemptive open shop scheduling problem (Q1806862) ‎ (← links)
• Efficient feasibility testing for dial-a-ride problems (Q1866982) ‎ (← links)
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives (Q1908288) ‎ (← links)
• Routing problems: A bibliography (Q1908308) ‎ (← links)
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) ‎ (← links)
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) ‎ (← links)
• A dial-a-ride problem for client transportation in a health-care organization (Q2433383) ‎ (← links)
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem (Q2433528) ‎ (← links)
• Vehicle routing problems with simultaneous pick-up and delivery service. (Q2467847) ‎ (← links)
• The dial-a-ride problem: Models and algorithms (Q2480256) ‎ (← links)
• Resource extension functions: properties, inversion, and generalization to segments (Q2480803) ‎ (← links)
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927) ‎ (← links)
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) ‎ (← 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)
• Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows (Q2806989) ‎ (← links)
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows (Q3770308) ‎ (← links)
• Pickup and Delivery of Partial Loads with “Soft” Time Windows (Q3771948) ‎ (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) ‎ (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) ‎ (← links)
• Ship scheduling with soft time windows: An optimisation based approach (Q5935388) ‎ (← links)
• Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) ‎ (← links)
• Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) ‎ (← links)