Jul 2026· International Transactions in Operational Research· 0 citations· 34 references
Abstract
We study an inventory routing problem with time windows (IRPTW). A single supplier serves a set of customers to fulfill their demand throughout a planning horizon. Each customer can be visited only within designated time windows, assuming each customer provides a single delivery time window valid for all periods. We propose a two‐commodity flow formulation for this problem and develop a branch‐price‐and‐cut algorithm to solve it. We test our algorithm on a rich set of benchmark instances with fixed and time‐varying demands and with up to 100 customers. Computational experiments demonstrate the effectiveness of this approach. Within a 2‐hour time limit, it can provide a lower bound for all 492 tested instances. Furthermore, 211 of them are solved to optimality, achieving an average optimality gap of 4.07% for large instances and closing the gap for 11 instances for the first time in the literature.
This article studies the cumulative capacitated vehicle routing problem with time windows (CCVRPTW). The CCVRPTW consists of deciding the routing schedules for a set of homogeneous capacitated vehicles such that the latency, that is, the sum of the service start times at the customers, is minimized and the time windo...
Alan Osorio-Mora, Timo Gschwind· Networks· 0 citations
The scalability of a multi-criteria optimization for the Service Team Transport Scheduling (STTS) problem is investigated, minimizing total travel time, maximum vehicle worktime, and total vehicle engagement time to define scale-aware algorithmic boundaries essential for real-time decision support systems.
Jarosław Rudy, G. Radzki· IEEE Access· 0 citations
This study considers a 1-m-1 hybrid flow shop scheduling problem that simultaneously incorporates four practical constraints: lot streaming, no-wait, blocking, and sequence-dependent setup times. Although each of these characteristics has been studied individually in the literature, their joint consideration in a singl...
Hyejin Park, Minseo Lee, Jinil Han· Systems· 0 citations
A real-time, parallelizable algorithm that assigns and schedules tasks based on their profitability and deadlines, on technician availability, and on skill compatibility, while dynamically adjusting routes and schedules in response to delays or new task requests is provided, preserving service quality under uncertainty...
D. Deplano, C. Seatzu, M. Franceschelli· IEEE Transactions on Automat...· 0 citations
ABSTRACT Last-mile delivery-the final and most critical stage of fulfilling customer orders-is typically the most costly and time-consuming component of the distribution process. Optimizing this stage is therefore essential for improving the overall efficiency and sustainability of logistics operations. This study begi...
José Rodriguez-Melquiades· Pesquisa Operacional· 0 citations
This paper investigates the scheduling and planning problem within a warehouse allocation framework using a combination of Simulated Annealing (SA) algorithm and penalty function approaches. Initially, a one-to-one warehouse allocation scheme is formulated by considering multiple objectives: minimizing costs, maximizin...
Ben Ma, Zhengfengyi Du, Qian Li· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
