Results 101 to 110 of about 1,727,456 (275)

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

open access: yesNetworks, 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   +2 more
wiley   +1 more source

A generalized evolutionary metaheuristic (GEM) algorithm for engineering optimization

open access: yesCogent Engineering
Many optimization problems in engineering and industrial design applications can be formulated as optimization problems with highly nonlinear objectives, subject to multiple complex constraints.
Xin-She Yang
doaj   +1 more source

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

open access: yesNetworks, 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   +2 more
wiley   +1 more source

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

open access: yesNetworks, 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

An Exact Algorithm for the Traveling Salesman Problem With Pickup and Delivery Under Time Windows and Ride‐Time Constraints

open access: yesNetworks, EarlyView.
ABSTRACT The Traveling Salesman problem with pickup, delivery, and ride‐time constraints (TSPPD‐RT) requires a depot‐based vehicle to visit multiple known requests. Each request specifies a pickup vertex, corresponding delivery vertex, and maximum travel time between them (ride‐time). The goal is to find a tour that (i) starts and finishes at the depot,
Xinbo Zhang, Roberto Baldacci
wiley   +1 more source

A comprehensive review of metaheuristic algorithms for mobile robot path planning

open access: yesApplied Computer Science
Path planning and optimization are essential topics in robotics because they directly affect the effectiveness and safety of robot navigation. The application of metaheuristic methods and algorithms in the field of robot motion planning has attracted ...
Sheren SADIQ, Araz ABRAHIM, Haval SADEEQ
doaj   +1 more source

Metaheuristic algorithms based Flow Anomaly Detector

open access: yes, 2013
- Increasing throughput of modern high-speed networks needs accurate real-time Intrusion Detection System (IDS). A traditional packet-based Network IDS (NIDS) is time intensive as it inspects all packets.
Zahra Jadidi   +5 more
core   +1 more source

Novel Modeling Approach for Arc Routing Problems

open access: yesNetworks, EarlyView.
ABSTRACT This paper introduces a novel modeling approach for arc routing problems (ARPs) which is easily applied to multiple ARP variants (e.g., capacitated ARPs, multiple depot ARPs, heterogeneous fleets). Our approach tracks the order in which arcs are serviced, rather than explicitly tracking deadheading, and couples the sequence of serviced arcs to
Shuheng Wang, Christos T. Maravelias
wiley   +1 more source

Cluster validity indices for automatic clustering: A comprehensive review

open access: yesHeliyon
The Cluster Validity Index is an integral part of clustering algorithms. It evaluates inter-cluster separation and intra-cluster cohesion of candidate clusters to determine the quality of potential solutions.
Abiodun M. Ikotun   +2 more
doaj   +1 more source

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

open access: yesPest 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   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy