Background: In the Peg Transfer task in the Fundamentals of Laparoscopic Surgery (FLS) curriculum, six peg objects are sequentially transferred in a bimanual fashion using laparoscopic instruments across a pegboard and back. There are over 268 trillion ways of completing this task. In the setting of many possibilities, the traveling salesman problem is one where the objective is to solve for the shortest distance traveled through a fixed number of points. The goal of this study is to apply the traveling salesman problem to find the shortest two-dimensional path length for this task.
Methods: A database platform was used with permutation application output to generate all of the single-direction solutions of the FLS Peg Transfer task. A brute-force search was performed using nested Boolean operators and database equations to calculate the overall two-dimensional distances for the efficient and inefficient solutions. The solutions were found by evaluating peg object transfer distances and distances between transfers for the nondominant and dominant hands.
Results: For the 518,400 unique single-direction permutations, the mean total two-dimensional peg object travel distance was 33.3 ± 1.4 cm. The range in distances was from 30.3 to 36.5 cm. There were 1,440 (0.28 %) of 518,400 efficient solutions with the minimized peg object travel distance of 30.3 cm. There were 8 (0.0015 %) of 518,400 solutions in the final solution set that minimized the distance of peg object transfer and minimized the distance traveled between peg transfers. Peg objects moved 12.7 cm (17.4 %) less in the efficient solutions compared to the inefficient solutions.
Conclusions: The traveling salesman problem can be applied to find efficient solutions for surgical tasks. The eight solutions to the FLS Peg Transfer task are important for any examinee taking the FLS curriculum and for certification by the American Board of Surgery.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1007/s00464-012-2644-2 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
PlmCas12e Utilizes Glu662 to Prevent Cleavage Site Occupation by Positively Charged Residues Before Target Strand Cleavage.
Molecules
October 2024
School of Medicine, and Warshel Institute for Computational Biology, The Chinese University of Hong Kong (Shenzhen), Shenzhen 518172, China.
CRISPR-Cas12e is a recently identified gene-editing tool mainly known because its relatively small size benefits cell delivery. Drastically different from Cas9, it creates a blunt-end double-strand breakage of the DNA via two cleavage sites; Cas12e produces a sticky-end double-strand breakage of the DNA through only one cleavage site in its RuvC domain, meaning two consecutive cleavage events first on the non-target strand (ntsDNA) and then the target strand (tsDNA). Though crucial for Cas12e's cleavage efficiency, the mechanism by which Cas12e loads tsDNA for the second cleavage remains elusive.
View Article and Find Full Text PDFReinforcement Learning-Based Nonautoregressive Solver for Traveling Salesman Problems.
IEEE Trans Neural Netw Learn Syst
October 2024
Article Synopsis
- The traveling salesman problem (TSP) is a well-known optimization challenge with many practical applications, and recent advancements in neural networks (NNs) have improved solutions for it.
- Nonautoregressive (NAR) networks can speed up inference but usually produce lower quality solutions compared to other methods.
- The authors introduce NAR4TSP, a novel NAR model that combines reinforcement learning (RL) with special architecture enhancements, showing superior performance in solution quality and speed over existing models in various TSP instances.
Solving a real-world package delivery routing problem using quantum annealers.
Sci Rep
October 2024
Serikat-Consultoría y Servicios Tecnológicos, 48009, Bilbao, Spain.
Research focused on the conjunction between quantum computing and routing problems has been very prolific in recent years. Most of the works revolve around classical problems such as the Traveling Salesman Problem or the Vehicle Routing Problem. The real-world applicability of these problems is dependent on the objectives and constraints considered.
View Article and Find Full Text PDFSymmetric optical multipass matrix systems and the general rapid design methodology.
Heliyon
August 2024
Center for Advanced Quantum Studies, Applied Optics Beijing Area Major Laboratory, Department of Physics, Beijing Normal University, Beijing 100875, China.
We proposed an original type of multipass cell named symmetric optical multipass matrix system (SMMS), in which the same matrix patterns of various sizes can be formed on both sides. According to its special symmetric configurations, the SMMS design problem is modeled as a variant of the classical traveling salesman problem, which can be rapidly solved by evolutionary optimization algorithms. Two sets of 3-mirror SMMSs are designed, analyzed and built, which show superior characteristics of high stability, desirable beam quality and adjustable optical path lengths.
View Article and Find Full Text PDFA novel fractional-order memristive Hopfield neural network for traveling salesman problem and its FPGA implementation.
Neural Netw
November 2024
College of Electronics and Information Engineering, Sichuan University, Chengdu 610065, China. Electronic address:
This paper proposes a novel fractional-order memristive Hopfield neural network (HNN) to address traveling salesman problem (TSP). Fractional-order memristive HNN can efficiently converge to a globally optimal solution, while conventional HNN tends to become stuck at a local minimum in solving TSP. Incorporating fractional-order calculus and memristors gives the system long-term memory properties and complex chaotic characteristics, resulting in faster convergence speeds and shorter average distances in solving TSP.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!