A variable neighborhood search for flying sidekick traveling salesman problem

JC de Freitas, PHV Penna - International Transactions in …, 2020 - Wiley Online Library
The efficiency and dynamism of unmanned aerial vehicles, or drones, have presented
substantial application opportunities in several industries in the last years. Notably, logistic …

Structural damage detection and localization using decision tree ensemble and vibration data

G Mariniello, T Pastore, C Menna… - … ‐Aided Civil and …, 2021 - Wiley Online Library
This paper explores the capabilities of decision tree ensembles (DTEs) for detecting and
localizing damage in structural health monitoring (SHM). Unlike research on many other …

A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem

D Ferone, S Hatami… - International …, 2020 - Wiley Online Library
Modern production systems require multiple manufacturing centers—usually distributed
among different locations—where the outcomes of each center need to be assembled to …

Solving the capacitated dispersion problem with variable neighborhood search approaches: From basic to skewed VNS

N Mladenović, R Todosijević, D Urošević… - Computers & Operations …, 2022 - Elsevier
The topic of this paper is the Capacitated Dispersion Problem (CDP). To solve the problem,
variable neighborhood search (VNS) based heuristics are proposed. The proposed …

An iterated greedy algorithm for the obnoxious p-median problem

O Gokalp - Engineering Applications of Artificial Intelligence, 2020 - Elsevier
The obnoxious p-median problem (OpM) is one of the NP-hard combinatorial optimization
problems, in which the goal is to find optimal places to facilities that are undesirable (eg …

Parallel iterative solution-based tabu search for the obnoxious p-median problem

J Chang, L Wang, JK Hao, Y Wang - Computers & Operations Research, 2021 - Elsevier
The obnoxious p-median problem (OpM) is to determine a set of opened facilities such that
the sum of distances between each client and the opened facilities is maximized. OpM is a …

An efficient heuristic for a hub location routing problem

M Ratli, D Urošević, AA El Cadi, J Brimberg… - Optimization …, 2022 - Springer
This paper examines a new model for hub location known as the hub location routing
problem. The problem shares similarities with the well studied uncapacitated single …

Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search algorithm

S Lu, C Ma, X Liu, PM Pardalos - Computers & Operations Research, 2024 - Elsevier
The optimization of the high-end equipment manufacturing process is becoming
progressively more difficult, which brings a big challenge for high-end equipment …

[HTML][HTML] Dispersed starting solutions in facility location: The case of the planar p-median problem

Z Drezner, J Brimberg, A Schöbel - Computers & Operations Research, 2024 - Elsevier
There are many planar multiple facilities location problems for which the optimal locations
tend to be spread out. The most popular of these is the planar p-median problem. With this in …

A variable neighborhood search algorithm for an integrated physician planning and scheduling problem

S Lan, W Fan, S Yang, PM Pardalos - Computers & Operations Research, 2022 - Elsevier
In this paper, we study an integrated physician planning and scheduling problem (IPPSP)
considering multiple types of services, which can be done by multiple qualifications of …