An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection
DOI10.1016/J.INS.2023.119949zbMATH Open1530.90044MaRDI QIDQ6179985FDOQ6179985
Authors: Wenqiang Zou, Jiazhen Zou, Hongyan Sang, Leilei Meng, Quanke Pan 
Publication date: 18 January 2024
Published in: Information Sciences (Search for Journal in Brave)
Recommendations
- Multi-AGV dispatching and routing problem based on a three-stage decomposition method
- AGV scheduling optimization in mixed flexible manufacturing cell
- Scheduling and routing algorithms for AGVs: A survey
- The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach
- AGV scheduling in automated container terminal based on differential evolution algorithm
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Warehousing in the e-commerce era: a survey
- Joint production and transportation scheduling in flexible manufacturing systems
- A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
Cited In (1)
This page was built for publication: An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179985)
