Ara
Toplam kayıt 116, listelenen: 41-50
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 ...
Online Model Identification and Updating in Multi-Platform Pseudo-Dynamic Simulation of Steel Structures - Experimental Applications
(Taylor & Francis, 2021)
A new technique is proposed for online model identification and updating in
multi-platform pseudo-dynamic simulation of steel structures which brings
novelty through eliminating the need for optimization during the ...
Integer Programming Versus Constraint Programming: a Course Timetabling Case Study
(University of Cincinnati Industrial Engineering, 2019)
In this study, two solution approaches are compared for a real-world, moderate-size but a highly constrained university
course timetabling problem. The first approach is developing an integer programming model and solving ...
Comparison of Corrosion Performance of Zn and Zn/Al 85/15 Coatings Produced by TWEA
(Trans Tech Publications, 2011)
Zn and Zn/Al 85/15 coatings are produced at optimum conditions by twin wire electric
arc (TWEA) spraying technique and are used in various industrial applications to improve corrosion
protection. As an alternative for ...
On a Generalization of Semisimple Modules
(Springer, 2018)
Let R be a ring with identity. A module MR is called an r-semisimple
module if for any right ideal I of R, MI is a direct summand of MR which is a
generalization of semisimple and second modules.We investigate when an ...
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 ...
Robust University Course Timetabling Problem Subject to Single and Multiple Disruptions
(Elsevier, 2020)
University course timetables are often finalized in stages, in between which, changes in the data make the earlier version infeasible. As each version is announced to the community, it is desirable to have a robust initial ...
A Bi-criteria Hybrid Genetic Algorithm with Robustness Objective for the Course Timetabling Problem
(Elsevier, 2018)
Traditional methods of generating timetables may yield high-quality solutions, but they may not yield robust solutions that may easily be adapted to changing inputs. Incorporating late changes by making minimum modifications ...
Thermo‑Mechanical Simulations of Selective Laser Melting for AlSi10Mg Alloy to Predict the Part‑scale Deformations
(Springer, 2019)
Abstract
Selective laser melting (SLM) is one of the most frequently employed metal additive manufacturing methods. Various
industries such as aerospace, automotive, biomedical, and tooling utilize SLM parts. Although ...