|
|
|
|
|
Pavel V. Matrenin
Planning tasks are important in construction, manufacturing, logistics, and education. At the same time, scheduling problems belong to the class of NP-hard optimization problems. Ant colony algorithm optimization is one of the most common swarm intellige...
ver más
|
|
|
|
|
|
|
|
|
Nikola Ivkovic, Robert Kudelic and Marin Golub
Ant colony optimization (ACO) is a well-known class of swarm intelligence algorithms suitable for solving many NP-hard problems. An important component of such algorithms is a record of pheromone trails that reflect colonies? experiences with previously ...
ver más
|
|
|
|
|
|
|
|
|
Seungkyu Ryu and Minki Kim
In comparison to conventional human-driven vehicles (HVs), connected and automated vehicles (CAVs) provide benefits (e.g., reducing travel time and improving safety). However, before the period of fully CAVs appears, there will be a situation in which bo...
ver más
|
|
|
|
|
|
|
|
|
Alicia Cordero, Miguel A. Leonardo Sepúlveda and Juan R. Torregrosa
In this manuscript, we propose a parametric family of iterative methods of fourth-order convergence, and the stability of the class is studied through the use of tools of complex dynamics. We obtain the fixed and critical points of the rational operator ...
ver más
|
|
|
|
|
|
|
|
|
Andrei V. Panteleev and Anna A. Kolessa
A new hybrid metaheuristic method for optimizing the objective function on a parallelepiped set of admissible solutions is proposed. It mimics the behavior of a school of river perch when looking for food. The algorithm uses the ideas of several methods:...
ver más
|
|
|
|