EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Multi-store collaborative delivery optimization based on Top-K order-split

Yanju Zhang iD, Liping Ou, Jiaxu Liu iD

PLOS ONE · 09.03.2023 · 18 (3) · e0278690

DOI: 10.1371/journal.pone.0278690 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS ONE, online erschienen am 09.03.2023. Verfasst von Yanju Zhang und 2 weiteren Autor:innen. Beteiligte Einrichtung: School of Business Administration, Liaoning Technical University, Huludao, Liaoning, China. Hauptthemen laut MEDLINE: Algorithms, Heuristics. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: the Provincial Department of Education Project of Liaoning.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Regarding the fulfillment optimization of online retail orders, many researchers focus more on warehouse optimization and distribution center optimization. However, under the background of new retailing, traditional retailers carry out online services, forming an order fulfillment model with physical stores as front warehouses. Studies that focus on physical stores and consider both order splitting and store delivery are rare, which cannot meet the order optimization needs of traditional retailers. To this end, this study proposes a new problem called the “Multi-Store Collaborative Delivery Optimization (MCDO)”, in which not only make the order-split plans for stores but also design the order-delivery routes for them, such that the order fulfillment cost is minimized. To solve the problem, a Top-K breadth-first search and a local search are integrated to construct a hybrid heuristic algorithm, named “Top-K Recommendation & Improved Local Search (TKILS)”. This study optimizes the search efficiency of the breadth-first search by controlling the number of sub-orders and improving the initial solution of the local search using a greedy cost function. Then achieve the joint optimization of order-split and order-delivery by improving the local optimization operators. Finally, extensive experiments on synthetic and real datasets validate the effectiveness and applicability of the algorithm this study proposed.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsHeuristics

Autor:innen und Institutionen

  • School of Business Administration, Liaoning Technical University, Huludao, Liaoning, China.
  • Software College, Liaoning Technical University, Huludao, Liaoning, China.

ORCID-Profile: Yanju Zhang, Jiaxu Liu

Förderung

  • the Provincial Department of Education Project of Liaoning

Zitieren

APA

Zhang, Y., Ou, L., & Liu, J. (2023). Multi-store collaborative delivery optimization based on Top-K order-split. PLOS ONE, 18(3), e0278690. https://doi.org/10.1371/journal.pone.0278690

Vancouver

Zhang Y, Ou L, Liu J. Multi-store collaborative delivery optimization based on Top-K order-split. PLOS ONE. 2023;18(3):e0278690. doi:10.1371/journal.pone.0278690

BibTeX
@article{Zhang2023,
  author = {Zhang, Yanju and Ou, Liping and Liu, Jiaxu},
  title = {Multi-store collaborative delivery optimization based on Top-K order-split},
  journal = {PLOS ONE},
  year = {2023},
  volume = {18},
  number = {3},
  pages = {e0278690},
  doi = {10.1371/journal.pone.0278690}
}
Kostenlos starten →