Results 121 to 130 of about 8,018,297 (258)

Branch‐and‐Cut POPMUSIC for the Electric Vehicle Routing Problem With Time Windows

Networks, EarlyView.
ABSTRACT Advancements in computer hardware and commercial software have enabled the use of branch‐and‐cut (BC) methodologies to address medium‐scale vehicle routing problems (VRPs). Despite the introduction of efficient heuristics in the literature, tailoring these approaches to suit various VRP variants, such as the electric vehicle routing problem ...
Lelisa Kebena Bijiga, John Alasdair Warwicker, Steffen Rebennack   +2 more
wiley   +1 more source

A Supervised Learning Framework for Accelerating Solvers and Metaheuristics in Routing Problems

Networks, EarlyView.
ABSTRACT Routing problems such as the traveling salesman problem (TSP) and the capacitated vehicle routing problem (CVRP) are computationally challenging due to the exponential growth of their feasible solution spaces with increasing instance size.
Johannes Gückel, Stefan Voigt, Pirmin Fontaine   +2 more
wiley   +1 more source

Exact Solution of Picker Routing Problems in Zoned Warehouses With Scattered Storage

Networks, EarlyView.
ABSTRACT We present two picker routing problems in a warehouse split into multiple disjoint zones with a picker assigned to each zone. Scattered storage is applied, meaning an article can be stored at several pick positions in one or more zones, and capacity restrictions limit the number of collected articles for each picker.
Laura Lüke
wiley   +1 more source

Automatic insect identification, counting, and monitoring techniques: a review

Pest Management Science, EarlyView.
Automated insect monitoring increasingly integrates optical, acoustic, infrared, radar, electrostatic, and biosensing technologies with artificial intelligence. No single approach is universally optimal; reliable deployment depends on task‐specific validation, representative datasets, robustness under field conditions, energy autonomy, connectivity ...
Mariano González García, Juan Carlos Noguera Polania, Rosana González Combarros, José Ignacio López Sánchez   +3 more
wiley   +1 more source

Real-World Applications of Metaheuristic Algorithms: A Comprehensive Review of the State-of-the-Art

Diyala Journal of Engineering Sciences
Metaheuristic algorithms have gained significant acceptance in large areas of optimization, giving unique and novel solutions to complicated problems across various areas.
Dler O. Hasan, Aso Aladdin
doaj   +1 more source

Effectiveness Assessment of Underwater Area Cruise Based on the ADC Method

Journal of Field Robotics, EarlyView.
ABSTRACT Underwater area surveillance plays a crucial role in upholding national security, safeguarding strategic interests, and mitigating potential threats. Despite its significance, a notable gap persists in the availability of comprehensive models for assessing its effectiveness.
Qingwei Liang, Yuxin Lin, Mingyang Luo, Zhanghong Zeng   +3 more
wiley   +1 more source

M3RS: Multi‐Robot, Multi‐Objective, and Multi‐Mode Routing and Scheduling

Journal of Field Robotics, EarlyView.
ABSTRACT Task execution quality significantly impacts multi‐robot missions, yet existing task allocation frameworks rarely consider quality of service as a decision variable, despite its importance in applications like robotic disinfection and cleaning. We introduce the multi‐robot, multi‐objective, and multi‐mode routing and scheduling (M3RS) problem,
Ishaan Mehta, Junseo Kim, Sharareh Taghipour, Sajad Saeedi   +3 more
wiley   +1 more source

A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem

Discrete Dynamics in Nature and Society, 2015
The Just-In-Time (JIT) scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives.
Sivashan Chetty, Aderemi O. Adewumi
doaj   +1 more source

Pengembangan Algoritma Hybrid Metaheuristik Untuk Penentuan Rute Pengiriman Produk Perishable

Jurnal Teknik Industri, 2017
The decision to dispatch consumers demand has become a strategic and tactical consideration to be solved in an integrated manner. In this study, the problem of determining routing problem take case study of delivery of perishable product.
Luki Trihardani, Oki Anita Candra Dewi
doaj   +1 more source

A hybrid metaheuristic for the longest common subsequence problem

, 2010
The longest common subsequence problem is a classical string problem. It has applications, for example, in pattern recognition and bioinformatics. This contribution proposes an integrative hybrid metaheuristic for this problem.
Manuel Lozano, Blum, Christian, Christian Blum, Lozano, Manuel   +3 more
core   +1 more source