Results 151 to 160 of about 9,060 (260)

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

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

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

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

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

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

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

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

Optimizing Household Waste Recycling Centre Network Reorganization in Hampshire

open access: yesNetworks, EarlyView.
ABSTRACT Local councils across the UK are facing sustained financial pressures, and Household Waste Recycling Centres (HWRCs) are being increasingly considered for closure to reduce expenditure. In 2024, Hampshire County Council, which operates the largest HWRC network in the UK, proposed closing either five or twelve existing sites.
Montree Jaidee   +4 more
wiley   +1 more source

A Branch‐and‐Price Algorithm for the Symmetric Electric Traveling Salesman Problem

open access: yesNetworks, EarlyView.
ABSTRACT The Electric Traveling Salesman Problem (ETSP) is a variant of the well‐known TSP in which an electric vehicle must visit a set of customers minimizing the total cost of its route. The vehicle is assumed to be equipped with a battery of limited capacity that may need to be recharged along the route.
Alberto Ceselli   +2 more
wiley   +1 more source

Energy Optimization Models for the Locomotive Assignment Problem

open access: yesNetworks, EarlyView.
ABSTRACT Reducing energy consumption is a key objective in transportation. Using detailed infrastructure data, this study introduces the Green Locomotive Assignment Problem (GLAP) to minimize energy consumption in railway operations by efficiently assigning locomotives to pre‐scheduled trains.
Gislind Baumgartner   +3 more
wiley   +1 more source

A Two‐Stage Optimization Approach for Selecting Electric‐Flight Airports

open access: yesNetworks, EarlyView.
ABSTRACT The decarbonization of short‐haul air transport has gained increasing attention, with electric aircraft emerging as a promising alternative to conventional short‐haul aviation. However, given the substantial investment anticipated for the necessary infrastructure, a strategic and globally coordinated selection of airports is imperative.
Imke Joormann   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy