Aug 2026· Logistics· Vol 10, pp. 182· 0 citations· 28 references
Abstract
Background: The allocation of non-divisible inbound deliveries across multiple warehouses requires the simultaneous consideration of capacity constraints, category-specific restrictions, workload balance, and long-term allocation consistency. Methods: This study proposes a hierarchical two-level allocation framework combining strategic category-rotation policies, normalized marginal scoring, and signed historical feedback. The algorithm is executed once per day to generate warehouse assignments for the following operational day. Historical correction is based on a rolling window covering the preceding 30 daily planning periods. Results: The framework was evaluated using daily simulation instances ranging from 100 to 1500 pallets, with an average of approximately 130 lots per pallet. Across all evaluated instances, the complete allocation procedure was completed in less than 5 s on the specified test system. The results indicate balanced warehouse utilization, progressive reductions in category–location imbalance, stable historical correction, and preservation of hard operational constraints. Conclusions: The framework provides an interpretable and computationally efficient approach for next-day inbound allocation. By combining explicit feasibility filtering, strategic policy signals, and a 30-day historical correction mechanism, it supports both short-term operational decisions and longer-term allocation balance.
Overnight rebalancing in dock-based bike-sharing systems requires routing a limited fleet of trucks before user activity begins. This article formulates static rebalancing problem under stochastic demand uncertainty as a bi-objective combinatorial optimization problem that selects truck routes and visited stations. The...
D. Pedroza-Perez, Gabriel Luque, S. Nesmachnow et al.· Journal of combinatorial opt...· 0 citations
The dynamic landscape of shared trucking necessitates optimization models that enhance load assignment to pools, balancing cost efficiency, capacity utilization, and strategic decision-making. This study introduces a mixed-integer linear programming (MILP) framework tailored for load assignment in shared trucking, with...
Xue-Ping Li, Jeremiah Gbadegoye, Hugh R. Medal et al.· IISE Annual Conference &...· 0 citations
This study addresses a single-depot stochastic inventory-routing problem with static inventory control policies and vehicle routing decisions. The model integrates precomputed safety stock values into a mixed-integer linear programming formulation, accounting for customer-specific demand variability and service level r...
Hande Cansın Uzgören· Hacettepe Üniversitesi İktis...· 0 citations
Staff scheduling at a logistics sorting center must reconcile time-varying parcel arrivals, intraday service commitments, heterogeneous within-shift capacity, and monthly roster rules. We propose the Three-Stage Integer-Programming Scheduling Framework (TS-ISF). Stage 1 is an hourly-causal, same-day-clearing baseline i...
Hao Sun, Ling-Zhi Li, Shao-Ming Wang et al.· Mathematics· 0 citations
This paper addresses an integrated multi-period optimization problem that coordinates yard template planning and loading/unloading scheduling for transshipment vessels with heterogeneous visiting cycles. The objective is to minimize container transportation and vessel service costs over a common planning horizon, while...
Yu Liu, Tian-Tian Wang, Hong Ma et al.· Asia-Pacific Journal of Oper...· 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.