| Full text | |
| Author(s): |
Ranck Junior, Rodolfo
[1]
;
Yanasse, Horacio Hideki
[2]
;
Morabito, Reinaldo
[3]
;
Junqueira, Leonardo
[4]
Total Authors: 4
|
| Affiliation: | [1] Inst Nacl Pesquisas Espaciais, Programa Posgrad Comp Aplicada, Ave Astronautas 1758, BR-12227010 Sao Jose Dos Campos, SP - Brazil
[2] Univ Fed Sao Paulo, Inst Ciencia & Tecnol, Ave Cesare Mansueto Giulio Lattes 1201, BR-12247014 Sao Jose Dos Campos, SP - Brazil
[3] Univ Fed Sao Carlos, Dept Engn Prod, Rodovia Washington Luis, Km 235, SP-310, BR-13565905 Sao Carlos, SP - Brazil
[4] Univ Sao Paulo, Escola Politecn, Dept Engn Prod, Ave Prof Luciano Gualberto 1380, BR-05508010 Butanta, SP - Brazil
Total Affiliations: 4
|
| Document type: | Journal article |
| Source: | EXPERT SYSTEMS WITH APPLICATIONS; v. 137, p. 471-492, DEC 15 2019. |
| Web of Science Citations: | 0 |
| Abstract | |
In this paper, we address a real problem of packing boxes into a multi-compartment container, in which the boxes must be delivered to customers in a predefined route. This problem arises, for example, in the distribution of beverages (packed in ``boxes{''}) by trucks whose container has multiple compartments. The objective is to find a feasible packing plan that minimizes the handling of boxes inside the container along the whole truck route. The following practical constraints must be met: orientation of the boxes, cargo stability, load bearing strength of the boxes and load balancing. To the best of our knowledge, this is the first study focusing on a vehicle packing problem with multi-compartment containers in the context of beverage distribution. To solve this problem, we present a hybrid approach which consists of a heuristic method based on the generation of horizontal layers and on the solution of mixed integer linear programming models. Computational tests were performed with this approach and a large variety of instances based on real data from a soft drink company. The results show that the approach is able to find feasible solutions for all instances considered under all constraints, contrary to what was observed in practice with the manual procedures available in the company. In practice, if a feasible solution is not obtained, it is necessary to change the predefined route plan and/or to consider an additional new delivery route and/or to use a solution that violates some of the constraints involved. In this sense, the proposed solution approach has good potential for being embedded into existing expert and intelligent systems for supporting the decision making process. (C) 2019 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 |