A5090145481- Vehicle Routing Optimization Methods
- Optimization and Packing Problems
- Scheduling and Optimization Algorithms
- Optimization and Mathematical Programming
- Transportation Planning and Optimization
- Advanced Optimization Algorithms Research
- Advanced Manufacturing and Logistics Optimization
- Optimization and Variational Analysis
- Statistical and Computational Modeling
- Resource-Constrained Project Scheduling
- Simulation Techniques and Applications
- Traffic control and management
- Scheduling and Timetabling Solutions
- Advanced Numerical Analysis Techniques
- VLSI and FPGA Design Techniques
- Aerospace Engineering and Control Systems
- Matrix Theory and Algorithms
- Robotic Mechanisms and Dynamics
- Manufacturing Process and Optimization
- Complexity and Algorithms in Graphs
- Advanced Research in Systems and Signal Processing
- Advanced Data Processing Techniques
N. I. Lobachevsky State University of Nizhny Novgorod
2012-2023
Saratov State University
2006-2014
Yaroslav-the-Wise Novgorod State University
2006-2014
In this work we consider the NP-hard three-index axial assignment problem. We formulate and investigate a problem of combining feasible solutions. Such combination can be applied in wide range heuristic approximate algorithms for solving problem, instead commonly used strategy selecting best solution among found discuss approaches to prove that it becomes already case four
We study the problem of combining two admissible solutions three-index axial assignment with quadratic criterion. A heuristic algorithm for its solution is given. Described a subclass on which finds an optimum. Provided computational experiment.