An effective tabu search approach with improved loading algorithms for the 3L-CVRP

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

“…The methods for solving the packing problem are mostly based on bin packing literature (e.g., Baker et al 1980;Lodi et al 1999;Martello and Vigo 1998). Maximum touching perimeter (or touching area in the three-dimensional case) and bottom-left-fill are often used to solve two-and three-dimensional packing problems heuristically (e.g., Iori et al 2007;Gendreau et al 2006;Tarantilis et al 2009;Tao and Wang 2013;Dominguez et Iori et al (2007) x…”

“…These heuristics are extensions of the bottom-left-fill and maximum touching perimeter methods from 2D bin packing literature. Tao and Wang (2013) employ, in combination with maximum touching area, a least waste algorithm. Junqueira et al (2013) solve the 3L-CVRP with an ILP in which they incorporate the 3D loading feasibility check.…”

“…With respect to loading constraints, only the classical three-dimensional packing constraints are included in their model. Tao and Wang (2013) use a TS method to solve the 3L-CVRP heuristically. To the best of our knowledge, this heuristic is currently one of the best in terms of solution quality and computational efficiency for the 3L-CVRP defined by Gendreau et al (2006).…”

“…Another observation is that problems in which more than one dimension is considered (2L-CVRP, 3LCVRP, pallet packing VRP) are mostly solved by means of a two-stage approach. The routing problem acts as the main problem and iteratively calls exact or heuristic methods to solve the packing subproblem (Tao and Wang 2013). The methods for solving the packing problem are mostly based on bin packing literature (e.g., Baker et al 1980;Lodi et al 1999;Martello and Vigo 1998).…”

Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier

“…Besides the non-overlap of the three-dimensional boxes, the constraints that have been usually considered are the vertical stability of the cargo and the multi-drop situations (also known as LIFO constraints), although other constraints may also appear, such as the load bearing strength of the boxes, time windows and pickups and deliveries. The approaches used to solve the problem have been mainly heuristic (Bortfeldt, 2012;Bortfeldt & Homberger, 2013;Ceschia, Schaerf, & Stützle 2013;Fuellerer, Doerner, Hartl, & Iori, 2010;Gendreau, Iori, Laporte, & Martello, 2006;Lacomme, Toussaint, & Duhamel, 2013;Moura & Oliveira, 2009;Ruan, Zhang, Miao, & Shen, 2013;Tao & Wang, 2013;Tarantilis, Zachariadis, & Kiranoudis, 2009;Zachariadis, Tarantilis, & Kiranoudis, 2012Zhu, Qin, Lim, & Wang, 2012). The integrated problem is usually hierarchically decomposed, where the vehicle routing is solved at the higher level and the container loading at the lower level.…”