Comparisons of sales modes for a fresh product supply chain with freshness-keeping effort
Lei Yang and
Ruihong Tang
Transportation Research Part E: Logistics and Transportation Review, 2019, vol. 125, issue C, 425-448
Abstract:
This paper develops a supplier-retailer fresh product supply chain under three sales modes: retail mode, dual-channel mode, and O2O (Online-to-Offline) mode. For each mode, the optimal pricing and freshness-keeping decisions are investigated. It is shown that, in decentralized systems, the dual-channel mode could outperform the O2O mode for the supplier, while the retailer prefers O2O mode to retail mode and dual-channel mode. Under coordination, the O2O mode brings the highest supply chain profit; for consumer surplus, the dual-channel mode is not always better than the retail mode, but is always inferior to the O2O mode.
Keywords: Channel selection; Fresh product; Consumer preference; Freshness-keeping effort; Game theory (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (29)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554518308275
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:125:y:2019:i:c:p:425-448
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic
DOI: 10.1016/j.tre.2019.03.020
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().