Results 131 to 140 of about 3,544 (214)

Joint power control and user grouping mechanism for efficient uplink non‐orthogonal multiple access‐based 5G communication: Utilising the Lèvy‐flight firefly algorithm

IET Networks, EarlyView., 2023
We utilise a metaheuristic optimisation method, inspired by nature, called the Lévy‐flight firefly algorithm (LFA), to tackle the power regulation and user grouping in the NOMA systems. Abstract The non‐orthogonal multiple access strategies have shown promise to boost fifth generation and sixth generation wireless networks' spectral efficiency and ...
Zaid Albataineh, Khaled F. Hayajneh, Haythem Bany Salameh, Raed Al Athamneh, Yaser Jararweh   +4 more
wiley   +1 more source

Toward Environment-Sensitive Molecular Inference via Mixed Integer Linear Programming

ACS Omega
Jianshen Zhu, Mao Takekida, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu   +5 more
doaj   +1 more source

Reconfigurable Giant Nonreciprocity at Near‐Normal Incidence via Phase‐Change Magneto‐Optical Metagratings

Laser &Photonics Reviews, EarlyView.
A phase‐change magneto‐optical metagrating combines GST switching with InAs guided‐mode resonances to achieve strong nonreciprocal absorption contrast near normal incidence. A static magnetic bias creates direction‐dependent resonant splitting, while GST crystallization quenches and latches the response.
Ye Ming Qing, Yi Shen, Jun Wu, Shunsuke Murai, Zhaogang Dong, Koichi Okamoto   +5 more
wiley   +1 more source

A Novel Two‐Stage Flexible Flow Shop Batch Scheduling Model for Grinding Workshops

Naval Research Logistics (NRL), EarlyView.
ABSTRACT The growing need for data storage in data centers has increased the demand for mechanical hard disks due to their low cost and high reliability. Aluminum substrates are the most popular base plates for mechanical hard disks because of their high hardness and low cost.
Jun Xu, Xuanru Pan, Chao‐Bo Yan, Guo‐Qiang Fan, Zhixin Liu   +4 more
wiley   +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

Leveraging Public Transit for Robotic Deliveries: A Column Generation Approach

Naval Research Logistics (NRL), EarlyView.
ABSTRACT Autonomous mobile robots (AMRs) are small, electric, wheeled vehicles that operate at pedestrian speeds. In the last‐mile delivery service considered in this study, a fleet of AMRs is deployed across multiple recharging depots within a service area, from which they depart to perform point‐to‐point deliveries. We consider an operational setting
Yishay Shapira, Mor Kaspi
wiley   +1 more source

The 2‐D Orthogonal Packing Problem With Multiple Levels of Prioritization: A Spatial Optimization Perspective

Naval Research Logistics (NRL), EarlyView.
ABSTRACT This paper addresses two‐dimensional orthogonal packing within a confined space, integrating bin packing principles with facility layout concepts to address scenarios in which items must not only fit but also be arranged according to spatial priorities.
William K. Kirschenman, H. Sebastian Heese, Michael G. Kay, Russell E. King, Brandon M. McConnell   +4 more
wiley   +1 more source

Investigating Mixed‐Integer Programming Approaches for the p$$ p $$‐α$$ \alpha $$‐Closest‐Center Problem

Networks, EarlyView.
ABSTRACT In this work, we introduce and study the p$$ p $$‐α$$ \alpha $$‐closest‐center problem (pα$$ p\alpha $$CCP), which is a generalization of the p$$ p $$‐second‐center problem, a recently emerged variant of the classical (discrete) p‐center problem.
Elisabeth Gaar, Sara Joosten, Markus Sinnl   +2 more
wiley   +1 more source

Interdiction Models and Heuristics for Graph Propagation

Networks, EarlyView.
ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley   +1 more source

A Chance‐Constrained Model for a Production Routing Problem With Uncertain Availability of Vehicles

Networks, EarlyView.
ABSTRACT The Production Routing Problem (PRP) is a complex integrated problem that allows for the achievement of competitive advantages, such as better management of inventory, reduction in operational costs and lead times, improvement in efficiency and customer service, and better response to market changes.
Alline Zanette, Michel Gendreau, Walter Rei   +2 more
wiley   +1 more source