Constraint Programming Approach for Vehicle Routing of the Industrial Gas Delivery

• Main Authors: Juo-Yi Chang, 張若怡
• Other Authors: Pei-Chun Lin
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/56479308097141090427

碩士 === 國立成功大學 === 交通管理學系碩博士班 === 95 === In the 60s in Taiwan, the export restruction was relaxed by the government and the Small and Medium Enterprises of Taiwan were flourishing to develop industrial operations, so the requirement of industrial gas production in industrial operation was becoming more and more huge. The industrial gas production can’t be obtain from the nature but can be refindment from the air we breath evertday, and the business of refinding the air production is call the Industrial Air Separation Industiry. This study develops a routing and scheduling decision support system that considers both hard and soft constraints of the problem for industrial gas deliveries. Hard constraints are the constraints should be satisfied while soft constraints are the constraints satisfied the more and the better, safer and more efficient distribution solution would be achieving. This study also treated the problem as a Constraint Satisfactory Problem and formulated it into an optimization problem which could help operations management to decide the composition of soft constraints and provide routes and schedule solution in real time. This problem is treating as a constraint satisfaction problem (CSP) and use ILOG Dispatcher, ILOG Solver and ILOG Scheduler to simplify the process and capture the specificities of problem representation. The remaining of this study is arranged as follows. Chapter 2 reviews related literatures on routing industrial-gas deliveries, CSP, VRP, and ILOG. Chapter 3 models an industrial-gas routing and scheduling problem as a Vehicle Routing Problem with Time Windows (VRPTW) and capacity constraints. The solution approach is presented in Chapter 4, and the conclusion and suggestion of future research come in Chapter 5.