A New Algorithm Makes It Faster to Find the Shortest Paths

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...
IEEE

A Learning-Based Two-Stage Multi-Thread Iterated Greedy Algorithm for Co-Scheduling of Distributed Factories and Automated Guided Vehicles With Sequence-Dependent Setup Times

Abstract: Automated guided vehicles are widely utilized in the real production environment for tasks such as job transfer and inter-factory collaboration, yet they remain relatively underexplored in ...
IEEE

A Feature-Based Learning Differential Evolution Algorithm for the Flexible Job-Shop Scheduling With Occupational Repetitive Actions Index

Abstract: Learning differential evolution (DE) algorithms are widely adopted to address flexible job-shop scheduling problems (FJSPs) because of the optimization ability. However, traditional learning ...