A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
From MaRDI portal
Publication:323423
DOI10.1016/j.ejor.2016.04.016zbMath1346.90150OpenAlexW2336722912MaRDI QIDQ323423
Andreas Bortfeldt, Dirk Männel
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.04.016
Related Items (13)
The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Network scheduling problem with cross-docking and loading constraints ⋮ Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls ⋮ An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints ⋮ Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game ⋮ Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services ⋮ Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints ⋮ The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale ⋮ TLHSA and SACA: two heuristic algorithms for two variant VRP models
Uses Software
Cites Work
- Unnamed Item
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- Packing first, routing second -- a heuristic for the vehicle routing and loading problem
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- An integrated approach to the vehicle routing and container loading problems
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A grouping genetic algorithm for the pickup and delivery problem with time windows
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- A multi-start local search heuristic for ship scheduling -- a computational study
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- Indirect search for the vehicle routing problem with pickup and delivery and time windows
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Vehicle Routing
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Handbook of metaheuristics
This page was built for publication: A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
