English
Related papers

Related papers: Last-mile Delivery: Optimal Locker Location Under …

200 papers

Floor planning is an important and difficult task in architecture. When planning office buildings, rooms that belong to the same organisational unit should be placed close to each other. This leads to the following NP-hard mathematical…

Computational Geometry · Computer Science 2021-07-13 Jonathan Klawitter , Felix Klesen , Alexander Wolff

We study the assortment optimization problem under general linear constraints, where the customer choice behavior is captured by the Cross-Nested Logit model. In this problem, there is a set of products organized into multiple subsets (or…

Optimization and Control · Mathematics 2023-04-19 Cuong Le , Tien Mai

We study the multinomial logit (MNL) bandit problem, where at each time step, the seller offers an assortment of size at most $K$ from a pool of $N$ items, and the buyer purchases an item from the assortment according to a MNL choice model.…

Machine Learning · Computer Science 2020-11-20 Jiaqi Yang

In this paper, we investigate a supply chain network with a supplier and multiple retailers. The supplier can either take orders from retailers directly, or choose to build a warehouse somewhere in the network to centralize the ordering…

General Economics · Economics 2025-07-15 Jianing Zhi , Xinghua Li , Zidong Chen

Energy consumption is the major contributor associated with large and growing transportation cost in logistics. Optimal vehicle routing approaches can provide solutions to reduce their operating costs and address implications on energy.…

Optimization and Control · Mathematics 2020-01-24 Harshavardhan Desai , Ben Remer , Behdad Chalaki , Liuhui Zhao , Andreas Malikopoulos , Jackeline Rios-Torres

We study the problem of learning the preferences of drivers and planners in the context of last mile delivery. Given a data set containing historical decisions and delivery locations, the goal is to capture the implicit preferences of the…

Artificial Intelligence · Computer Science 2022-01-26 Rocsildes Canoy , Victor Bucarey , Yves Molenbruch , Maxime Mulamba , Jayanta Mandi , Tias Guns

In a robotic mobile fulfillment system, robots bring shelves, called pods, with storage items from the storage area to pick stations. At every pick station there is a person -- the picker -- who takes parts from the pod and packs them into…

Artificial Intelligence · Computer Science 2018-10-15 Ruslan Krenzler , Lin Xie , Hanyi Li

In the paper, we consider the competitive facility location problem with limited choice rule (CFLPLCR), which attempts to open a subset of facilities to maximize the net profit of a newcomer company, requiring customers to patronize only a…

Optimization and Control · Mathematics 2024-06-11 Wei-Kun Chen , Wei-Yang Zhang , Yan-Ru Wang , Shahin Gelareh , Yu-Hong Dai

Motivated by e-commerce, we study the online assortment optimization problem. The seller offers an assortment, i.e. a subset of products, to each arriving customer, who then purchases one or no product from her offered assortment. A…

Machine Learning · Computer Science 2017-04-04 Wang Chi Cheung , David Simchi-Levi

In this paper we present a motion planner for LIMMS, a modular multi-agent, multi-modal package delivery platform. A single LIMMS unit is a robot that can operate as an arm or leg depending on how and what it is attached to, e.g., a…

Robotics · Computer Science 2022-08-02 Xuan Lin , Gabriel Fernandez , Yeting Liu , Taoyuanmin Zhu , Yuki Shirai , Dennis Hong

Drones have attracted growing interest in last-mile delivery due to their potential to significantly reduce costs and enhance operational flexibility, particularly in areas of sparse and uncertain demand where traditional truck delivery…

Optimization and Control · Mathematics 2025-04-08 Linxuan Shi , Zhengtian Xu , Miguel Lejeune , Qi Luo

We consider the following two deterministic inventory optimization problems over a finite planning horizon $T$ with non-stationary demands. (a) Submodular Joint Replenishment Problem: This involves multiple item types and a single retailer…

Data Structures and Algorithms · Computer Science 2015-04-27 Viswanath Nagarajan , Cong Shi

We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is…

Mobile micro-clouds are promising for enabling performance-critical cloud applications. However, one challenge therein is the dynamics at the network edge. In this paper, we study how to place service instances to cope with these dynamics,…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-09-19 Shiqiang Wang , Rahul Urgaonkar , Ting He , Kevin Chan , Murtaza Zafer , Kin K. Leung

Meal delivery services provided by platforms with integrated delivery systems are becoming increasingly popular. This paper adopts a rolling horizon approach to solve the meal delivery routing problem (MDRP). To improve delivery efficiency…

Systems and Control · Electrical Eng. & Systems 2023-05-10 Lejun Zhou , Anke Ye , Simon Hu

This paper studies a practical regional demand continuous multifacility location problems whose main goal is to locate a given number of services and entry points in each region to distribute certain products to the users at minimum…

Optimization and Control · Mathematics 2024-12-31 Víctor Blanco , Ricardo Gázquez , Marina Leal

We consider an assortment optimization problem under the multinomial logit choice model with general covering constraints. In this problem, the seller offers an assortment that should contain a minimum number of products from multiple…

Optimization and Control · Mathematics 2025-10-06 Omar El Housni , Qing Feng , Huseyin Topaloglu

Drone delivery has been a hot topic in the industry in the past few years. However, existing approaches either focus on rural areas or rely on centralized drop-off locations from where the last mile delivery is performed. In this paper we…

Robotics · Computer Science 2018-09-24 Gino Brunner , Bence Szebedy , Simon Tanner , Roger Wattenhofer

We study a class of rearrangement problems under a novel pick-n-swap prehensile manipulation model, in which a robotic manipulator, capable of carrying an item and making item swaps, is tasked to sort items stored in lattices of variable…

Robotics · Computer Science 2023-01-18 Jingjin Yu

We consider the problem of static assortment optimization, where the goal is to find the assortment of size at most $C$ that maximizes revenues. This is a fundamental decision problem in the area of Operations Management. It has been shown…

Methodology · Statistics 2011-08-19 Vivek Farias , Srikanth Jagabathula , Devavrat Shah
‹ Prev 1 3 4 5 6 7 10 Next ›