Fragmented Metaheuristics for Combined Transport Logistics Problems
Abstract
The problems of transport logistics related to finding the optimal route are considered. However, as a rule, such tasks contain several constraints. These may be constraints on the carrying capacity of vehicles, the run length without refueling, the operating time of the vehicle, the time of delivery of cargo to the consumer, the number of vehicles, and some others. Moreover, these constraints can be imposed either individually or in various combinations. Such problems are called combined problems of transport logistics. Most of these problems are NP-hard [1]. Separate methods are proposed for each type of problem. The article proposes a universal approach to modeling such problems using oriented fragmentary structures. This approach makes it possible to apply many wellknown metaheuristic optimization algorithms on a set of permutations to search for suboptimal solutions to the problem.