Results 101 to 110 of about 28,852 (210)
An open close multiple travelling salesman problem with single depot
Decision Science Letters, 2019 Este documento presenta una variante práctica novedosa, a saber, un problema de múltiples vendedores ambulantes abiertos y cerrados con un solo depósito (OCMTSP) que se refiere a la generalización del problema clásico del vendedor ambulante (TSP). En OCMTSP, los vendedores generales se pueden clasificar en internos/permanentes y externos/subcontratados,
Jayanth Kumar Thenepalle +1 more
openaire +2 more sources
TSP--Infrastructure for the Traveling Salesperson Problem [PDF]
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
core +1 more source
Discover Artificial IntelligenceThe traveling salesman problem (TSP) is an NP-hard problem being studied by many researchers. Metaheuristic algorithms generally depend on nature-inspired phenomena successfully applied to combinatorial optimization, such as routing, scheduling ...
Mehmet Fatih Demiral
doaj +1 more source
DronesThe study of unmanned aerial vehicle (UAV) coverage path planning is of great significance for ensuring maritime situational awareness and monitoring.
Yiyuan Li +4 more
doaj +1 more source
K-DSA for the Multiple Traveling Salesman Problem
Journal of Systems Engineering and Electronics, 2023 Sheng Tong, Hong Qu, Junjie Xue
openaire +1 more source
Научно-технический вестник информационных технологий, механики и оптикиThis paper presents the development and evaluation of a method for solving the Multiple Traveling Salesman Problem (mTSP), with the objective of minimizing the maximum route length (“minimax” optimization).
E. N. Miftakhov +2 more
doaj +1 more source
A hybrid genetic algorithm for the min–max Multiple Traveling Salesman Problem
Computers & Operations ResearchThis paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a TSP sequence as the representation of each individual, and a dynamic programming algorithm is employed to evaluate the individual and find the optimal mTSP solution for ...
Sasan Mahmoudinazlou, Changhyun Kwon
openaire +3 more sources
ASAP: The After Salesman Problem [PDF]
The customer contacts taking place after a sales transaction and the services involved are of increasing importance in contemporary business models. The responsiveness to service requests is a key dimension in service quality and therefore an important ...
Klundert, Joris van de, Wormer, Laurens
core +1 more source
Traveling of multiple salesmen to dynamically changing locations for satisfying multiple goals
Digital Chemical EngineeringPolymer grade scheduling, maritime surveillance, e-food delivery, e-commerce, and military tactics necessitate multiple agents (e.g., extruders, speed boats, salesmen) capable of visiting (or completing) dynamically changing locations (or tasks) in ...
Anubha Agrawal, Manojkumar Ramteke
doaj +1 more source
QUANTUM INSPIRED EVOLUTIONARY ALGORITHM FOR SOLVING MULTIPLE TRAVELLING SALESMAN PROBLEM
International Journal of Research in Engineering and Technology, 2013 Quantum computing is a relatively new but very promising field of computer science. It provides an alternative way of building computers which are significantly better than current day’s classical computers. Here in this paper, we attempt to develop an algorithm which makes use of the concepts of quantum computers but are actually run on classical ...
openaire +1 more source