Routing optimization on power packet dispatching system based on energy loss minimization

On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand

On-demand delivery has become increasingly popular around the world. Motivated by a large grocery chain store who offers fast on-demand delivery services, we model and solve a stochastic dynamic driver dispatching and routing problem for last-mile delivery systems where on-time performance is the main target. The system operator needs to dispatch a set of drivers and specify their delivery routes facing random demand that arrives over a fixed number of periods. The resulting stochastic dynamic program is challenging to solve due to the curse of dimensionality. We propose a novel structured app…

Convergence of a Packet Routing Model to Flows Over Time

The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite very vital research activities on models in both categories, the connection between these approaches was poorly understood so far. In this work we build this connection by specifying a (competitive) packet routing model, which is discrete in terms of flow and time, and by proving its convergence to the intensively studied model of flows over time with deterministic queuing. More precisely, we prove that the limit of th…

Age of Information in a Decentralized Network of Parallel Queues with Routing and Packets Losses

The paper deals with Age of Information (AoI) in a network of multiple sources and parallel queues with buffering capabilities, preemption in service and losses in served packets. The queues do not communicate between each other and the packets are dispatched through the queues according to a predefined probabilistic routing. By making use of the Stochastic Hybrid System (SHS) method, we provide a derivation of the average AoI of a system of two parallel queues (with and without buffer capabilities) and compare the results with those of a single queue. We show that known results of packets del…

无线网络中控制器和路由冗余的协同设计

Co-design of controller and routing redundancy over a wireless network

在本文中，我们探讨利用冗余时，驱动数据路由到一个离散时间LTI系统连接到控制器通过无线网络受丢包的影响。我们假设致动数据包可以经由多个路径从控制器递送到致动器，每个路径与延迟和数据包损失率相关联。我们发现，控制器增益和路由冗余开发的联合设计可以大大提高控制性能。为了实现这一目标，我们建立和解决一类系统的LQR问题，扩展离散时间马尔可夫跳线性系，在连续和离散控制信号都可以被激活。

Benes分组网

A Benes Packet Network

Benes网络由简单的交换模块构成，具有许多优点，包括延迟小，只需要几乎线性数量的交换模块。作为电路交换机，Benes网络是无阻塞的，这意味着它们作为分组交换机是全吞吐量的，具有合适的路由。Benes网络中的路由可以通过分时排列来完成。然而，这种方法需要交换模块的集中控制和业务到达的统计知识。我们提出了一个基于背压的路由方案的Benes网络，结合端到端的拥塞控制。这种方法实现了网络的最大效用，并且每个模块只需要四个队列，与网络的大小无关。

动态调度波问题的一种迭代样本场景方法

An iterative sample scenario approach for the dynamic dispatch waves problem

针对动态调度波问题中配送请求动态揭示导致的调度权衡挑战，提出基于样本场景的迭代条件调度（ICD）方法，通过迭代分类请求并开发阈值与相似度两种变体，高效求解并达到近似机器学习策略的优异性能。