APPLICATION OF A GENETIC ALGORITHM TO SOLVE THE LOCATION-ACTIVATION PROBLEM

Authors

  • Oleksii Serhieiev

DOI:

https://doi.org/10.34185/1991-7848.itmm.2025.01.013

Keywords:

discrete optimization, continuous optimization, genetic algorithm, logistics, transportation

Abstract

The work considers the use of a genetic algorithm to solve the problem of placing and activating logistic network objects. The urgency of the problem in medical logistics, especially in crisis situations, is emphasized. The author formulates a practical statement of the problem and develops a corresponding mathematical model. According to the mathematical formulation, the problem is a combined optimization problem, where there is a continuous optimization problem for the location of the distributional centers (DC) and a discrete optimization problem for the activation of the subregional centers (SRC). To solve the problem, we use a genetic algorithm with priority coding of chromosomes, which uses a weighted crossover. The chromosomes are selected by the roulette method, and the mutation operation is implemented as a mixed adaptive procedure with two possible variants of changes: swap or insertion. The results of the work can be applied to improve logistic processes in the field of medical logistics at the regional level.

References

Gen M., Lin L. Genetic algorithms and their applications. Springer handbook of engineering statistics. 2012. P. 635–674.

URL: https://doi.org/10.1007/978-1-4471-7503-2_33.

Two-stage problems of optimal location and distribution of the humanitarian logistics system’s structural subdivisions / L. S. Koriashkina et al. Naukovyi Visnyk Natsionalnoho Hirnychoho Universytetu. 2024. No. 1. P. 130–139.

URL: https://doi.org/10.33271/nvngu/2024-1/130.

Serhieiev O. S., Us S. A. Doslidzhennia dvokh pidkhodiv do rozviazannia dvoetapnoi zadachi rozmishchennia-aktyvatsii [in Ukrainian]. Naukovyi visnyk Uzhhorodskoho universytetu. Seriia: Matematyka i informatyka. 2024. T. 45, № 2. S. 249–258. URL: https://doi.org/10.24144/2616-7700.2024.45(2).249-258.

Downloads

Published

2025-06-04

Issue

Section

Статті