Results 131 to 140 of about 12,060 (243)
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 +4 more
wiley +1 more source
Conditional Generative Modeling for Enhanced Credit Risk Management in Supply Chain Finance
Naval Research Logistics (NRL), EarlyView.ABSTRACT The rapid expansion of cross‐border e‐commerce (CBEC) has created significant opportunities for small‐ and medium‐sized sellers, yet financing remains a critical challenge due to their limited credit histories. Third‐party logistics (3PL)‐led supply chain finance (SCF) has emerged as a promising solution, leveraging in‐transit inventory as ...
Qingkai Zhang, L. Jeff Hong, Houmin Yan
wiley +1 more source
Naval Research Logistics (NRL), EarlyView.ABSTRACT We are concerned with the stability of a transferable‐utility cooperative (TU) game. First, the concept of core can be weakened so that the blocking of changes is limited to only those with multilateral backings. This principle of consensual blocking, as well as the traditional core‐defining one of unilateral blocking and one straddling in ...
Jian Yang
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
A Novel Traffic Scheduling Algorithm for Multi-CQF Using Mixed Integer Programming and Variable Neighborhood Search Genetic Algorithm in Time-Sensitive Networking. [PDF]
Sensors (Basel)Wang C, Lin Z, Zhao Y, Hu F, Huan Z.
europepmc +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
Networks, EarlyView.ABSTRACT In response to the increasing volume of parcels, last‐mile delivery innovations are exploring the integration of multiple delivery modes. The most prominent examples are delivery vans that, next to being the base for the delivery tasks of their human drivers, also function as mobile launching platforms for drones or autonomous delivery robots.
Nils Boysen +2 more
wiley +1 more source
Should We Stop Developing Heuristics and Only Rely on Mixed Integer Programming Solvers in Automated Test Assembly? A Rejoinder to van der Linden and Li (2016). [PDF]
Appl Psychol Meas, 2017 Chen PH.
europepmc +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
An Extended Formulation With Valid Inequalities for the Capacitated Steiner Arborescence Problem
Networks, EarlyView.ABSTRACT Given a directed graph, the Capacitated Steiner Arborescence Problem (CSAP) aims to determine the least‐cost connection from the root node to terminal nodes requiring a demand through Steiner nodes coming with a capacity, such that there is a unique path from the root to each terminal. This paper presents a new extended formulation of the CSAP,
Francesco Contu +3 more
wiley +1 more source