Results 71 to 80 of about 4,732 (227)
经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)
Zhejiang Daxue xuebao. Lixue ban, 2000 A review was given of the principal probability limit theorems of solutions to classical combinatorial optimization problems.The emphasis was on the travelling salesman problems,minimal spanning trees,matching and lengths of the longest increasing ...
SUZhong-gen(苏中根)
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 Metric Travelling Salesman Problem: The Experiment on Pareto-optimal Algorithms
Труды Института системного программирования РАН, 2018 The Metric Travelling Salesman Problem is a subcase of the Travelling Salesman Problem (TSP), where the triangle inequality holds. It is a key problem in combinatorial optimization.
S. M. Avdoshin, E. N. Beresneva
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
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
Robot Path Planning Based On The Travelling Salesman Problem
Chemical Engineering Transactions, 2015 Against the background of "Robot Travelling China" competition, this paper introduces the idea of TSP to seek optimal motion path. Applying the knowledge of graph theory to analyze and transform the map of competition.
G.Q. Wang +4 more
doaj +1 more source
, 2016 The Steiner travelling salesman problem (STSP) is an important issue in intelligent transportation systems and has various practical applications, such as travelling and parcel delivery. In this study, we consider the STSP in real-world road maps, i.e.,
Zhu, Mingzhe +5 more
core +1 more source
The travelling salesman problem [PDF]
, 2012 In the travelling salesman problem we are given a graph. The task of the salesman is to find the shortest (or cheapest) possible route by visiting each vertex (that represents cities) exactly once and returning to the initial vertex (city).
Zupanc, Kaja
core
A comparison of heuristic and human performance on open versions of the traveling salesperson problem. [PDF]
, 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
International Transactions in Operational Research, Volume 33, Issue 6, Page 3714-3743, November 2026.Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira +1 more
wiley +1 more source