Results 71 to 80 of about 28,986 (210)
Радіоелектронні і комп'ютерні системи, 2019 Motivation. One of the tasks of nuclear power plants and other potentially dangerous objects monitoring employing unmanned aerial vehicles (UAV) is flying over specified points of the territory of such objects.
Герман Вікторович Фесенко +1 more
doaj +1 more source
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems
The Scientific World Journal, 2014 Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found.
E. Osaba +4 more
doaj +1 more source
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
International Transactions in Operational Research, EarlyView.Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos +3 more
wiley +1 more source
Optimal multi-objective discrete decision making using a multidirectional modified Physarum solver [PDF]
, 2012 This paper will address a bio-inspired algorithm able to incrementally grow decision graphs in multiple directions for discrete multi-objective optimization. The algorithm takes inspiration from the slime mould Physarum Polycephalum, an amoeboid organism
Masi, Luca, Vasile, Massimiliano
core
Optimization Algorithms Based on Renormalization Group
, 1999 Global changes of states are of crucial importance in optimization algorithms. We review some heuristic algorithms in which global updates are realized by a sort of real-space renormalization group transformation.
Kawashima, Naoki
core +1 more source
Journal of Management Studies, EarlyView.Abstract We analyse the behaviour of multinational enterprises (MNEs) within a host nation – Australia – during deglobalization (1914–79). Deglobalization is often portrayed as a drastic event to which MNEs respond swiftly, probably through withdrawal from host countries.
Pierre Van der Eng +4 more
wiley +1 more source
IEEE Access, 2020 The optimization of logistics distribution can be defined as the multiple traveling salesman problem (MTSP). The purpose of existing heuristic algorithms, such as Genetic Algorithm (GA), Ant Colony Algorithm (ACO), etc., is to find the optimal path in a ...
Min Wang +4 more
doaj +1 more source
k-RNN: Extending NN-heuristics for the TSP
, 2018 In this paper we present an extension of existing Nearest-Neighbor heuristics to an algorithm called k-Repetitive-Nearest-Neighbor. The idea is to start with a tour of k nodes and then perform a Nearest-Neighbor search from there on. After doing this for
Chauhan, Alok +3 more
core +1 more source
A Colored Traveling Salesman Problem with Varying City Colors
Discrete Dynamics in Nature and Society, 2021 A colored traveling salesman problem (CTSP) is a path optimization problem in which colors are used to characterize diverse matching relationship between cities and salesmen.
Xianghu Meng, Jun Li, MengChu Zhou
doaj +1 more source