Pages that link to "Item:Q3098764"
From MaRDI portal
The following pages link to An Exact Algorithm for the Pickup and Delivery Problem with Time Windows (Q3098764):
Displaying 45 items.
- A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints (Q323423) (← links)
- An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360) (← 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)
- Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← links)
- Coordinating technician allocation and maintenance routing for offshore wind farms (Q1651656) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
- Pickup and delivery problem with time windows: a new compact two-index formulation (Q1728253) (← links)
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (Q1730662) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
- Optimisation of maintenance routing and scheduling for offshore wind farms (Q1752172) (← links)
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
- Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
- A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
- A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
- An on-demand same-day delivery service using direct peer-to-peer transshipment strategies (Q2005834) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics (Q2027044) (← links)
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (Q2029263) (← links)
- On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
- Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
- The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
- Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
- A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network (Q2196017) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design (Q2514794) (← links)
- An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem (Q2664364) (← links)
- A study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← links)
- Verification of Correctness of Parallel Algorithms in Practice (Q4609778) (← links)
- Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity (Q5086014) (← links)
- The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
- A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
- Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed (Q6048503) (← links)
- Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels (Q6053530) (← links)
- Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows (Q6065830) (← links)
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
- Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands (Q6164316) (← links)
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)