Vehicle routing problems with loading constraints: state-of-the-art and future directions

DOI10.1007/s00291-014-0386-3zbMath1311.90032OpenAlexW2002053519MaRDI QIDQ2018104

Hanne Pollaris, An Caris, Sabine Limbourg, Kris Braekers, Gerrit K. Janssens

Publication date: 10 April 2015

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/18396

zbMATH Keywords

vehicle routing problemtwo-dimensional packingpickup and deliverythree-dimensional packingloading problemrich VRP

Mathematics Subject Classification ID

logistics and supply chain management&go=Go Transportation, logistics and supply chain management (90B06) problems in operations research&go=Go Traffic problems in operations research (90B20)

Related Items (40)

An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints ⋮ A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints ⋮ Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints ⋮ Network scheduling problem with cross-docking and loading constraints ⋮ An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery ⋮ A weighted-sum method for solving the bi-objective traveling thief problem ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ The pallet-loading vehicle routing problem with stability constraints ⋮ Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Airfreight forwarder's shipment planning: shipment consolidation and containerization ⋮ Minimizing late deliveries in a truck loading problem ⋮ Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints ⋮ Cargo securing under multi-drop and axle weight constraints ⋮ Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban ⋮ Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space ⋮ Оптимизация загрузки упорядоченной совокупности летательных аппаратов ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ A metaheuristic algorithm for a locomotive routing problem arising in the steel industry ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ The air cargo load planning problem -- a consolidated problem definition and literature review on related problems ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Column generation based primal heuristics for routing and loading problems ⋮ Vehicle selection for a multi-compartment vehicle routing problem ⋮ Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system ⋮ Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints ⋮ A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints ⋮ Inventory routing with pickups and deliveries ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions ⋮ Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints ⋮ The vehicle routing problem with simultaneous pickup and delivery and handling costs ⋮ The exact solutions of several types of container loading problems ⋮ The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Integrated distribution and loading planning via a compact metaheuristic algorithm
• The airline container loading problem with pickup and delivery
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
• 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
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• Packing first, routing second -- a heuristic for the vehicle routing and loading problem
• Routing and scheduling in project shipping
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
• Routing problems with loading constraints
• The orienteering problem: a survey
• Optimization of stowage plans for RoRo ships
• Vehicle routing with compartments: applications, modelling and heuristics
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
• An integrated approach to the vehicle routing and container loading problems
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• A heuristic for the multi-period petrol station replenishment problem
• The vehicle routing problem. Latest advances and new challenges.
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• The petrol station replenishment problem with time windows
• A least wasted first heuristic algorithm for the rectangular packing problem
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• The pickup and delivery traveling salesman problem with first-in-first-out loading
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
• An adaptive guidance approach for the heuristic solution of a minimum multiple trip 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
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• Weight distribution considerations in container loading
• Allowing for weight considerations in container loading
• Solving a fuel delivery problem by heuristic and exact approaches.
• Scheduling deliveries in vehicles with multiple compartments
• 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
• Three-dimensional container loading models with cargo stability and load bearing constraints
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
• Optimal routing of multiple-load AGV subject to LIFO loading constraints
• Heuristics for the multi-depot petrol station replenishment problem with time windows
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• A guided local search procedure for the multi-compartment capacitated arc routing problem
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
• 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
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Integrated shipment dispatching and packing problems: a case study
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• An improved typology of cutting and packing problems
• The Vehicle Routing Problem
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
• 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
• A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
• 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
• Improved exact method for the double TSP with multiple stacks
• A combined ship scheduling and allocation problem
• A Genetic Algorithm for Solving the Container Loading Problem
• Orthogonal Packings in Two Dimensions
• Balanced Loading
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• The Three-Dimensional Bin Packing Problem
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
• Metaheuristics for the vehicle routing problem with loading constraints
• 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
• An exact algorithm for the petrol station replenishment problem
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

This page was built for publication: Vehicle routing problems with loading constraints: state-of-the-art and future directions