Results 51 to 60 of about 28,852 (210)
On The Continuous Coverage Problem for a Swarm of UAVs
Unmanned aerial vehicles (UAVs) can be used to provide wireless network and remote surveillance coverage for disaster-affected areas. During such a situation, the UAVs need to return periodically to a charging station for recharging, due to their limited
Chakareski, Jacob +4 more
core +1 more source
Multi-UAV Formation Path Planning Based on Compensation Look-Ahead Algorithm
This study primarily studies the shortest-path planning problem for unmanned aerial vehicle (UAV) formations under uncertain target sequences. In order to enhance the efficiency of collaborative search in drone clusters, a compensation look-ahead ...
Tianye Sun +3 more
doaj +1 more source
Double evolutsional artificial bee colony algorithm for multiple traveling salesman problem
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
Exact methods for the traveling salesman problem with multiple drones
Drone delivery is drawing increasing attention in last-mile delivery. Effective solution methods to solve decision-making problems arising in drone delivery allow to run and assess drone delivery systems. In this paper, we focus on delivery systems with a single traditional vehicle and multiple drones working in tandem to fulfill customer requests.
Cavani S., Iori M., Roberti R.
openaire +3 more sources
Parallel patterns determination in solving cyclic flow shop problem with setups
The subject of this work is the new idea of blocks for the cyclic flow shop problem with setup times, using multiple patterns with different sizes determined for each machine constituting optimal schedule of cities for the traveling salesman problem (TSP)
Bożejko Wojciech +3 more
doaj +1 more source
Product Service Scheduling Problem with Service Matching Based on Tabu Search Method
This paper considers the product service scheduling problem with service matching. This problem is a complex scheduling problem that integrates multiple traveling salesman problem (MTSP) and multiple service types.
Liu Cheng Hao +4 more
doaj +1 more source
ABSTRACT This study examines how individuals accept and navigate paradoxical tensions within a sustainability context, using a multiple case study of five Italian companies implementing circularity measurement tools. By exploring the interplay between self‐efficacy and acceptance of paradoxical tensions, drawing upon the Goal Setting and Paradox ...
Alice Alosi +4 more
wiley +1 more source
Comparing to the traditional data collecting method with data route,the technology of wireless mobile nodes has gradually became a new technique in the wireless sensor network.As the solution to the visiting order of the static nodes was an intrinsic NP ...
Hao FENG, Lei LUO, Yong WANG, Miao YE
doaj +2 more sources
An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem [PDF]
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen.
Mohammad Sedighpour +2 more
doaj
ABSTRACT The paths taken by visitors in museums influence what they see, do, learn, and experience. Poorly designed museums can lead to missed goals and opportunities. In this article, I critically review visitor studies published since the 1930s to evaluate explanations for visitor path choice in museums, namely, the location and attractiveness of ...
Gareth Davey
wiley +1 more source

