Browsing by Subject "metaheuristic"

Now showing 1 - 2 of 2

Access status: Open Access ,
Hybrid Variable Neighborhood Search for solving school bus-driver problem with resource constraints
(Wydawnictwa AGH, 2023) Ban, Ha-Bang; Nguyen, Hong-Phuong; Pham, Dang-Hai
The school bus-priver problem with resource constraints (SBDP-RC) is an optimization problem with many practical applications. In the problem, several vehicles are prepared to pick a number of pupils in which the total resources of all vehicles are lower than a predefined value. The aim is to find a schedule that minimizes the sum of the pupils’ waiting times. The problem is NP-hard in the general case. In this paper, to solve the problem. After this, the post phase improves the solution by a general variable neighborhood search (GVNS) with a random neighborhood search combined with shaking technique. The proposed metaheuristic hybridization algorithm is tested on a benchmark to show its efficiency. The results show that the algorithm receives good feasible solutions fast. In many cases, better solutions can be found compared to previous metaheuristic algorithms.
Access status: Open Access ,
The ant colony optimization algorithm applied in transport logistics
(Wydawnictwa AGH, 2024) Ostrowski, Krzysztof; Starzec, Mateusz; Starzec, Grażyna
The Vehicle Routing Problem belongs to graph optimization and its goal is to find shortest routes visiting a given set of customers with additional constraints present. The article presents the ant colony optimization metaheuristic which solves vehicle routing problems and its real-life application in transport logistics (finding routes for delivery companies). The metaheuristic generated highquality solutions (superior to compared methods). Our tool is flexible and enables us to solve various variants of routing problems so it is well suited to specific needs of transportation companies.