Pages that link to "Item:Q5295484"

The following pages link to Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484):

Displaying 22 items.

• 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 study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← links)
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
• A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
• The dial-a-ride problem with private fleet and common carrier (Q2676338) (← 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)
• Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems (Q3168926) (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem (Q3627705) (← links)
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
• Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
• Scheduling issues in vehicle routing (Q5963106) (← links)
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
• Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem (Q6106496) (← links)
• Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
• Planification des tournées dans le domaine de la messagerie rapide (Q6160412) (← links)
• Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands (Q6164316) (← links)
• A deterministic annealing local search for the electric autonomous dial-a-ride problem (Q6167858) (← links)
• Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)
• Branch and price algorithm for route optimization on customized bus service (Q6546992) (← links)