A Hybrid Method for Solving Large-Scale Supply Chain Problems

In: Carlos Cotta and Jano van Hemert ed., Proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization. LNCS, Volume 4446, Springer, April, 2007

Authors

• Steffen Wolf
• Peter Merz

Abstract

The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be opened or shut down during the planning horizon, this problem is in fact a mixed integer problem. Choosing the optimal set of facilities to serve the customer demands is an NP-hard combinatorial optimization problem. We present a hybrid method combining an evolutionary algorithm and LP based solvers for solving large-scale supply chain problems, which takes its power from filtering out infeasible solutions. The EA incorporating these filters is shown to be faster than the MIP solver ILOG CPLEX in most of the considered instances. For the remaining instances it finds feasible solutions much faster than the MIP solver.

Full Text

• Publication: Wolf2007SCEA.pdf

BibTeX

 
@Proceedings{ Wolf2007SCEA, 
   title = { A Hybrid Method for Solving Large-Scale Supply Chain Problems }, 
   author = { Steffen Wolf and Peter Merz },  
   editor = { Carlos Cotta and Jano van Hemert }, 
   booktitle = { Proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization },  
   series = { LNCS }, 
   volume = { 4446 },     
   publisher = { Springer },     
   month = apr, 
   year = 2007, 
} 

---

This publication belongs to the project SupChain.