A discrete moth-flame optimization algorithm for multiple automated guided vehicles scheduling problem in a matrix manufacturing workshop
Authors:
- Junhai ZengJZJunhai Zeng
- Wei XieWXWei Xie
- Mi PanMPMi Pan
- 13 June 2024
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 163
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- RETRACTED ARTICLE: Two-echelon electric vehicle routing problem with a developed moth-flame meta-heuristic algorithmOperations Management Research, 2022
- Using differential evolution and Moth–Flame optimization for scientific workflow scheduling in fog computingApplied Soft Computing, 2021
- An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshopApplied Soft Computing, 2021
- A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraintsApplied Soft Computing, 2019
- An integrated scheduling method for AGV routing in automated container terminalsComputers & Industrial Engineering, 2018
- Tasks assigning and sequencing of multiple AGVs based on an improved harmony search algorithmJournal of Ambient Intelligence and Humanized Computing, 2018
- Capacitated and multiple cross-docked vehicle routing problem with pickup, delivery, and time windowsComputers & Industrial Engineering, 2018
- A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problemsJournal of Heuristics, 2017
- Some extensions to the sweep algorithmThe International Journal of Advanced Manufacturing Technology, 2011
- The vehicle routing problem: A taxonomic reviewComputers & Industrial Engineering, 2009