Online bin packing with cardinality constraints
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A distributed metaheuristic for solving a real-world scheduling-routing-loading problem
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
An ant colony system algorithm to solve routing problems applied to the delivery of bottled products
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Improving the performance of heuristic algorithms based on causal inference
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
| Hi-index | 0.00 |
The present paper approaches the loading distribution of trucks for Product Transportation as a rich problem. This is formulated with the classic Bin Packing Problem and five variants associated with a real case of study. A state of the art review reveals that related work deals with three variants at the most. Besides, they do not consider its relation with the vehicle routing problem. For the solution of this new rich problem a heuristic-deterministic algorithm was developed. It works together with a metaheuristic algorithm to assign routes and loads. The results of solving a set of real world instances show an average saving of three vehicles regarding their manual solution; this last needed 180 minutes in order to solve an instance and the actual methodology takes two minutes. On average, the demand was satisfied in 97.45%. As future work the use of a non deterministic algorithm is intended.