Pages that link to "Item:Q1044088"

The following pages link to The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088):

Displaying 41 items.

• A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
• Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures (Q336468) (← links)
• The dial-A-ride problem with transfers (Q336745) (← links)
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360) (← links)
• A post-improvement procedure for the mixed load school bus routing problem (Q439357) (← links)
• A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources (Q716354) (← links)
• The school bus routing problem: a review (Q1039772) (← links)
• Vehicle routing with cross-dock selection (Q1652043) (← links)
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking (Q1652321) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← 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)
• 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)
• Modeling and solving the multimodal car- and ride-sharing problem (Q2030528) (← links)
• The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation (Q2083950) (← links)
• Event-based MILP models for ridepooling applications (Q2140290) (← links)
• Optimization for dynamic ride-sharing: a review (Q2253345) (← links)
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
• A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (Q2315637) (← links)
• Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers (Q2450604) (← links)
• Synchronized routing of active and passive means of transport (Q2454366) (← 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)
• Selective routing problem with synchronization (Q2669549) (← links)
• Interrelated trips in the rural dial-a-ride problem with autonomous vehicles (Q2673572) (← 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)
• Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← links)
• Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem (Q2907956) (← links)
• The school bus routing and scheduling problem with transfers (Q4642460) (← links)
• The pickup and delivery problem with time windows and scheduled lines (Q5879649) (← links)
• Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels (Q6053530) (← links)
• Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers (Q6065897) (← links)
• Optimal routing of multimodal mobility systems with ride‐sharing (Q6070497) (← links)
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
• Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers (Q6092660) (← links)
• Public transport for smart cities: recent innovations and future challenges (Q6106754) (← links)