Optimizing multi-supplier multi-item joint replenishment problem for non-instantaneous deteriorating items with quantity discounts.

This paper deals with a new joint replenishment problem, in which a number of non-instantaneous deteriorating items are replenished from several suppliers under different quantity discounts schemes. Involving both joint replenishment decisions and supplier selection decisions makes the problem to be...

Full description

Bibliographic Details
Main Authors: Xueyi Ai, Yi Yue, Haoxuan Xu, Xudong Deng
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2021-01-01
Series:PLoS ONE
Online Access:https://doi.org/10.1371/journal.pone.0246035
id doaj-f02c28b271f14663be8589be203daee7
record_format Article
spelling doaj-f02c28b271f14663be8589be203daee72021-07-28T04:31:17ZengPublic Library of Science (PLoS)PLoS ONE1932-62032021-01-01162e024603510.1371/journal.pone.0246035Optimizing multi-supplier multi-item joint replenishment problem for non-instantaneous deteriorating items with quantity discounts.Xueyi AiYi YueHaoxuan XuXudong DengThis paper deals with a new joint replenishment problem, in which a number of non-instantaneous deteriorating items are replenished from several suppliers under different quantity discounts schemes. Involving both joint replenishment decisions and supplier selection decisions makes the problem to be NP-hard. In particular, the consideration of non-instantaneous deterioration makes it more challenging to handle. We first construct a mathematical model integrated with a supplier selection system and a joint replenishment program for non-instantaneous deteriorating items to formulate the problem. Then we develop a novel swarm intelligence optimization algorithm, the Improved Moth-flame Optimization (IMFO) algorithm, to solve the proposed model. The results of several numerical experiments analyses reveal that the IMFO algorithm is an effective algorithm for solving the proposed model in terms of solution quality and searching stableness. Finally, we conduct extensive experiments to further investigate the performance of the proposed model.https://doi.org/10.1371/journal.pone.0246035
collection DOAJ
language English
format Article
sources DOAJ
author Xueyi Ai
Yi Yue
Haoxuan Xu
Xudong Deng
spellingShingle Xueyi Ai
Yi Yue
Haoxuan Xu
Xudong Deng
Optimizing multi-supplier multi-item joint replenishment problem for non-instantaneous deteriorating items with quantity discounts.
PLoS ONE
author_facet Xueyi Ai
Yi Yue
Haoxuan Xu
Xudong Deng
author_sort Xueyi Ai
title Optimizing multi-supplier multi-item joint replenishment problem for non-instantaneous deteriorating items with quantity discounts.
title_short Optimizing multi-supplier multi-item joint replenishment problem for non-instantaneous deteriorating items with quantity discounts.
title_full Optimizing multi-supplier multi-item joint replenishment problem for non-instantaneous deteriorating items with quantity discounts.
title_fullStr Optimizing multi-supplier multi-item joint replenishment problem for non-instantaneous deteriorating items with quantity discounts.
title_full_unstemmed Optimizing multi-supplier multi-item joint replenishment problem for non-instantaneous deteriorating items with quantity discounts.
title_sort optimizing multi-supplier multi-item joint replenishment problem for non-instantaneous deteriorating items with quantity discounts.
publisher Public Library of Science (PLoS)
series PLoS ONE
issn 1932-6203
publishDate 2021-01-01
description This paper deals with a new joint replenishment problem, in which a number of non-instantaneous deteriorating items are replenished from several suppliers under different quantity discounts schemes. Involving both joint replenishment decisions and supplier selection decisions makes the problem to be NP-hard. In particular, the consideration of non-instantaneous deterioration makes it more challenging to handle. We first construct a mathematical model integrated with a supplier selection system and a joint replenishment program for non-instantaneous deteriorating items to formulate the problem. Then we develop a novel swarm intelligence optimization algorithm, the Improved Moth-flame Optimization (IMFO) algorithm, to solve the proposed model. The results of several numerical experiments analyses reveal that the IMFO algorithm is an effective algorithm for solving the proposed model in terms of solution quality and searching stableness. Finally, we conduct extensive experiments to further investigate the performance of the proposed model.
url https://doi.org/10.1371/journal.pone.0246035
work_keys_str_mv AT xueyiai optimizingmultisuppliermultiitemjointreplenishmentproblemfornoninstantaneousdeterioratingitemswithquantitydiscounts
AT yiyue optimizingmultisuppliermultiitemjointreplenishmentproblemfornoninstantaneousdeterioratingitemswithquantitydiscounts
AT haoxuanxu optimizingmultisuppliermultiitemjointreplenishmentproblemfornoninstantaneousdeterioratingitemswithquantitydiscounts
AT xudongdeng optimizingmultisuppliermultiitemjointreplenishmentproblemfornoninstantaneousdeterioratingitemswithquantitydiscounts
_version_ 1721279204842012672