Results 71 to 80 of about 2,267 (186)

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP) [PDF]

Journal of Optimization in Industrial Engineering, 2010
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution.
Ellips Masehian
doaj  

‘Good Enough’: The Use of Satisficing in the Design of Disruptive Innovation in Emerging Economies

Creativity and Innovation Management, Volume 35, Issue 1, Page 17-39, March 2026.
ABSTRACT While design has been acknowledged as a fundamental driver of innovation, questions remain about how design affects disruptive innovation from the perspective of consumer perceptions. Drawing from Simon's insights of bounded rationality and satisficing applied within the technology acceptance model (TAM), we propose an integrated, customer ...
Jie Xue, K. Scott Swan
wiley   +1 more source

Pitfalls, benefits, and comparative analysis of artificial intelligence ChatBots in the systematic review process

International Transactions in Operational Research, Volume 33, Issue 2, Page 719-774, March 2026.
Abstract The transformative potential of artificial intelligence (AI) ChatBots, leveraging natural language processing for information retrieval and knowledge synthesis, has garnered attention across diverse fields, including research. Recognizing AI's importance, researchers and policymakers are actively engaged in its development.
Cinzia Daraio, Simone Di Leo, Federico Ferazzoli   +2 more
wiley   +1 more source

Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem

Revista Produção Online, 2014
In this paper, we propose new heuristic methods for solver the Clustered Traveling Salesman Problem (CTSP). The CTSP is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and ...
Mário Mestria
doaj   +1 more source

Advanced Trajectory Planning for Unmanned Aerial Vehicles in the Context of Data Collection from Spatially Distributed Wireless Sensor Networks

Cybernetics and Information Technologies
Wireless Sensor Networks (WSNs) are extensively used for monitoring large-scale areas with sensors having different coverage zones. Unmanned Aerial Vehicles (UAVs) are deployed to efficiently collect data from these distributed nodes.
Matkurbanov Tulkin, Utegenov Akhmet, Davlatyor Mengliyev, Matkurbonov Dilshod   +3 more
doaj   +1 more source

Multi-UAV Formation Path Planning Based on Compensation Look-Ahead Algorithm

Drones
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, Wei Sun, Changhao Sun, Ruofei He   +3 more
doaj   +1 more source

THE DUBINS TRAVELING SALESMAN PROBLEM WITH CONSTRAINED COLLECTING MANEUVERS

Acta Polytechnica CTU Proceedings, 2016
In this paper, we introduce a variant of the Dubins traveling salesman problem (DTSP) that is called the Dubins traveling salesman problem with constrained collecting maneuvers (DTSP-CM).
Petr Váňa, Jan Faigl
doaj   +1 more source

Dataset for the electric capacitated traveling salesman problem. [PDF]

Data Brief, 2023
Gialos A, Zeimpekis V.
europepmc   +1 more source

Traveling salesman problem solution using magnonic combinatorial device. [PDF]

Sci Rep, 2023
Balinskyy M, Khitun A.
europepmc   +1 more source

The Symmetric Traveling Salesman Problem

, 2005
Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as a product of 2-cycles. Applying the modified Floyd-Warshall algorithm to (sigma_T)^-1M^-, we construct acceptable and 2-circuit cycles some sets of which may yield circuits ...
openaire   +3 more sources