The Pallet-Packing Vehicle Routing Problem

Emmanouil E. Zachariadis (), Christos D. Tarantilis () and Chris T. Kiranoudis ()
Additional contact information
Emmanouil E. Zachariadis: Department of Process Analysis and Plant Design, School of Chemical Engineering, National Technical University of Athens, 157 80 Athens, Greece
Christos D. Tarantilis: Operations Research and Decision Systems Center, Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, 104 34, Athens, Greece
Chris T. Kiranoudis: Department of Process Analysis and Plant Design, School of Chemical Engineering, National Technical University of Athens, 157 80 Athens, Greece

Transportation Science, 2012, vol. 46, issue 3, 341-358

Abstract: 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.

Keywords: vehicle routing; three-dimensional bin packing; heuristic computing; tabu search (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1110.0373 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:46:y:2012:i:3:p:341-358

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().