کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478782 | 1446150 | 2009 | 10 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder](/preview/png/478782.png)
Two variants of genetic algorithm (GA) for solving the Supply Management Problem with Lower-Bounded Demands (SMPLD) are proposed and experimentally tested. The SMPLD problem consists in planning the shipments from a set of suppliers to a set of customers minimizing the total cost, given lower and upper bounds on shipment sizes, lower-bounded consumption and linear costs for opened deliveries. The first variant of GA uses the standard binary representation of solutions and a new recombination operator based on the mixed integer programming (MIP) techniques. The second GA is based on the permutation representation and a greedy decoder. Our experiments indicate that the GA with MIP-recombination compares favorably to the other GA and to the MIP-solver CPLEX 9.0 in terms of cost of obtained solutions. The GA based on greedy decoder is shown to be the most robust in finding feasible solutions.
Journal: European Journal of Operational Research - Volume 195, Issue 3, 16 June 2009, Pages 770–779