Pages that link to "Item:Q2178121"
From MaRDI portal
The following pages link to Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121):
Displaying 16 items.
- The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms (Q972640) (← links)
- The pickup and delivery problem with time windows (Q1179004) (← links)
- Pickup and delivery problem with time windows: a new compact two-index formulation (Q1728253) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- Exact algorithms for the order picking problem (Q1782167) (← links)
- Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← 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)
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows (Q3098764) (← links)
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484) (← links)
- Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels (Q6053530) (← links)
- Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach (Q6106570) (← 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)
- Model formulations for pickup and delivery problems in designated driver services (Q6551155) (← links)
- Operations optimization for third-party e-grocery platforms (Q6596982) (← links)
- A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery (Q6659827) (← links)
