Related papers: A Hybrid Pricing and Cutting Approach for the Mult…
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…
This work focuses on exact methods for a Simultaneous Vehicle Routing and Crew Scheduling Problem in long-haul transport. Pickup-and-delivery requests with time windows must be fullfiled over a multi-day planning horizon. Unlike some…
We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates…
Recent studies in maritime logistics have introduced a general ship routing problem and a benchmark suite based on real shipping segments, considering pickups and deliveries, cargo selection, ship-dependent starting locations, travel times…
The Flying Sidekick Traveling Salesman Problem (FSTSP) considers a delivery system composed by a truck and a drone. The drone launches from the truck with a single package to deliver to a customer. Each drone must return to the truck to…
This paper introduces a novel theoretical framework and a suite of highly efficient, parallelizable algorithms for solving the large-scale multicommodity flow (MCF) feasibility problem. We reframe the classical constraint-satisfaction…
Recent developments in modular transport vehicles allow deploying multi-purpose vehicles which can alternately transport different kinds of flows. In this study, we propose a novel variant of the pickup and delivery problem, the…
Technologies and lifestyles have been increasingly geared toward consumerism in recent years. Accordingly, it is both the price and the delivery time that matter most to the ultimate customers of commercial enterprises. Consequently, the…
This paper presents an approach to help business decision-makers gain market share by providing competitive tender offers for Full-Truck-Load (FTL) services. In particular, we compare operating a fleet of Full-Charter-Trucks (FCT), using…
Industry 4.0 is a concept that assists companies in developing a modern supply chain (MSC) system when they are faced with a dynamic process. Because Industry 4.0 focuses on mobility and real-time integration, it is a good framework for a…
Less-than-truckload (LTL) shipment is vital in modern freight transportation yet is in dire need of more efficient usage of resources, higher service responsiveness and velocity, lower overall shipping cost across all parties, and better…
We consider a family of Rich Vehicle Routing Problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multiple depots, split deliveries, site dependency, open routes, duration…
This study focuses on relay transport carriers (RTCs) that contract with hub providers to lease hub capacity and employ relay transportation via hubs. It enables long-haul freight shipments to be transported by multiple short-haul drivers…
Branch-price-and-cut is the state-of-the-art exact method for solving many types of vehicle routing problems, and is particularly effective for vehicle routing problems with time windows. A well-known challenge in branch-price-and-cut is…
Large Language Models (LLMs) have achieved remarkable performance in Machine Translation (MT), but deploying them at scale remains prohibitively expensive. A widely adopted remedy is the hybrid system paradigm, which balances cost and…
Less than truckload shipping plays a critical role in modern supply chains by consolidating freight from multiple shippers into shared vehicles. Despite its operational flexibility and potential sustainability benefits, the LTL sector faces…
Autonomous mobile robots enable increased flexibility of manufacturing systems. The design and operating strategy of such a fleet of robots requires careful consideration of both fixed and operational costs. In this paper, a Monte-Carlo…
We look at the problem of choosing a fleet of vehicles to carry out delivery tasks across a very long time horizon -- up to one year. The delivery quantities may vary markedly day to day and season to season, and the the underlying routing…
This paper presents a new branch-and-cut algorithm based on infeasible path elimination for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) with different loading problem variants. We show that a previously…
The Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem with wide-ranging applications in logistics, routing, and intelligent systems. Due to its factorial complexity, solving large-scale instances…