Time-dependent sequential optimization and possibility assessment method for time-dependent failure possibility-based design optimization

Jiang, Xia; Lü, Zhenzhou; Wang, Lu; Hu, Yinshi

doi:10.1016/j.ast.2021.106492

Cited by 5 publications

(1 citation statement)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[15] Resolving time dependant problems requires very fast optimisation methods, which must find a solution before the task's time expire. [13] [20][29] [31] Time for food delivery is also high priority requirement. For ready to eat food this time can be limited to less than one hour, which requires highly efficient optimisation of time and route.…”

Section: Time Frame Requirementsmentioning

confidence: 99%

Demanded Scale for Modern Numerical Optimisation

Penev

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Modern online services facilitate many aspects of the human life such as goods and food shopping and delivery. The number of requested services is growing fast and at the same time can be seen growth of unattended constraints, unforeseen limitations and accidental events which affect the quality and feasibility of the service. Efficient management of online delivery requires optimisation at appropriate scale. This article discusses examples of online delivery services, which require optimization, points out advantages, and limitations, highlights their scale and the role of numerical methods for reducing the cost and time for delivery. Initial investigation illustrates algorithms capabilities to resolve such tasks and discusses current issues. Experimental results on high dimensional tests and consideration of further work conclude the article.

show abstract

Section: Time Frame Requirementsmentioning

confidence: 99%