The 3L-CVRP is considered as an NP-hard problem. It consists of placing di erent rectangular objects in a minimum number of vehicles in order to serve a number of clients, minimizing the number of vehicles and maximizing the number of placed objects. This loading takes into account the constraint of fragility. In fact, a fragile object cannot be placed under another fragile object. Moreover, the loading of object is done in a parallel way to the borders of the vehicle. When loading an object, there has to be a minimum surface under the object to serve as.
{ LIVRES GRATUIT } Approche multi-agent pour résoudre le problème de 3l-cvrp PDF TГЁlГЁcharger par Fadoua Chakchouk
Approche multi-agent pour résoudre le problème de 3l-cvrp TГ©lГ©charger PDF e EPUB - Fadoua Chakchouk EpuBook
Ebooks Gratuit > Approche multi-agent pour résoudre le problème de 3l-cvrp > TГ©lГ©charger
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.