Results 101 to 110 of about 28,986 (210)
Machine Learning and Knowledge ExtractionMultimodal Large Language Models (MLLMs) harness comprehensive knowledge spanning text, images, and audio to adeptly tackle complex problems. This study explores the ability of MLLMs in visually solving the Traveling Salesman Problem (TSP) and Multiple ...
Mohammed Elhenawy +8 more
doaj +1 more source
Seed based plant propagation algorithm for multiple travelling salesman problem
International Journal of Engineering & Technology, 2018 Multiple Travelling Salesman Problem is a complex problem in which route for a salesman is assigned to visit a city that has various hurdles such as congested road, damaged road, etc. In recent years biologically inspired algorithms are most widely used to solve many optimization problems.
S Kalaiarasi, P Sriramya
openaire +2 more sources
A hybrid genetic algorithm with cycle reassembly for solving colored traveling salesman problems
Journal of King Saud University: Computer and Information SciencesAs a generalization of the well-known multiple traveling salesman problem, the Colored Traveling Salesman Problem (CTSP) can completely delineate individual salesmen’s "spheres of influence" of city visits using colors.
Zhicheng Lin, Jun Li
doaj +1 more source
Multiple crossover genetic algorithm for the multiobjective traveling salesman problem
Electronic Notes in Discrete Mathematics, 2010 Abstract Many crossover operators have been proposed and adapted to different combinatorial optimization problems. In particular, many permutation based crossovers are well designed for the traveling salesman problem (TSP) which is among the most-studied combinatorial optimization problems. However, there is no evidence that one crossover operator is
Semya Elaoud +2 more
openaire +1 more source
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
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
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
Научно-технический вестник информационных технологий, механики и оптики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
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
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