Model and algorithm for the location-inventory problem in pallet pooling systems

Abstract

Purpose

This paper studies the location-inventory problem (LIP) in pallet pooling systems to improve resource utilization and save logistics costs, which is a new extension of the classical LIP and also an application of the LIP in pallet pooling systems.

Design/methodology/approach

A mixed-integer linear programming is established, considering the location problem of pallet pooling centers (PPCs) with multi-level capacity, multi-period inventory management and bi-directional logistics. Owing to the computational complexity of the problem, a hybrid genetic algorithm (GA) is then proposed, where three local searching strategies are designed to improve the problem-solving efficiency. Lastly, numerical experiments are carried out to validate the feasibility of the established model and the efficiency of the proposed algorithm.

Findings

The results of numerical experiments show that (1) the proposed model can obtain the integrated optimal solution of the location problem and inventory management, which is better than the two-stage model and the model with single-level capacity; (2) the total cost and network structure are sensitive to the number of PPCs, the unit inventory cost, the proportion of repairable pallets and the fixed transportation cost and (3) the proposed hybrid GA shows good performance in terms of solution quality and computational time.

Originality/value

The established model extends the classical LIP by considering more practical factors, and the proposed algorithm provides support for solving large-scale problems. In addition, this study can also offer valuable decision support for managers in pallet pooling systems.

Citation

Miao, B., Shang, X., Yang, K., Jia, B. and Zhang, G. (2024), "Model and algorithm for the location-inventory problem in pallet pooling systems", Kybernetes, Vol. ahead-of-print No. ahead-of-print. https://doi.org/10.1108/K-03-2024-0695