A DC programming heuristic applied to the logistics network design problem |
| |
Authors: | Phuong Nga Thanh |
| |
Affiliation: | a École des Mines de Nantes, IRCCyN, 4 rue Alfred Kastler, B.P. 20722, 44307 Nantes Cedex 3, France b IUT de Saint-Nazaire, IRCCyN, 58 rue Michel Ange, B.P. 420, 44606 Saint-Nazaire Cedex, France |
| |
Abstract: | This paper proposes a new heuristic method for the logistics network design and planning problem based on linear relaxation and DC (difference of convex functions) programming. We consider a multi-period, multi-echelon, multi-commodity and multi-product problem defined as a large scale mixed integer linear programming (MILP) model. The method is experimented on data sets of various size. The numerical results validate the efficiency of the heuristic for instances with up to several dozens facilities, 18 products and 270 retailers. |
| |
Keywords: | DC programming Heuristics Mixed integer linear programming Logistics network design |
本文献已被 ScienceDirect 等数据库收录! |
|