Scheduling heterogeneous multi-load AGVs with battery constraints
From MaRDI portal
Publication:2669605
DOI10.1016/j.cor.2021.105517OpenAlexW3194012445MaRDI QIDQ2669605
Tugce Martagan, Dirk van de Sande, Quang-Vinh Dang, Nitish Singh, Ivo J. B. F. Adan
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105517
schedulingmixed integer linear programmingadaptive large neighborhood searchmulti-load automated guided vehicles
Related Items (2)
Does battery management matter? Performance evaluation and operating policies in a self-climbing robotic warehouse ⋮ The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach
Cites Work
- Routing a mixed fleet of electric and conventional vehicles
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- Battery swap station location-routing problem with capacitated electric vehicles
- An adaptive large neighborhood search heuristic for the share-a-ride problem
- A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles
- Scheduling vehicles in automated transportation systems: Algorithms and case study
- Typology and literature review for dial-a-ride problems
- The electric location routing problem with time windows and partial recharging
- Record breaking optimization results using the ruin and recreate principle
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- A review of design and control of automated guided vehicle systems
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- A heuristic approach for a real-world electric vehicle routing problem
- Variable neighborhood search for the dial-a-ride problem
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- Scheduling of machines and automated guided vehicles in FMS using differential evolution
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Solving the Dial-a-Ride problem using genetic algorithms
This page was built for publication: Scheduling heterogeneous multi-load AGVs with battery constraints
