Pages that link to "Item:Q3564363"

The following pages link to Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363):

Displaying 26 items.

• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868) (← links)
• A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
• An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
• An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
• The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
• Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) (← links)
• Moving products between location pairs: cross-docking versus direct-shipping (Q1752263) (← links)
• Pickup and delivery problem with incompatibility constraints (Q2333153) (← links)
• The paired many-to-many pickup and delivery problem: an application (Q2343076) (← links)
• Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
• The vessel swap-body routing problem (Q2673585) (← links)
• A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips (Q2676410) (← links)
• Verification of Correctness of Parallel Algorithms in Practice (Q4609778) (← links)
• Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)
• A scheme for determining vehicle routes based on Arc-based service network design (Q5881488) (← links)
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← 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)