Results 61 to 70 of about 4,258 (228)

A new heuristic algorithm based on minimum spanning tree for solving metric traveling salesman problem [PDF]

International Journal of Industrial Engineering and Production Research
Due to the many applications of the travelling salesman problem, solving this problem has been considered by many researchers. One of the subsets of the travelling salesman problem is the metric travelling salesman problem in which a triangular ...
Malihe Masoumi, Javad Behnamian
doaj  

Optimization of distribution routes in resolving traveling salesman problems using the tabu search algorithm (case study: CV. Bintang anugerah sukses pekanbaru)

Desimal, 2021
CV. Bintang Anugerah Sukses is a company engaged in the distribution of product PT. Belfoods Indonesia. Distribution of frozen goods distributes to 12 customer agencies using one vehicle.
Sri Basriati, Elfira Safitri, Resi Anggraini   +2 more
doaj   +1 more source

Experimental Analysis of Ant System on Travelling Salesman Problem Dataset TSPLIB [PDF]

EAI Endorsed Transactions on Pervasive Health and Technology, 2019
INTRODUCTION: Traveling Salesman Problem (TSP) is one of the vast research areas and has been considered as subproblems in many fields apart from computer science and also in the field of computer science.OBJECTIVES: This paper deals with the comparison ...
Kalaipriyan Thirugnanasambandam, Raghav. R.S, Saravanan. D, Prabu. U, Rajeswari. M   +4 more
doaj   +1 more source

A Theoretical Approach for Structuring and Analysing Knowledge Provenance for Visual Analytics

Computer Graphics Forum, EarlyView.
VAKG unfolds the interactions within the current knowledge model (A) into a temporal knowledge graph (B), which is structured as a 4‐way graph containing two temporal (green) and two static (yellow) knowledge graphs. By using VAKG, one can structure and store the user's knowledge‐gathering process and all related interactions for eventual analysis (C).
L. Christino, S. Rezaeipour, E. Milios, F. Paulovich   +3 more
wiley   +1 more source

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, J. Lukasczyk, J. Tierny, A. Gyulassy, G. H. Weber, H. Carr, C. Garth   +6 more
wiley   +1 more source

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

The Traveling Salesman Problem with flexible coloring [PDF]

Discrete Applied Mathematics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roemer, T. A., Ahmadi, R., Dasu, S.
openaire   +3 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

TSP - Infrastructure for the Traveling Salesperson Problem

, 2006
The traveling salesperson or salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city.
Kurt Hornik, Michael Hahsler, Hahsler, Michael, Hornik, Kurt   +3 more
core   +1 more source

The geometric maximum traveling salesman problem [PDF]

Journal of the ACM, 2003
We consider the traveling salesman problem when the cities are points in ℝ d for some fixed d and distances are computed according to geometric distances, determined by some norm.
Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson 0001, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe   +5 more
openaire   +4 more sources