Results 61 to 70 of about 30,647 (208)
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 +2 more
doaj +1 more source
Selberg integrals in 1D random Euclidean optimization problems
, 2019 We consider a set of Euclidean optimization problems in one dimension, where the cost function associated to the couple of points $x$ and $y$ is the Euclidean distance between them to an arbitrary power $p\ge1$, and the points are chosen at random with ...
Caracciolo, Sergio +3 more
core +1 more source
A new heuristic algorithm based on minimum spanning tree for solving metric traveling salesman problem [PDF]
International Journal of Industrial Engineering and Production ResearchDue 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
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 +4 more
doaj +1 more source
On random symmetric travelling salesman problems [PDF]
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003 Let the edges of the complete graph Kn be assigned independent uniform [0, 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor, respectively. We show that whp |ZTSP − Z2FAC| = o(1).
openaire +1 more source
A tabu search algorithm for scheduling a single robot in a job-shop environment [PDF]
, 1999 We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot.
Hurink, J.L., Knust, S.
core +2 more sources
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 +3 more
wiley +1 more source
The Travelling Salesman Problem and Related Problems [PDF]
, 1978 New formulations are presented for the Travelling Salesman problem, and their relationship to previous formulations is investigated. The new formulations are extended to include a variety of transportation scheduling problems, such as the Multi ...
Gavish, Bezalel, Graves, Stephen C.
core
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
Comparison of Methods for Travelling Salesman Problem [PDF]
, 2011 Tato práce se zabývá srovnáním metod řešení problému obchodního cestujícího (traveling salesman problem). Pro řešení tohoto NP-úplného problému existuje celá řada algoritmů, kdy není jednoduché vybrat ten správný.
Šušová, Lucia
core