Results 91 to 100 of about 28,852 (210)

An ACO-Inspired, Probabilistic, Greedy Approach to the Drone Traveling Salesman Problem [PDF]

, 2019
In recent years, major companies have done research on using drones for parcel delivery. Research has shown that this can result in significant savings, which has led to the formulation of various truck and drone routing and scheduling optimization ...
Houseknecht, Jessica
core   +1 more source

Minimization of Off-Grade Production in Multisite Multiproduct Plants by Solving Multiple Traveling Salesman Problem

Chemical Engineering Transactions, 2014
Continuous multiproduct plants allow the production of several products (product grades). During grade transitions off-spec products are produced. The economic losses and the environmental impact of these transitions are sequence dependent, so the amount
A. Király, B. Farsang, T. Chován, M. Christidou, E. Karlopoulos, J. Abonyi   +5 more
doaj   +1 more source

A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM

, 2017
WOS ...
NURİYEVA, F., KİZİLATES, G.
openaire   +4 more sources

Multi-type ant colony system for solving the multiple traveling salesman problem.

Revista Técnica de la Facultad de Ingeniería, 2013
The Multiple Traveling Salesman problem (mTSP) is an extension of the well-known Traveling Sales- man Problem (TSP), where more than one salesman is allowed to be used in order to visit some cities just once.
Yasel José Costa Salas, René Abreu Ledón, Norge Isaías Coello Machado, Ann Nowé   +3 more
doaj  

Turning Energy-Aware Route Planning With an Extended TSP and Double-Layer State Graph: Experimental Evaluation With a Crawler Mobile Robot

IEEE Access
For mobile robots with multiple destinations that must be visited only once, the Traveling Salesman Problem (TSP) provides an optimal route. The optimality may not be achieved for crawler robots, which are often used in the forestry industry and have a ...
Namihei Adachi, Hisashi Date
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

Visual Reasoning and Multi-Agent Approach in Multimodal Large Language Models (MLLMs): Solving TSP and mTSP Combinatorial Challenges

Machine Learning and Knowledge Extraction
Multimodal 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, Ahmad Abutahoun, Taqwa I. Alhadidi, Ahmed Jaber, Huthaifa I. Ashqar, Shadi Jaradat, Ahmed Abdelhay, Sebastien Glaser, Andry Rakotonirainy   +8 more
doaj   +1 more source

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters [PDF]

Journal of Optimization in Industrial Engineering, 2014
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman
parham azimi, Ramtin Rooeinfar, Hani Pourvaziri   +2 more
doaj  

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, Jacques Teghem, Taïcir Loukil   +2 more
openaire   +1 more source

A hybrid genetic algorithm with cycle reassembly for solving colored traveling salesman problems

Journal of King Saud University: Computer and Information Sciences
As 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