English
Related papers

Related papers: An Exact Method for the Daily Package Shipment Pro…

200 papers

We study the shipper-side design of large-scale inbound transportation networks, motivated by the global supply chain of the carmaker Renault. We formalize the Shipper Transportation Planning Problem (STPP), which integrates discrete flow…

Optimization and Control · Mathematics 2026-04-03 Mathis Brichet , Maximilian Schiffer , Axel Parmentier

In this article, we present a novel formulation for the load-dependent traveling salesman problem (LD-TSP), in which travel cost (or energy expended) depends on the vehicle's current load. This problem is relevant for package delivery and…

Optimization and Control · Mathematics 2026-05-08 Deepak Prakash Kumar , Saurabh Belgaonkar , Sivakumar Rathinam , Swaroop Darbha , David W. Casbeer

This paper introduces the Trailer Path Optimization with Schedule Services Problem (TPOSSP) and proposes a column-generation heuristic (CG-heuristic) to find high-quality solutions to large-scale instances. The TPOSSP aims at determining…

Optimization and Control · Mathematics 2025-07-29 Mohammed Faisal Ahmed , Pascal Van Hentenryck , Ahmed El Nashar

Disruptions in the operational flow of rail traffic can lead to conflicts between train movements, such that a scheduled timetable can no longer be realised. This is where dispatching is applied, existing conflicts are resolved and a…

Optimization and Control · Mathematics 2025-02-26 Maik Schälicke , Karl Nachtigall

The Traveling Thief Problem (TTP) is a multi-component optimization problem that captures the interplay between routing and packing decisions by combining the classical Traveling Salesperson Problem (TSP) and the Knapsack Problem (KP). The…

Data Structures and Algorithms · Computer Science 2026-04-22 Jan Eube , Kelin Luo , Aneta Neumann , Frank Neumann , Heiko Röglin

We consider multi-agent transport task problems where, e.g. in a factory setting, items have to be delivered from a given start to a goal pose while the delivering robots need to avoid collisions with each other on the floor. We introduce a…

Robotics · Computer Science 2020-02-07 Christian Henkel , Jannik Abbenseth , Marc Toussaint

This paper introduces the Packing While Traveling problem as a new non-linear knapsack problem. Given are a set of cities that have a set of items of distinct profits and weights and a vehicle that may collect the items when visiting all…

Data Structures and Algorithms · Computer Science 2017-03-22 Sergey Polyakovskiy , Frank Neumann

Supply chain transportation operations often account for a large proportion of product total cost to market. Such operations can be optimized by solving the Logistics Service Network Design Problem (LSNDP), wherein a logistics service…

Robotics · Computer Science 2020-10-01 Simon Belieres , Mike Hewitt , Nicolas Jozefowiez , Frédéric Semet

Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel…

Data Structures and Algorithms · Computer Science 2015-04-16 Sergey Polyakovskiy , Frank Neumann

The bin packing problem exists widely in real logistic scenarios (e.g., packing pipeline, express delivery), with its goal to improve the packing efficiency and reduce the transportation cost. In this NP-hard combinatorial optimization…

Artificial Intelligence · Computer Science 2022-02-28 Jiahui Duan , Xialiang Tong , Fei Ni , Zhenan He , Lei Chen , Mingxuan Yuan

The Double Travelling Salesman Problem with Multiple Stacks, DTSPMS, deals with the collect and delivery of n commodities in two distinct cities, where the pickup and the delivery tours are related by LIFO constraints. During the pickup…

Discrete Mathematics · Computer Science 2020-10-02 Laurent Alfandari , Sophie Toulouse

The load planning problem is a critical challenge in service network design for parcel carriers: it decides how many trailers to assign for dispatch over time between pairs of terminals. Another key challenge is to determine a flow plan,…

Artificial Intelligence · Computer Science 2024-04-30 Ritesh Ojha , Wenbo Chen , Hanyu Zhang , Reem Khir , Alan Erera , Pascal Van Hentenryck

We address a new prize-collecting problem of routing commodities in a given network with hub and non-hub nodes, in which the service of the non-hub nodes will be outsourced to third-party carriers. The problem is modeled as a Stackelberg…

Optimization and Control · Mathematics 2025-10-22 Elena Fernandez , Ivana Ljubic , Nicolas Zerega

Motivated by distribution problems arising in the supply chain of Haleon, we investigate a discrete optimization problem that we call the "container delivery scheduling problem". The problem models a supplier dispatching ordered products…

Optimization and Control · Mathematics 2023-07-03 Anna Collins , Dimitrios Letsios , Gueorgui Mihaylov

Balanced order batching problem (BOBP) arises from the process of warehouse picking in Cainiao, the largest logistics platform in China. Batching orders together in the picking process to form a single picking route, reduces travel…

Machine Learning · Computer Science 2020-08-21 Lu Duan , Haoyuan Hu , Zili Wu , Guozheng Li , Xinhang Zhang , Yu Gong , Yinghui Xu

In this paper, we study a courier dispatching problem (CDP) raised from an online pickup-service platform of Alibaba. The CDP aims to assign a set of couriers to serve pickup requests with stochastic spatial and temporal arrival rate among…

Artificial Intelligence · Computer Science 2019-03-08 Yujie Chen , Yu Qian , Yichen Yao , Zili Wu , Rongqi Li , Yinzhi Zhou , Haoyuan Hu , Yinghui Xu

The Dynamic Pickup and Delivery Problem (DPDP) is aimed at dynamically scheduling vehicles among multiple sites in order to minimize the cost when delivery orders are not known a priori. Although DPDP plays an important role in modern…

Artificial Intelligence · Computer Science 2021-05-28 Xijun Li , Weilin Luo , Mingxuan Yuan , Jun Wang , Jiawen Lu , Jie Wang , Jinhu Lu , Jia Zeng

Companies like Amazon and UPS are heavily invested in last-mile delivery problems. Optimizing last-delivery operations not only creates tremendous cost savings for these companies but also generate broader societal and environmental…

Applications · Statistics 2024-10-24 Nicholas Rios , Jie Xu

In warehouse logistics, parcels released from the outfeed of an automated storage system must be routed through conveyor networks to workstations. Beyond collision avoidance, practical operations impose an additional requirement of…

Multiagent Systems · Computer Science 2026-05-14 Takuro Kato , Keisuke Okumura

Due to a substantial growth in the world waterborne trade volumes and drastic changes in the global climate accounted for CO2 emissions, the shipping companies need to escalate their operational and energy efficiency. Therefore, a…

Optimization and Control · Mathematics 2023-07-24 Jasashwi Mandal , Adrijit Goswami , Lakshman Thakur , Manoj Kumar Tiwari
‹ Prev 1 2 3 10 Next ›