Results 41 to 50 of about 2,267 (186)

A Formation Inversion Algorithm Based on Collaborative Fuzzy Gradient Neural Dynamics for Natural Gamma Logging While Drilling

open access: yesCAAI 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

Insights into the application of the traveling salesman problem to logistics without considering financial risk: A bibliometric study [PDF]

open access: yesManagement Science Letters
Suppliers can use different strategies to distribute their products, Among the most common complex optimization problems related to the transportation of products is the traveling salesman problem.
Amir Mohammad Larni-Fooeik   +2 more
doaj   +1 more source

Navigating Acceptance of Paradoxical Tensions: A Self‐Efficacy Perspective on Paradox and Goal Setting Theories

open access: yesBusiness Ethics, the Environment &Responsibility, EarlyView.
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

On random symmetric travelling salesman problems [PDF]

open access: yesThe 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003
Let the edges of the complete graph Kn be assigned independent uniform [0, 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor, respectively. We show that whp |ZTSP − Z2FAC| = o(1).
openaire   +1 more source

Understanding Visitor Path Choice and Enhancing Wayfinding in Museums: A Critical Review of a Century of Research

open access: yesCurator: The Museum Journal, EarlyView.
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

Genetiniai algoritmai komivojažieriaus uždaviniui: negatyvieji ir pozityvieji aspektai*

open access: yesInformacijos Mokslai, 2009
Šiame straipsnyje nagrinėjami klausimai, susiję su genetinių algoritmų taikymu, sprendžiant gerai žinomą kombinatorinio optimizavimo uždavinį – komivojažieriaus uždavinį (KU) (angl. traveling salesman problem).
Alfonsas Misevičius   +3 more
doaj   +1 more source

Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic

open access: yesMathematics, 2023
This study investigates the flying sidekick traveling salesman problem (FSTSP), in which a truck and an unmanned aerial vehicle work together to make deliveries.
Vincent F. Yu   +3 more
doaj   +1 more source

Production routing decisions in a two‐echelon supply chain with multiple delivery modes

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel   +2 more
wiley   +1 more source

Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm [PDF]

open access: yesJournal of Optimization in Industrial Engineering, 2014
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution.
Hossein Larki, Majid Yousefikhoshbakht
doaj  

A Multi-Phase Method for Euclidean Traveling Salesman Problems

open access: yesAxioms, 2022
The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once.
Víctor Hugo Pacheco-Valencia   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy