Pages that link to "Item:Q336745"

The following pages link to The dial-A-ride problem with transfers (Q336745):

Displaying 29 items.

• A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization (Q323288) (← links)
• Dynamic design of sales territories (Q337456) (← links)
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360) (← links)
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
• Trends in transportation and logistics (Q1681388) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• A comparison of two meta-heuristics for the pickup and delivery problem with transshipment (Q1782171) (← links)
• Solving routing problems with pairwise synchronization constraints (Q1787918) (← 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)
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm (Q2029308) (← links)
• Modeling and solving the multimodal car- and ride-sharing problem (Q2030528) (← links)
• Scheduling truck drivers with interdependent routes under European Union regulations (Q2076913) (← links)
• A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows (Q2083929) (← links)
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
• Vehicle routing with transportable resources: using carpooling and walking for on-site services (Q2315653) (← links)
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem (Q2632513) (← links)
• Synchronizing transportation of people with reduced mobility through airport terminals (Q2664455) (← links)
• Interrelated trips in the rural dial-a-ride problem with autonomous vehicles (Q2673572) (← links)
• The vessel swap-body routing problem (Q2673585) (← links)
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
• The pickup and delivery problem with time windows and scheduled lines (Q5879649) (← links)
• The rendezvous vehicle routing problem (Q6057627) (← links)
• Parcel delivery cost minimization with time window constraints using trucks and drones (Q6065834) (← links)
• Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location (Q6068533) (← links)
• The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment (Q6071075) (← links)
• Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers (Q6092660) (← links)