Quang Thuan Nguyen, Hoai An Le Thi: "Solving an inventory routing problem in supply chain by DC programming and DCA".

Abstract: Inventory routing problem (IRP) has received growing attention from both researchers and supply chain planners. It can be formulated as a mixed 0-1 nonlinear programming problem that is difficult to solve. We propose a new approach based on DC (Difference of Convex Functions) programming and DCA (DC Algorithm) for solving this challenging problem. Using an exact penalty technique and a decomposition technique, the original problem is transformed into an equivalent DC problem. DCA applied on the resulting problem gives the promising results.

Keywords: DC programming, DCA, Inventory routing problem.

Citation: Quang Thuan Nguyen, Hoai An Le Thi, Solving an inventory routing problem in supply chain by DC programming and DCA, in “Intelligent Information and Database Systems”, Lecture Notes in Artificial Intelligence LNAI 6592pp 432-441, Springer Verlag, 2011.