Results 61 to 70 of about 11,422 (178)

On the Recoverable Traveling Salesman Problem

open access: yesCoRR, 2021
In this paper we consider the Recoverable Traveling Salesman Problem (TSP). Here the task is to find two tours simultaneously, such that the intersection between the tours is at least a given minimum size, while the sum of travel distances with respect to two different distance metrics is minimized.
Marc Goerigk, Stefan Lendl, Lasse Wulf
openaire   +2 more sources

Scalable Computation of Topological Abstractions for Scalar Data

open access: yesComputer 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

Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem

open access: yesRevista Produção Online, 2014
In this paper, we propose new heuristic methods for solver the Clustered Traveling Salesman Problem (CTSP). The CTSP is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and ...
Mário Mestria
doaj   +1 more source

A matheuristic for the traveling salesman problem with positional consistency constraints

open access: yesInternational 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

Evaluation of drone system for thinning operations–a case study in Sweden

open access: yesInternational 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

Optimizing Movement Sequences for Step-and-Scan Lithography Equipment

open access: yesJournal of Advanced Mechanical Design, Systems, and Manufacturing, 2013
The purpose of this work is to improve the throughput of step-and-scan lithography equipment to shorten the production time of a wafer. For this purpose, we propose a method for solving the MSOP (Movement Sequence Optimization Problem), which is the ...
Yuji SHINANO   +3 more
doaj   +1 more source

Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem [PDF]

open access: yesISPRS International Journal of Geo-Information, 2018
The Equality-Generalized Travelling Salesman Problem (E-GTSP), which is an extension of the Travelling Salesman Problem (TSP), is stated as follows: given groups of points within a city, like banks, supermarkets, etc., find a minimum cost Hamiltonian cycle that visits each group exactly once.
Mohammed Zia   +2 more
openaire   +3 more sources

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

open access: yesInternational 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

A comparison of heuristic and human performance on open versions of the traveling salesperson problem. [PDF]

open access: yes, 2006
We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points
MacGregor, James N.   +6 more
core   +1 more source

Keep on Keepin’ on Down Under: Administrative Heritage and the Strategic Realignment of Multinational Enterprises in Australia During Deglobalization, 1914–79

open access: yesJournal 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

Home - About - Disclaimer - Privacy