Results 31 to 40 of about 496 (169)
The Multiple Traveling Salesman Problem with Backup Coverage
Electronic Notes in Discrete Mathematics, 2018 Abstract We consider a variant of the classical Multiple Traveling Salesmen Problem in which the distance between any two vehicles is never greater than a fixed distance D. This new feature allows salesmen to help each other timely if an emergency happens, with an estimated backup response time related to D.
Guilherme Dhein +2 more
openaire +1 more source
Havacılık ve Uzay Teknolojileri Dergisi, 2022 Parallelization of algorithms can reduce time in many cases while using multiple cores at the same time. Although Algorithms such as Genetic Algorithm (GA) and Ant Colony (AC) are widely used optimization algorithms to solve the nonlinear problems it is ...
Reşat Buğra Erkartal +2 more
doaj
PLoS Computational Biology, 2013 Pollinating bees develop foraging circuits (traplines) to visit multiple flowers in a manner that minimizes overall travel distance, a task analogous to the travelling salesman problem.
Andrew M Reynolds +2 more
doaj +1 more source
Double evolutsional artificial bee colony algorithm for multiple traveling salesman problem
MATEC Web of Conferences, 2016 The double evolutional artificial bee colony algorithm (DEABC) is proposed for solving the single depot multiple traveling salesman problem (MTSP).
Xue Ming Hao, Wang Tie Zhu, Mao Sheng
doaj +1 more source
Journal of Modern Power Systems and Clean Energy, 2018 A layout of the offshore wind farm (OSWF) plays a vital role in its capital cost of installation. One of the major contributions in the installation cost is electrical collector system (ECS). ECS includes: submarine cables, number of wind turbines (WTs),
Ramu SRIKAKULAPU, Vinatha U
doaj +1 more source
ROUTE OPTIMIZATION OF MULTIPLE-AGENT TRAVELLING SALESMAN PROBLEM
Czech Journal of Civil Engineering, 2018 Route optimization is quotidian engineering problem. Problem of finding the optimal and suboptimal routes is one of the most studied optimization problem. In this paper, author firstly presented a short literature overview of the history of routing problems and namely travelling salesman problem (TSP).
openaire +3 more sources
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 +2 more
doaj
Advanced Physics Research, EarlyView.This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim +3 more
wiley +1 more source
Multi‐Agent Reinforcement Learning for Joint Police Patrol and Dispatch
Naval Research Logistics (NRL), EarlyView.ABSTRACT Police patrol units need to split their time between performing preventive patrol and being dispatched to serve emergency incidents. In the existing literature, patrol and dispatch decisions are often studied separately. We consider joint optimization of these two decisions to improve police operations efficiency and reduce response time to ...
Matthew Repasky, He Wang, Yao Xie
wiley +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT A formation inversion algorithm with real‐time performance and accuracy is crucial for natural gamma logging while drilling (LWD). However, traditional inversion algorithms are often limited by high computational resource consumption and insufficient accuracy.
Juntao Liu +4 more
wiley +1 more source