OBRUN algorithm for the capacity-constrained joint replenishment and delivery problem with trade credits

This study investigates the joint replenishment and delivery problem taking trade credits the delay in payment permitted by suppliers and capacity-constrained into consideration (CJRD-TC). The CJRD-TC aims to minimize the total system costs by finding a reasonable replenishment and delivery schedule...

Full description

Saved in:

Bibliographic Details
Published in:	Applied intelligence (Dordrecht, Netherlands) Vol. 53; no. 24; pp. 30266 - 30299
Main Authors:	Wang, Lin, Pi, Yingying, Peng, Lu, Wang, Sirui, Zhang, Ziqing, Liu, Rui
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2023 Springer Nature B.V
Subjects:	Adaptive algorithms Artificial Intelligence Computer Science Convergence Delivery scheduling Evolutionary computation Machines Manufacturing Mechanical Engineering Optimization Optimization algorithms Parameter sensitivity Processes Replenishment Runge-Kutta method Sensitivity analysis Trigonometric functions Trade credits Joint replenishment and delivery problem Opposite-based learning RUNge Kutta Algorithm Capacity constrained
ISSN:	0924-669X, 1573-7497
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!