Networks
Издатель: Wiley · ISSN 00283045 · 15 статей
-
Stochastic Corridor–Time Network Capacity Planning for Low‐Altitude Airspace Systems
ABSTRACT Regulators in China, the United States, and the European Union now provide low‐altitude airspace access as priced, time‐windowed corridor authorizations, booked in advance and forfeited if unused. We ask how much capacity a UAV...
-
On Variants of the Group Steiner Tree Problem: Considering Connected Groups of Vertices or Edges
ABSTRACT The min‐cost group Steiner tree problem ( GSTP ) is a well‐known problem in graph theory, not only being NP‐complete but also not admitting a constant‐factor approximation even under strong restrictions. Given a graph and...
-
The Two‐Echelon Multicommodity Location‐Routing Problem With Stochastic and Correlated Demands
ABSTRACT This study introduces the two‐echelon multicommodity location routing problem with stochastic and correlated demands. We propose a two‐stage stochastic programming formulation, with second‐echelon facilities location and...
-
Novel Modeling Approach for Arc Routing Problems
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...
-
Analysis of Greedy Algorithms for Chromatic Sum Coloring of a Graph
ABSTRACT Sum coloring of a graph is a vertex coloring using positive integers (colors) that minimizes the total sum of the colors assigned to all vertices, where adjacent vertices must have different colors. The chromatic sum is the...
-
An Exact Algorithm for the Traveling Salesman Problem With Pickup and Delivery Under Time Windows and Ride‐Time Constraints
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,...
-
The Maximum τ‐Persistent Bipartition Problem: An Optimization Approach for Intrusion Detection in Heterogeneous In‐Vehicle Networks
ABSTRACT The vulnerability of in‐vehicle communication networks to cyber threats has turned intrusion detection into a core research priority. Analyzing temporal communication patterns offers a powerful solution, given that normal...
- Issue Information
-
Solving the Capacitated Arc Routing Problem Using Logic‐Based Benders Decomposition
ABSTRACT In this paper, we present a new exact algorithm for solving the capacitated arc routing problem using logic‐based benders decomposition. The master problem is formulated based on variables that measure the number of...
-
Branch‐and‐Cut POPMUSIC for the Electric Vehicle Routing Problem With Time Windows
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 Active‐Passive Vehicle Routing Problem With Item Transshipments
ABSTRACT This paper addresses a vehicle routing problem with synchronization constraints, in which pickup‐and‐delivery requests for single items are carried out using two types of vehicles: active and passive. The vehicles operate...
-
Multicommodity Trade Network Equilibrium With Mixed Demand and Food Security
ABSTRACT Rising food insecurity is a pressing global concern. Many developing countries rely on a combination of international trade and food aid to satisfy the nutritional and caloric demands of their populations. Trade openness has...
-
Exact Solution of Picker Routing Problems in Zoned Warehouses With Scattered Storage
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...
-
Algorithmic and Optimization Strategies for Efficient Routing and Resource Management in Advanced Elastic Optical Networks
ABSTRACT In response to the rapidly increasing demand for higher bandwidth and the necessity for more flexible and efficient resource allocation, elastic optical networks have emerged as a promising solution for next‐generation...
-
A Supervised Learning Framework for Accelerating Solvers and Metaheuristics in Routing Problems
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...