Personalized Dynamic Pricing Strategies for Perishable Products: A Contextual Bandit Algorithm Approach

ABSTRACT: In fast-moving retail environments, pricing perishable items effectively is a complex task due to short shelf lives, variable demand, and inventory fluctuations. Dynamic pricing optimization is the part of supply chain management, allowing businesses to improve sales, reduce waste, and optimize inventory levels. This study applies contextual bandit algorithms: Thompson Sampling and LinUCB to develop adaptive pricing strategies that respond to customer behaviour and product perishability in real time. Using a cleaned grocery retail dataset, a simulation environment was created with engineered features including customer segments, days to expiry, and inventory levels. Five pricing strategies were evaluated: Thompson Sampling, LinUCB, Fixed Pricing, Random Pricing, and Greedy Pricing. Performance was assessed using cumulative reward, regret, sell-through rate, and conversion rates across segments. Thompson Sampling achieved the best results, with a cumulative reward of 77.4% and the lowest cumulative regret, demonstrating best adaptability and effective model. The results indicate that learning-based models significantly outperform static approaches and are well-suited for dynamic pricing of perishable goods in modern retail.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-06-30
DOI
https://doi.org/10.5281/zenodo.15774197
Primary Topic
Telomeres, Telomerase, and Senescence
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Personalized Dynamic Pricing Strategies for Perishable Products: A Contextual Bandit Algorithm Approach

Zenodo (CERN European Organization for Nuclear Research)
Telomeres, Telomerase, and Senescence
article

Personalized Dynamic Pricing Strategies for Perishable Products: A Contextual Bandit Algorithm Approach

article en

Abstract

ABSTRACT: In fast-moving retail environments, pricing perishable items effectively is a complex task due to short shelf lives, variable demand, and inventory fluctuations. Dynamic pricing optimization is the part of supply chain management, allowing businesses to improve sales, reduce waste, and optimize inventory levels. This study applies contextual bandit algorithms: Thompson Sampling and LinUCB to develop adaptive pricing strategies that respond to customer behaviour and product perishability in real time. Using a cleaned grocery retail dataset, a simulation environment was created with engineered features including customer segments, days to expiry, and inventory levels. Five pricing strategies were evaluated: Thompson Sampling, LinUCB, Fixed Pricing, Random Pricing, and Greedy Pricing. Performance was assessed using cumulative reward, regret, sell-through rate, and conversion rates across segments. Thompson Sampling achieved the best results, with a cumulative reward of 77.4% and the lowest cumulative regret, demonstrating best adaptability and effective model. The results indicate that learning-based models significantly outperform static approaches and are well-suited for dynamic pricing of perishable goods in modern retail.

Zenodo (CERN European Organization for Nuclear Research)
Industry, innovation and infrastructure
Openalex Percentile: Top 45%
Telomeres, Telomerase, and Senescence
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.