Review: An annotated bibliography of combined routing and loading problems
loadingpickup and deliverythree-dimensional packingtraveling salesmantwo-dimensional packingvehicle routing
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Many activities in freight transportation involve two basic optimization issues: finding the optimal routes to deliver goods, and determine the best way for loading such goods on the vehicles used for transportation. The great majority of problems arising in these two areas belongs to the class of (strongly) NP-hard problems, and is very challenging in practice. Therefore, most of the research was concentrated on solving these problems separately. In recent literature, their combined solution has attracted a number of researchers and practitioners and led to interesting theoretical, as well as practical results. The authors propose a systematic way to review the most relevant results obtained in the area of vehicle routing with loading constraints. Their main aim was to stimulate further research in this promising area.NEWLINENEWLINE At its beginning, the paper contains a brief description of both considered problems: the routing problem and the loading problem. The routing problems are related to finding the best possible routes for the vehicles transporting given items under some predefined constraints (e.g. capacities). Among routing problems, the traveling salesman problem (TSP) and the vehicle routing problem (VRP) are the most important. In the loading problems it is necessary to ensure that the transported items can be feasibly allocated within the vehicle loading space. The loading problems are usually related to the shape and/or orientation of items, and involve 2D and 3D packing. The most famous problems in this class are rectangles packing (bin packing problems, BPP) in 2D, and boxes and spheres packing in 3D. In addition to the need of obtaining a feasible placement of the demanded items in the loading space, a frequent relevant constraint is that the placement allows to perform the unloading operations without reshuffling the items. Combining the representatives of two mentioned optimization goals, various classes of problems are defined, and the recent relevant results are reviewed through the paper.
- Routing problems with loading constraints
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Packing first, routing second -- a heuristic for the vehicle routing and loading problem
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- The value of integrating loading and routing
- Solving a large multicontainer loading problem in the car manufacturing industry
- The value of integrating loading and routing
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- Exact solution techniques for two-dimensional cutting and packing
- The split delivery vehicle routing problem with three-dimensional loading constraints
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- The combined optimal programming of loading and path planning
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- Packing first, routing second -- a heuristic for the vehicle routing and loading problem
- Exact algorithms for the double vehicle routing problem with multiple stacks
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Comments on: Routing Problems with loading constraints
- Exact methods for the split delivery vehicle routing problem with two-dimensional loading constraints
- An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
This page was built for publication: Review: An annotated bibliography of combined routing and loading problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6486685)
