The pickup and delivery problem with time windows, multiple stacks, and handling operations
From MaRDI portal
Publication:2140213
DOI10.1016/j.ejor.2021.11.021zbMath1506.90032MaRDI QIDQ2140213
Marilène Cherkesly, Timo Gschwind
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.11.021
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B06: Transportation, logistics and supply chain management
Related Items
Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands, A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
Uses Software
Cites Work
- Unnamed Item
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification
- The multiple vehicle pickup and delivery problem with LIFO constraints
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- Comparing backhauling strategies in vehicle routing using ant colony optimization
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- The pickup and delivery problem with time windows
- Stowage planning for container ships to reduce the number of shifts
- Container ship stowage problem complexity and connection to the coloring of circle graphs
- The pickup and delivery problem with time windows and handling operations
- Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
- Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban
- The value of integrating loading and routing
- The pickup and delivery traveling salesman problem with handling costs
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- Optimal routing of multiple-load AGV subject to LIFO loading constraints
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
- The split delivery vehicle routing problem with three-dimensional loading constraints
- The vehicle routing problem with simultaneous pickup and delivery and handling costs
- Constraints in container loading -- a state-of-the-art review
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Improved branch-cut-and-price for capacitated vehicle routing
- On the complexity of container stowage planning problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
- An exact method for the double TSP with multiple stacks
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- Exact solutions to the double travelling salesman problem with multiple stacks
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE
- Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints
- Improved exact method for the double TSP with multiple stacks
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Solutions to Real-World Instances of PSPACE-Complete Stacking
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Shortest Path Problems with Resource Constraints
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
