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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Applied intelligence (Dordrecht, Netherlands) Ročník 53; číslo 24; s. 30266 - 30299
Hlavní autori:	Wang, Lin, Pi, Yingying, Peng, Lu, Wang, Sirui, Zhang, Ziqing, Liu, Rui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.12.2023 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!