Results 61 to 70 of about 877 (188)
Scalable Computation of Topological Abstractions for Scalar Data
Computer Graphics Forum, EarlyView.Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source
Can the Agent with Limited Information Solve Travelling Salesman Problem?
Complexity, 2017 Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem). In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites. Under the circumstances, the agent occasionally ignores the NN
Tomoko Sakiyama, Ikuo Arizono
doaj +1 more source
ADAPTIVE SELECTION OF AUXILIARY OBJECTIVES IN MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2016 Subject of Research.We propose to modify the EA+RL method, which increases efficiency of evolutionary algorithms by means of auxiliary objectives.
I. A. Petrova +2 more
doaj +1 more source
The selective travelling salesman problem
Discrete Applied Mathematics, 1990 This paper deals with exact solutions for the Selective Traveling Salesman Problem - a TSP with profit at the nodes - by branch-and bound. The contribution is in the form of a new upper bound calculation as well as two node partitioning rules.
Gilbert Laporte, Silvano Martello
openaire +2 more sources
A matheuristic for the traveling salesman problem with positional consistency constraints
International Transactions in Operational Research, EarlyView.Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +1 more source
Discrete Starfish Optimization Algorithm for Symmetric Travelling Salesman Problem
IEEE AccessThis paper introduces a new discrete StarFish Optimization Algorithm (D-SFOA) to solve a complex discrete Symmetric Travelling Salesman Problem (STSP).
Muhammet Aktas, Fatih Kilic
doaj +1 more source
Three-dimensional Euclidian Distance to Neutrosophic Number for Travelling Salesman Problem [PDF]
Neutrosophic Sets and SystemsThe main idea in this paper is to study the application of the novel greedy Dhouib Matrix-TSP1 (DM-TSP1) method to solve the Travel Salesman Problem with simple neutrosophic numbers. Here, the Euclidian distance is used to convert the neutrosophic number
Souhail Dhouib +5 more
doaj +1 more source
Evaluation of drone system for thinning operations–a case study in Sweden
International Transactions in Operational Research, EarlyView.Abstract Thinning operations in forestry typically involve a two‐machine system (TMS) with a harvester and a forwarder. Its productivity in different forest conditions is well documented. To date, drones have been used for data collection and surveillance but not as an alternative to a TMS.
Mikael Rönnqvist +3 more
wiley +1 more source
The Symmetric Traveling Salesman Problem
CoRR, 2005 Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as a product of 2-cycles. Applying the modified Floyd-Warshall algorithm to (sigma_T)^-1M^-, we construct acceptable and 2-circuit cycles some sets of which may yield circuits ...
openaire +3 more sources
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