Results 151 to 160 of about 26,851 (306)

Conditional Generative Modeling for Enhanced Credit Risk Management in Supply Chain Finance

open access: yesNaval 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

Análise comparativa de diferentes metodologias para a solução do problema de comissionamento de unidades de usinas hidrelétricas acopladas em cascata [PDF]

open access: yes, 2015
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia Elétrica, Florianópolis, 2015.No Brasil, o Operador Nacional do Sistema Elétrico (ONS) fornece uma meta de geração de potência ...
Brito, Brunno Henrique
core  

The Weak Core, Partition‐Based Universal Stability, and Their Risk Associations Through A Partial Order

open access: yesNaval 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

open access: yesNaval 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

open access: yesNaval 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

MODELING MOVEMENT OF OBJECTS WITHOUT STOPS IN A NETWORK OF CROSSING ROUTES

open access: yesInformatika, 2018
Modeling of movement of objects without stops in a network of crossing routes is studied. The problem is formulated in terms of disjunctive linear programming, mixed integer linear programming and graph theory.
I. V. Rubanov   +2 more
doaj  

Self‐Service and Home Delivery Combined: Coordinating the Route of a Mobile Parcel Locker With the Delivery Tasks of Its Human Driver

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

A Mixed-Integer Linear Program to Create the Shifts in a Supermarket

open access: yes
The shift design and the personnel scheduling problem is known to be a difficult problem. It is a real-world problem which has lots of applications in the organization of companies. Solutions are usually found by dividing the problem in two steps: first the shifts are created, then the employees are assigned to them by respecting a bunch of constraints.
Gusmeroli, Nicolo, Bettinelli, Andrea
openaire   +2 more sources

Interdiction Models and Heuristics for Graph Propagation

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

Home - About - Disclaimer - Privacy