Niching Genetic Programming for Co-Joint Optimization: A Case Study on Replenishment and Transshipment Policies in Dynamic Multi-Site Inventory Management

This paper proposes a novel niching genetic programming (GP) framework for co-joint optimization, designed to maintain exploration and solution quality in dynamic environments. The framework comprises a multi-tree representation, with separate trees encoding the respective optimization tasks, and incorporates a niching mechanism to preserve diversity and prevent premature convergence. This integrated approach enables comprehensive exploration of the search space and the discovery of effective, synergistic policies. We apply this framework to the joint optimization of replenishment and transshipment policies in dynamic multi-site inventory management, a critical and challenging problem where policy interdependence greatly expands the search space. Traditional methods, including classical GP, struggle to adapt to rapidly changing environments or fail to capture such co-joint dependencies. Experimental results on synthetic and real-world datasets demonstrate the superiority of the proposed framework over state-of-the-art methods, offering a scalable and robust solution for co-joint optimization in dynamic systems.

Authors

Institutions

Publication Details

Journal
Memetic Computing
Published
2025-12-12
DOI
https://doi.org/10.1007/s12293-025-00489-9
Primary Topic
Supply Chain and Inventory Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Niching Genetic Programming for Co-Joint Optimization: A Case Study on Replenishment and Transshipment Policies in Dynamic Multi-Site Inventory Management

Tan Puay Siew, Yew-Soon Ong, Meng Xu, Jinsheng Chen et al.
Memetic Computing
Supply Chain and Inventory Management
article

Niching Genetic Programming for Co-Joint Optimization: A Case Study on Replenishment and Transshipment Policies in Dynamic Multi-Site Inventory Management

Tan Puay Siew, Yew-Soon Ong, Meng Xu, Jinsheng Chen, Joel Tay Wei En, Doan Ngoc Chi Nam
article en

Abstract

This paper proposes a novel niching genetic programming (GP) framework for co-joint optimization, designed to maintain exploration and solution quality in dynamic environments. The framework comprises a multi-tree representation, with separate trees encoding the respective optimization tasks, and incorporates a niching mechanism to preserve diversity and prevent premature convergence. This integrated approach enables comprehensive exploration of the search space and the discovery of effective, synergistic policies. We apply this framework to the joint optimization of replenishment and transshipment policies in dynamic multi-site inventory management, a critical and challenging problem where policy interdependence greatly expands the search space. Traditional methods, including classical GP, struggle to adapt to rapidly changing environments or fail to capture such co-joint dependencies. Experimental results on synthetic and real-world datasets demonstrate the superiority of the proposed framework over state-of-the-art methods, offering a scalable and robust solution for co-joint optimization in dynamic systems.

Memetic ComputingVol. 18(1)
Nanyang Technological University (SG), Singapore Institute of Manufacturing Technology (SG)
Openalex Percentile: Top 43%
Supply Chain and Inventory Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.