Ara
Toplam kayıt 4, listelenen: 1-4
An Improved Vantage Point Bees Algorithm to Solve Combinatorial Optimization Problems from TSPLIB
(Wiley, 2021)
This paper presents an improved version of the Vantage Point Bees Algorithm
(VPBA-II), which is implemented to solve the Travelling Salesman Problem.
The Vantage Point Tree has been used to produce initial tour solutions ...
Combinatorial Bees Algorithm for Vehicle Routing Problem
(Wiley, 2021)
Vehicle routing problem (VRP) is a combinatorial optimization problem that
has been studied intensively for years. Although VRP can be solved using an
exact method for small instances, a more complex one will be impractical ...
Minimum Penalty Perturbation Heuristics for Curriculum-Based Timetables Subject to Multiple Disruptions
(Elsevier, 2021)
Course timetables are often rendered infeasible due to unexpected changes in requirements and must be
repaired. Given an initial timetable, planners prefer a repaired timetable whose quality is worsened as little as
possible ...
Iris Segmentation in Uncooperative and Unconstrained Environments: State-of-the-art, Datasets and Future Research Directions
(Elsevier, 2021)
Most of the classical iris recognition systems require cooperation from users and assume ideal conditions during iris image acquisition. In uncooperative and unconstrained environments, the performance of these classical ...