Nov. 22, 2021
-- Neu-Ulm, Germany – DNA released a new module for PND-Problems. JOpt.TourOptimizer comes with a built-in, and well-known pickup-and-delivery optimization module. A predefined number of goods must be either delivered to customers (nodes) or picked up at nodes by a Resource (for example a truck). For a delivery problem, the Resource is taking up the goods at its home location and JOpt finds the most optimal way to serve all nodes with their predefined requests.
To introduce our new module, let's assume we have two pizza restaurants of the same company chain. Both are situated within the same city at a distance of a few kilometers. Each restaurant has one delivery man. For every customer order, the restaurants can decide which restaurant is serving the request. With JOpt it is possible to create multiple fabrication-
like nodes, that can generate goods (in our example, Pizzas). This way, it is no longer necessary to predefine the number of goods, instead, JOpt automatically defines: "Where and how many goods need to be provided". In our example, JOpt defines which Pizza restaurant has to prepare which Pizza to serve all customers in an optimal way.
Further, the restaurant chain advertises: "If you don't get your pizza within 90 minutes, you get if for free!"
. Therefore, each pizza should be delivered within 90 minutes. Our new module is able to take up a predefined delivery time as a parameter, even for goods that are generated by JOpt itself.
Want to find out more? Visit our online documentation platform at https://docs.dna-evolutions.com/