Pages that link to "Item:Q6043232"

The following pages link to The Pickup And Delivery Problem With Time Windows And Transshipment (Q6043232):

Displaying 38 items.

• A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
• The dial-A-ride problem with transfers (Q336745) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• A decomposition approach for commodity pickup and delivery with time-windows under uncertainty (Q490359) (← links)
• A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources (Q716354) (← links)
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
• Vehicle routing with cross-dock selection (Q1652043) (← links)
• An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• Moving products between location pairs: cross-docking versus direct-shipping (Q1752263) (← links)
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
• A comparison of two meta-heuristics for the pickup and delivery problem with transshipment (Q1782171) (← links)
• The multiple traveling salesman problem with backup coverage (Q1791936) (← links)
• An on-demand same-day delivery service using direct peer-to-peer transshipment strategies (Q2005834) (← links)
• A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments (Q2026973) (← links)
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
• Scheduling truck drivers with interdependent routes under European Union regulations (Q2076913) (← links)
• The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation (Q2083950) (← links)
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
• Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers (Q2450604) (← links)
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• The vessel swap-body routing problem (Q2673585) (← links)
• A dynamic scheduling process and methodology using route deviations and synchronized passenger transfers for flexible feeder transit services (Q2676321) (← links)
• Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare (Q2676325) (← links)
• One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
• Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries (Q3652242) (← links)
• Pickup and Delivery of Partial Loads with “Soft” Time Windows (Q3771948) (← links)
• Computing and Combinatorics (Q4681169) (← links)
• The General Pickup and Delivery Problem (Q4836837) (← links)
• (Q5128116) (← links)
• Distribution of waiting time for dynamic pickup and delivery problems (Q5963102) (← links)
• Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers (Q6092660) (← links)
• Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows (Q6160362) (← links)
• A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network (Q6561217) (← links)
• An algorithm for flexible transshipments with perfect synchronization (Q6586221) (← links)