02-B--Accepted--Atwo-phasemodelbasedDSSfor.pdf

IJCSNS International Journal of Computer Science and Network Security, VOL.6 No.2B, February 2006 6 A two-phase model based DSS for Grain Dispatching and Transportation †,†† †,†† †,†† Haihong Yu , Jigui Sun , Zehai Li †School of Computer Science and Technology, Jilin University, Changchun, 130012 China †† Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education, Jilin University, Changchun, 130012 China Summary Regarding exact approaches, In Ref[1], a mixed The problem of grain dispatching and transportation is a real integer programming model and a dynamic programming vehicle routing problem. This paper presents a two-phase method were proposed, which was applied to a real optimization model for solving the problem. A set of the feasible problem of fuel dispatching in an agribusiness firm where routes is generated in the first phase by means of the multiple deliveries are considered. Both methods are graph-search algorithm. The search tree is pruned according to compared with favorable results for the dynamic approach. the constraints. An integer programming model is designed to select the optimum routes from the set of feasible routes in the However, the problem instances tested range