Results 61 to 70 of about 2,383 (189)

Parallel DNA Algorithms of Generalized Traveling Salesman Problem-Based Bioinspired Computing Model

International Journal of Computational Intelligence Systems, 2020
Generalized traveling salesman problem (GTSP) is a classical combinatorial optimization problem, in which the optimization goal is the minimum route combination. Since the GTSP is a more complex problem than the traveling salesman problem (TSP), the GTSP
Xiaomin Ren, Xiaoming Wang, Zhaocai Wang, Tunhua Wu   +3 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

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, Patrik Flisberg, Gert Andersson, Petrus Jönsson   +3 more
wiley   +1 more source

The Traveling Salesman Problem for Cubic Graphs

Journal of Graph Algorithms and Applications, 2007
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3) ≈ 1.260n and linear space. Our algorithm can find the minimum weight Hamiltonian cycle (traveling salesman problem), in the same time bound.
David Eppstein
doaj   +1 more source

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

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, Dinh Quy Ta, Minh Hoàng Hà, Andrea Schaerf   +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

A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows

International Transactions in Operational Research, EarlyView.
Abstract We study an inventory routing problem with time windows (IRPTW). A single supplier serves a set of customers to fulfill their demand throughout a planning horizon. Each customer can be visited only within designated time windows, assuming each customer provides a single delivery time window valid for all periods.
Sara Charaf, Guy Desaulniers, Frédéric Quesnel, Duygu Taş, Simme Douwe P. Flapper, Tom Van Woensel   +5 more
wiley   +1 more source

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

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, André Sammartino, Simon Ville, David Merrett, Monica Keneley   +4 more
wiley   +1 more source

GCN-Pointransformer Model for Solving Traveling Salesman Problem [PDF]

Jisuanji kexue yu tansuo
Because the Transformer model is based on the fully connected attention mechanism, the computational complexity is high and the GPU memory usage is too large when solving the classic traveling salesman problem (TSP).
QIU Yunfei, LIU Yifei, YU Zhilong, JIN Haibo
doaj   +1 more source

A Contribution to the “Travelling-Salesman” Problem

Journal of the Royal Statistical Society Series B: Statistical Methodology, 1955
Summary This paper is concerned with finding the shortest closed path joining n points where the distances between all pairs of points are given. For a set of points in a metric space we establish that the shortest path will consist of a single loop circuit that will never cross itself.
Morton, G., Land, A. H.
openaire   +2 more sources