Orbel edition:30 location:(UCL) Louvain-La-Neuve date:28-29 January 2016
Transportation companies often combine cargo delivery to multiplecustomers. This enables transporters to reduce the number of vehiclesand to transport full truck loads as much as possible. Transporters needto deliver the goods to the right place within a certain time window, ina cost-effective way and without potential damage to the vehicle, to thecargo itself or to other road users. Combining the cargo for differentcustomers in one vehicle is an important measure to help them meet allthese requirements.
However, problems combining cargo for multiple customers are subjectto multi-drop constraints, which prevent additional cargo handlingat drop-off points. Such constraints minimize the potential for loadingscheme optimization, due to the fact that they require taking into accountthe unloading sequence.
While the vehicle routing problem is one of the most academically studiedcombinatorial optimization problems, the problem of dynamic cargostability has never been addressed via a decision support-based approach.Loading scheme safety is traditionally appraised by rules of thumb, bothby the carrier and authorities.
We propose a decomposition-based approach for solving the combinedproblem, minimizing both route cost and loading scheme cost. Only solutionsrespecting cargo security constraints are considered. Loading schemecosts are determined by additional securing methods required for safety.Datasets have been generated along with benchmark results obtained bythe algorithm.