Tabu Search
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing
The Three-Dimensional Bin Packing Problem
Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
A Tabu Search Algorithm for a Routing and Container Loading Problem
Transportation Science
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
Networks - Special Issue In Memory of Stefano Pallottino
Ant colony optimization for the two-dimensional loading vehicle routing problem
Computers and Operations Research
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints
Transportation Science
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
INFORMS Journal on Computing
Fifty Years of Vehicle Routing
Transportation Science
IEEE Transactions on Intelligent Transportation Systems
Computers and Operations Research
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Local search techniques for a routing-packing problem
Computers and Industrial Engineering
Hi-index | 0.00 |
This article introduces and solves a new transportation problem called the pallet-packing vehicle routing problem (PPVRP). PPVRP belongs to the category of practical routing models integrated with loading constraints, and assumes that customers raise a deterministic demand in the form of three-dimensional rectangular boxes. It is aimed at determining the optimal vehicle routes for satisfying customer demand. Regarding the packing aspects, transported boxes are not directly loaded into the vehicle-loading spaces; instead, they are feasibly stacked into pallets that are then loaded onto the vehicles before initiating their tours. Belonging to the class of combined routing and packing models, PPVRP is very hard to be optimally solved within manageable computational time; thus, we focused on heuristic approaches for both the routing and packing aspects of the problem. More specifically, PPVRP is solved via a local search metaheuristic strategy based on the regional aspiration criteria of tabu search. To determine feasible pallet-packing arrangements, we employ an efficient packing heuristic approach. The algorithm is accelerated by storing collected packing feasibility information into memory components. The proposed solution approach is tested on newly introduced benchmark instances derived from well-studied vehicle routing data sets, as well as real-world problems.