Застосування методу гілок і меж для оптимізації транспортних задач з додатковими обмеженнями

Abstract

The paper describes an algorithm that ensures the determination of an optimal integer transportation plan while accounting for the real operating conditions of a logistics system. A transportation problem with additional constraints on the number of available vehicles and their carrying capacity is considered. A modified branch-and-bound method is applied, adapted to the specific nature of these resource constraints and incorporating them explicitly into the process of problem formulation and solution. The proposed approach is aimed at improving decisionmaking efficiency and optimizing logistics processes in goods distribution