EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3682. An AGV scheduling problem based on partial charging policy
Invited abstract in session WA-56: Advancing mobility towards sustainable solutions III, stream Transportation.
Wednesday, 8:30-10:00Room: S04 (building: 101)
Authors (first author is the speaker)
1. | Wei Wang
|
Southeast University | |
2. | Hui Sun
|
Industrial Engineering, Southeast University |
Abstract
This paper studies a scheduling problem for automated guided vehicles (AGVs), in which a fleet of homogeneous AGVs are used to deliver parts to workstations in a shop floor environment. During delivery the batteries of AGVs can be recharged, in order to ensure all parts are transferred from a central warehouse to their respective destinations without stops. A partial charging policy, which allows to flexibly manage the charging operations for AGVs, is employed. The transportation tasks undertaken by each AGV and the charging operations on each AGV need to be scheduled. The objective is to minimize the makespan to complete all transportation tasks. A mixed integer programming model is presented to describe the AGV scheduling problem. A two-stage heuristic approach is proposed for problem-solving. For stage one, two metaheuristics, i.e., a genetic algorithm (GA) and a hybrid GA and whale optimization algorithm (WOA), are developed to assign transportation tasks to each AGV. For stage two, a rule-based heuristic is proposed to schedule the assigned transportation tasks and charging operations for each AGV. Computation experiments show that the proposed solution procedures can solve the scheduling problem effectively and efficiently.
Keywords
- Scheduling
- Programming, Mixed-Integer
- Metaheuristics
Status: accepted
Back to the list of papers