Results 31 to 40 of about 5,636,127 (168)

Operations Research‐Based Formalisation and Design of Sustainable Reverse Logistics for E‐Waste Supply Chains

Business Strategy and the Environment, EarlyView.
ABSTRACT This study demonstrates how a profitable, lean, and environmentally responsible e‐waste reverse logistics system can be designed using integrated Operations Research (OR) techniques. Addressing the growing urgency of responsible consumption (UN SDG 12) and the projected rise of the e‐waste sector to USD 137.60 billion by 2029, the research ...
Sheeba Pathak, Hajar Fatorachian
wiley   +1 more source

Vine copula knockoffs for variable selection in gene expression studies

Canadian Journal of Statistics, EarlyView.
Abstract Identifying clinical and genetic markers is essential for stratifying cancer patients by survival outcomes and guiding personalized treatment strategies. However, gene expression studies often involve high‐dimensional predictors with mixed data types and complex dependence, which complicates reliable variable selection.
José Ulises Márquez Urbina, Alejandro Román Vásquez, Graciela González Farías, Gabriel Escarela   +3 more
wiley   +1 more source

On the Solution of the Traveling Salesman Problem by a Modification of the Hungarian Method

Кібернетика та комп'ютерні технології
Introduction. The traveling salesman problem is becoming an important object of research in various fields of science, economics and technology. Construction of efficient algorithms with an optimality criterion for the obtained solution is a relevant ...
Dmitri Terzi
doaj   +1 more source

OPTIMAL TOUR CONSTRUCTIONS FOR MULTIPLE MOBILE ROBOTS [PDF]

Journal of Engineering Science and Technology, 2011
The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental
AMIR A. SHAFIE
doaj  

Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero

Revista Iberoamericana de Automática e Informática Industrial RIAI, 2016
Resumen: En este trabajo se estudia el Problema de Secuenciación de Trabajos codificado como un Problema de Agente Viajero y resuelto mediante Algoritmos Genéticos.
G.E. Anaya Fuentes, E.S. Hernández Gress, J.C. Seck Tuoh Mora, J. Medina Marín   +3 more
doaj   +1 more source

Multi‐Agent Reinforcement Learning for Joint Police Patrol and Dispatch

Naval Research Logistics (NRL), EarlyView.
ABSTRACT Police patrol units need to split their time between performing preventive patrol and being dispatched to serve emergency incidents. In the existing literature, patrol and dispatch decisions are often studied separately. We consider joint optimization of these two decisions to improve police operations efficiency and reduce response time to ...
Matthew Repasky, He Wang, Yao Xie
wiley   +1 more source

Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression

Journal of Applied Mathematics, 2014
This paper solves the dynamic traveling salesman problem (DTSP) using dynamic Gaussian Process Regression (DGPR) method. The problem of varying correlation tour is alleviated by the nonstationary covariance function interleaved with DGPR to generate a ...
Stephen M. Akandwanaho, Aderemi O. Adewumi, Ayodele A. Adebiyi   +2 more
doaj   +1 more source

A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems

International Journal of Computational Intelligence Systems, 2018
Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc.
Kin-Ming Lo, Wei-Ying Yi, Pak-Kan Wong, Kwong-Sak Leung, Yee Leung, Sui-Tung Mak   +5 more
doaj   +1 more source

The Single Picker Routing Problem with Scattered Storage in Parallel‐Aisle Warehouses With Multiple Blocks

Networks, EarlyView.
ABSTRACT This paper investigates the b$$ b $$‐block single picker routing problem with scattered storage (b$$ b $$‐SPRP‐SS). For a parallel‐aisle warehouse comprising b$$ b $$ blocks, the b$$ b $$‐SPRP‐SS asks for the determination of a picker tour that minimizes travel distance while collecting all articles from a given pick list.
Stefan Irnich, Laura Lüke
wiley   +1 more source

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

Management 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, Nima Ghasemi, Emran Mohammadi   +2 more
doaj   +1 more source