Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Darrell Joshua Ong

dblp:322/4136 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational finance and economics
inventory management
0.712023
Single-Site Perishable Inventory Management Under Uncertainties: A Deep Reinforcement Learning Approach · IEEE Trans. Knowl. Data Eng. 2023

Methods — techniques the papers use, named apart from their topics

deep reinforcement learning · 1.3competitive ratio analysis · 1.3
YearPublicationVenuePosition
2023 Single-Site Perishable Inventory Management Under Uncertainties: A Deep Reinforcement Learning Approach
abstract
Online lot sizing for perishable materials in an uncertain environment is a fundamental problem for inventory planning and has been studied for several decades. In this article, we study a novel setting of thelotsizing problem, consideringperishable materials,multiple suppliers,uncertain demands and lead time (LS-PMU), which captures the inventory planning task in real life better than existing lot sizing problems. We present theoretical results of the best possible competitive ratio an online algorithm can achieve for the LS-PMU problem. We then develop a reinforcement learning-based algorithm calledRL4LSto intelligently choose the supplier and decide the order quantity in each time period. We conduct extensive experiments on both real and synthetic datasets to verify thatRL4LSoutperforms existing algorithms in terms of effectiveness and efficiency, e.g.,RL4LSimproves the effectiveness by 44% and runs two orders of magnitude faster than the state-of-the-art algorithmIBFA.
Cheng Long 0001, Darrell Joshua Ong, Jie Zhang 0002, Xue-Ming Yuan
IEEE Trans. Knowl. Data Eng.3