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

Author(s)

Junqueira, Leonardo ^[1] ; Morabito, Reinaldo ^[2]

Affiliation

^[1] Univ Nove Julho, Programa Posgrad Engn Prod, BR-05001100 Sao Paulo, SP - Brazil

^[2] Univ Fed Sao Carlos, Dept Engn Prod, BR-13565905 Sao Carlos, SP - Brazil

• Document type: Journal article
• Source: COMPUTERS & INDUSTRIAL ENGINEERING; v. 88, p. 110-130, OCT 2015.
• Web of Science Citations: 16

Abstract

In this paper, we present heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem arising in a real-world situation. In this problem, customers make requests of goods, which are packed in a sortment of boxes. The objective is to find minimum cost delivery routes for a set of identical vehicles that, departing from a depot, visit all customers only once and return to the depot. Apart of the usual 3D container loading constraints which ensure that the boxes are packed completely inside the vehicles and that the boxes do not overlap each other in each vehicle, the problem also takes into account constraints related to the vertical stability of the cargo and multi-drop situations. The algorithms are based on the combination of classical heuristics from both vehicle routing and container loading literatures, as well as two metaheuristic strategies, and their use in more elaborate procedures. Although these approaches cannot assure optimal solutions for the respective problems, they are relatively simple, fast enough to solve real instances, flexible enough to include other practical considerations, and normally assure relatively good solutions in acceptable computational times in practice. The approaches are also sufficiently generic to be embedded with algorithms other than those considered in this study, as well as they can be easily adapted to consider other practical constraints, such as the load bearing strength of the boxes, time windows and pickups and deliveries. Computational tests were performed with these methods considering instances based on the vehicle routing literature and actual customers' orders, as well as instances based on a real-world situation of a Brazilian carrier. The results show that the heuristics are able to produce relatively good solutions for real instances with hundreds of customers and thousands of boxes. (C) 2015 Elsevier Ltd. All rights reserved. (AU)

• FAPESP's process: 14/16906-1 - Packing problems, routing problems, and their integrations
• Grantee: Leonardo Junqueira
• Support Opportunities: Regular Research Grants
• FAPESP's process: 09/07423-9 - Contributions to the integrated vehicle routing and container loading problems
• Grantee: Leonardo Junqueira
• Support Opportunities: Scholarships in Brazil - Doctorate