Parcel delivery cost minimization with time window constraints using trucks and drones
From MaRDI portal
Publication:6065834
DOI10.1002/net.22019zbMath1528.90025OpenAlexW3128472991MaRDI QIDQ6065834
Olivier Gallay, Marc-Antoine Coindreau, Nicolas Zufferey
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22019
Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06)
Related Items (1)
Cites Work
- Optimization by Simulated Annealing
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- The dial-A-ride problem with transfers
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- The vehicle routing problem with drones: several worst-case results
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- Scheduling last-mile deliveries with truck-based autonomous robots
- Trends in transportation and logistics
- A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
- Vehicle routing with transportable resources: using carpooling and walking for on-site services
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The vehicle routing problem with drones: Extended models and connections
- Drone delivery from trucks: Drone scheduling for given truck routes
- A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
- Shortest-path feasibility algorithms
This page was built for publication: Parcel delivery cost minimization with time window constraints using trucks and drones
