Applying PRG Model to Typical Optimization Algorithm Development in Logistics

摘要：

The problem reduction graph (PRG) is a model for formally describing the reduction processes of combinatorial optimization problems and systematically deriving efficient algorithms for the problems. The paper applies the model for several optimization problems including vehicle loading, vehicle routing, and warehouse location, which are typical problems in the domain of logistics. We work out their problem-solving algorithms by specification transformation and derivation, and show that the model is capable of developing algorithms covering classic design tactics including branch-and-bound, greedy, and dynamic programming.

关键词： problem reduction graph (PRG) combinatorial optimization specification transformation

作者: Yang Wu Haihe Shi

作者单位: College of Information Science & Engineering Central South University Changsha, China College of Computer Information & Engineering Jiangxi Normal University Nanchang, China

会议类型: 国际会议

会议名称: The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

会议地点: 太原

会议语种:英文

页码: 94-98

在线出版日期: 2010-10-22（万方平台首次上网日期，不代表论文的发表时间）