Journal of Computer Applications ›› 2014, Vol. 34 ›› Issue (3): 767-770.DOI: 10.11772/j.issn.1001-9081.2014.03.0767

• Artificial intelligence • Previous Articles     Next Articles

Modeling and solving of resource allocation problem in automatic guided vehicle system

WANG Wenrui,WU Yaohua   

  1. School of Control Science and Engineering, Shandong University, Jinan Shandong 250061, China
  • Received:2013-11-11 Revised:2013-12-19 Online:2014-03-01 Published:2014-04-01
  • Contact: WANG Wenrui

自动导引车系统资源分配问题的建模及求解

王文蕊,吴耀华   

  1. 山东大学 控制科学与工程学院,济南250061
  • 通讯作者: 王文蕊
  • 作者简介:王文蕊(1987-),女,山东临清人,博士研究生,主要研究方向:智能优化、物流系统调度;吴耀华(1963-),男,山东济南人,教授,博士,主要研究方向:物流系统建模与仿真、控制决策。
  • 基金资助:

    山东大学优秀研究生科研创新基金

Abstract:

For the resource allocation problem of automatic guided vehicle system, which was composed by both task assigning and route scheduling, a model based on the automatic in-put and out-put system of warehouse was built, and the algorithm with the framework of Particle Swarm Optimization (PSO) and the process of conflict-free routing was proposed to overcome the shortages of just assigning the tasks in sequence. Firstly, the iteration processes were used to search for the optimal scheme of assigning task. Then, the conflict-free routing was employed to obtain the result of resource allocation. Some constraints were added into the solution evaluation mechanism, such as time window, workload balance and conflict-free routes to ensure that the final scheme was feasible. Through the simulation of an automatic in-put system, the traditional scheduling algorithm and the new algorithm were compared. The proposed algorithm can save 10% of the total travelling distance and its balance of task assigning is better. It means that the proposed solution can improve the efficiency of whole system.

Key words: automatic guided vehicle system, resource allocating, task assigning, conflict-free routing scheduling, particle swarm optimization(PSO)

摘要:

针对自动导引车系统中由任务分派及路径规划共同构成的资源分配问题,基于自动化出入库系统建立模型,提出了一种以粒子群优化(PSO)迭代为框架,并加入无冲突路径规划的优化算法,弥补了以往只按顺序分配任务造成的不足。首先通过粒子群的迭代原理寻找最优任务分派方案;然后通过无冲突的路径规划得到资源分配的结果,同时在解的评价机制中加入了时间窗、工作量均衡及路径无冲突等约束条件,保证方案的可行性。通过模拟自动入库系统,与传统的自动导引车系统调度算法进行了对比,实验结果表明,所提算法在总行驶里程上平均节约了10%左右,且任务分配的均衡性更好,系统的整体效率得到了有效的提升。

关键词: 自动导引车系统, 资源分配, 任务分派, 无冲突路径规划, 粒子群算法

CLC Number: