Browsing Industrial Engineering by Title
Now showing items 4-9 of 9
-
International roaming traffic optimization with call quality
(SciTePress, 2019)In this study we focus on a Steering International Roaming Traffic (SIRT) problem with single service that concerns a telecommunication’s operators’ agreements with other operators in order to enable subscribers access ... -
A multi-depot vehicle routing problem with time windows for daily planned maintenance and repair service planning
(Pamukkale Üniversitesi, 2023)A compressor manufacturer producing in Kocaeli/Dilovasi region makes vehicle routing and employee planning daily to fulfill the maintenance and repair requests of the Marmara region and its surroundings the next day. The ... -
Neural network estimators for optimal tour lengths of traveling salesperson problem instances with arbitrary node distributions
(Informs, 2024)It is essential to solve complex routing problems to achieve operational efficiency in logistics. However, because of their complexity, these problems are often tackled sequentially using cluster-first, route-second ... -
Post-disaster damage assessment using drones in a remote communication setting
(Springer, 2023)After a disaster event, obtaining fast and accurate information about the damaged built-in structure is crucial for planning life-saving response operations. Unmanned aerial vehicles (UAVs), known otherwise as drones, are ... -
A predictive multistage postdisaster damage assessment framework for drone routing
(Wiley, 2024-01)This study focuses on postdisaster damage assessment operations supported by a set of drones. We propose a multistage framework, consisting of two phases applied iteratively to rapidly gather damage information within an ... -
Turkish cashier problem with time windows and its solution by Migrating bird optimization algorithm
(IEEE, 2023)A new application of the traveling salesman problem referred to as the Turkish cashier problem (TCP) was recently introduced in literature. The problem revolved around a cashier that must visit several locations and return ...
Share this page