相关论文: Exact results for the order picking time distribut…

We study an optimal-control problem of polling systems with large switchover times, when a holding cost is incurred on the queues. In particular, we consider a stochastic network with a single server that switches between several buffers…

Efficient truck platooning is a key strategy for reducing freight costs, lowering fuel consumption, and mitigating emissions. Deadlines are critical in this context, as trucks must depart within specific time windows to meet delivery…

In this paper we prove two results. First we show that dynamical systems with a $\phi$-mixing measure have in the limit Poisson distributed return times almost everywhere. We use the Chen-Stein method to also obtain rates of convergence.…

We study a dispatching and pricing problem in two-sided spatial queues with fixed supply, motivated by ride-hailing and robotaxi platforms. Idle drivers queue on one side, waiting to pick up riders, while riders queue on the other, waiting…

A fractal mobile-immobile (MIM in short) solute transport model in porous media is set forth, and an inverse problem of determining the fractional orders by the additional measurements at one interior point is investigated by Laplace…

In pursuit of a more sustainable and cost-efficient last mile, parcel lockers have gained a firm foothold in the parcel delivery landscape. To fully exploit their potential and simultaneously ensure customer satisfaction, successful…

We consider a Lindley process with Laplace distributed space increments. We obtain closed form recursive expressions for the density function of the position of the process and for its first exit time distribution from the domain $[0,h]$.…

In this paper we investigate a problem associated with operating a robotic mobile fulfilment system (RMFS). This is the problem of allocating orders and mobile storage racks to pickers. We present a two-stage formulation of the problem. In…

This paper considers the dispatching of large-scale real-time ride-sharing systems to address congestion issues faced by many cities. The goal is to serve all customers (service guarantees) with a small number of vehicles while minimizing…

We study routing for on-demand last-mile logistics with two crucial novel features: i) Multiple depots, optimizing where to pick-up every order, ii) Allowing vehicles to perform depot returns prior to being empty, thus adapting their routes…

We study non-stationary single-item, periodic-review inventory control problems in which the demand distribution is unknown and may change over time. We analyze how demand non-stationarity affects learning performance across inventory…

Random trajectories of single particles in living cells contain information about the interaction between particles, as well as, with the cellular environment. However, precise consideration of the underlying stochastic properties, beyond…

We study the motion of a one-dimensional particle which reverses its direction of acceleration stochastically. We focus on two contrasting scenarios, where the waiting-times between two consecutive acceleration reversals are drawn from (i)…

Many real-world prediction tasks have outcome variables that have characteristic heavy-tail distributions. Examples include copies of books sold, auction prices of art pieces, demand for commodities in warehouses, etc. By learning…

We introduce a persistent random walk model for the stochastic transport of particles involving self-reinforcement and a rest state with Mittag-Leffler distributed residence times. The model involves a system of hyperbolic partial…

Robotic bin packing is widely deployed in warehouse automation, with current systems achieving robust performance through heuristic and learning-based strategies. These systems must balance compact placement with rapid execution, where…

We discuss a single-server multi-station alternating queue where the preparation times and the service times are auto- and cross-correlated. We examine two cases. In the first case, preparation and service times depend on a common discrete…

Bin packing is an algorithmic problem that arises in diverse applications such as remnant inventory systems, shipping logistics, and appointment scheduling. In its simplest variant, a sequence of $T$ items (e.g., orders for raw material,…

Different retail and e-commerce companies are facing the challenge of assembling large numbers of time-critical picking orders that include both small-line and multi-line orders. To reduce unproductive picker working time as in traditional…

We investigate a location-allocation-routing problem where trucks deliver goods from a central production facility to a set of warehouses with fixed locations and known demands. Due to limited capacities congestion occurs and results in…