Results 61 to 70 of about 59,482 (207)
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm [PDF]
Journal of Optimization in Industrial Engineering, 2014 The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution.
Hossein Larki, Majid Yousefikhoshbakht
doaj
A Multi-Phase Method for Euclidean Traveling Salesman Problems
Axioms, 2022 The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once.
Víctor Hugo Pacheco-Valencia +3 more
doaj +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
Random gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
International Journal of Industrial Engineering and Production Research, 2018 this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem.
Ahmad Sheibat Alhamdi +1 more
doaj +2 more sources
Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution
, 2006 We report a new statistical general property in traveling salesman problem, that the $n$th-nearest-neighbor distribution of optimal tours verifies with very high accuracy an exponential decay as a function of the order of neighbor $n$.
Brooke +21 more
core +1 more source
International Transactions in Operational Research, EarlyView.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
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 +3 more
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
Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem
Abstract and Applied Analysis, 2014 To solve the charge planning problem involving charges and the orders in each charge, a traveling salesman problem based charge planning model and the improved cross entropy algorithm are proposed. Firstly, the charge planning problem with unknown charge
Fan Yang, Qiqiang Li
doaj +1 more source
The Pyramidal Method for Traveling Salesman Problem
Communications, 2000 A shortest pyramidal tour (SPT) is a well-solved case of TSP when a distance matrix is the Monge matrix. We study heuristic repeating method for SPT with the distance matrix without restriction.
Stefan Pesko
doaj +1 more source