Results 81 to 90 of about 21,266 (220)
A Two‐Stage Optimization Model for Multiple‐Crane Service Schedules Problem
Advances in Civil Engineering, Volume 2026, Issue 1, 2026.Scheduling tower crane movements is essential in a large construction site where multiple cranes are deployed. Efficient planning can avoid potential crane collisions, reduce construction duration, and save energy consumption. The multiple‐crane service schedules problem (MCSSP) is a classic combinatorial problem.
Wen-Qi Wang +6 more
wiley +1 more source
Research on Path Optimization for UAV‐Vehicle Collaboration in Emergency Rescue
Journal of Advanced Transportation, Volume 2026, Issue 1, 2026.With the rapid development of the low‐altitude economy, unmanned aerial vehicles (UAVs) have exhibited enormous potential in emergency rescue and material delivery fields due to their flexibility; however, individual UAVs are often constrained by endurance issues.
Shouqiang Xue +5 more
wiley +1 more source
Fast Shapley Value Approximation Through Machine Learning With Application in Routing Problems
Networks, Volume 86, Issue 4, Page 402-427, December 2025.ABSTRACT For many routing applications, it is not only necessary to minimize total costs but also to allocate them to individual customers. In this context, the allocation according to the Shapley value is a well‐known method highly regarded for its fulfillment of major fairness criteria.
Johannes Gückel, Pirmin Fontaine
wiley +1 more source
New Heuristic Approaches for the Min–Max Regret Traveling Salesman Problem
IEEE AccessThe traveling salesman problem (TSP) is widely known as one of the most important NP-hard combinatorial optimization problems. In this paper, we consider the min-max regret traveling salesman problem (MMR-TSP) with interval travel costs. The MMR-TSP aims
Kazuki Hasegawa +2 more
doaj +1 more source
Didactic Visualization of Routing Problems
Education Sciences, 2020 The Traveling Salesman and Vehicle Routing Problems are integral parts of bachelor and master programs related to Operations Research/Management Science. This is due to their relevance in both practical applications and research.
Margaretha Gansterer, Veronika Klug
doaj +1 more source
Computer-Aided Civil and Infrastructure Engineering, Volume 40, Issue 29, Page 5554-5575, 9 December 2025.Abstract This paper proposes a fully automated end‐to‐end inspection‐path‐planning strategy for underground utilities, such as pipelines, based on building information modeling (BIM). An automatic extraction method is developed to process utility information from BIM models, using a registration step that pairs each pipeline with its corresponding ...
Zihan Yang +6 more
wiley +1 more source
Finding optimal solutions to Traveling Salesman Problem by using Branch and Bound method and one of intelligence techniques with application [PDF]
المجلة العراقية للعلوم الاحصائية, 2013 In this research we find an optimal solutions for traveling salesman problem (TSP) using Branch and Bound method as well as we use an intelligence techniques represented by ant colony optimization (ACO) and applied them on the DNA chain data, where the ...
doaj +1 more source
Engineering Reports, Volume 7, Issue 11, November 2025.Latin Hypercube Sampling (LHS), widely used in surrogate modeling, was enhanced by applying a maxmin criterion and sorting the samples via a Traveling Salesman Problem (TSP) strategy. This reduced the Euclidean travel distance during simulations, improved space coverage, boosted model accuracy by 0.13%, and cut computational time by 14% ABSTRACT ...
Luis Felipe Sánchez +2 more
wiley +1 more source
Traveling salesman problem with drone and bicycle: multimodal last‐mile e‐mobility
International Transactions in Operational Research, Volume 32, Issue 6, Page 3232-3258, November 2025.Abstract Recently, the multimodal last‐mile e‐mobility concept has been at the center of attention for cleaner, greener, and more accessible urban deliveries. As part of sustainable transportation systems, multimodal e‐mobility is proper for a variety of logistics operations as well as medical applications.
Erfan Babaee Tirkolaee +2 more
wiley +1 more source
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP). [PDF]
PeerJ Comput Sci, 2023 Hao T, Yingnian W, Jiaxing Z, Jing Z.
europepmc +1 more source