|
|
|
|
|
José Victor Sá Santos and Napoleão Nepomuceno
The Cutting Stock Problem (CSP) is an optimisation problem that roughly consists of cutting large objects in order to produce small items. The computational effort for solving this problem is largely affected by the number of cutting patterns. In this ar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Napoleão Nepomuceno, Ricardo Barboza Saboia and Plácido Rogério Pinheiro
In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle. In this work, we propose a fast randomized algorithm using a nearest neigh...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rommel Dias Saraiva, Napoleão Nepomuceno and Plácido Rogério Pinheiro
We propose in this paper a two-phase approach that decomposes the process of solving the three-dimensional single Container Loading Problem (CLP) into subsequent tasks: (i) the generation of blocks of boxes and (ii) the loading of blocks into the contain...
ver más
|
|
|
|
|
|