The subject matter of this article is the optimization of delivery problems (Vehicle Routing Problems – VRP) with regard to distribution systems. These issues belong to the class of NP-hard problems. Current solutions to various delivery problems (VRP, TSP, MTSP, VRPTW, RDPTW) were analysed. Two examples were presented. In a transport and production task, a marginal cost equalling (MCE) algorithm was used. In the case of a Multi Depot Vehicle Routing Problem (MDVRP), an evolutionary algorithm was used.
The subject matter of this article is the optimization of delivery problems (Vehicle Routing Problems – VRP) with regard to distribution systems. These issues belong to the class of NP-hard problems. Current solutions to various delivery problems (VRP, TSP, MTSP, VRPTW, RDPTW) were analysed. Two examples were presented. In a transport and production task, a marginal cost equalling (MCE) algorithm was used. In the case of a Multi Depot Vehicle Routing Problem (MDVRP), an evolutionary algorithm was used.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.