Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder

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.

[1]  F. Glover,et al.  Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints , 2005, Ann. Oper. Res..

[2]  Johann Dréo,et al.  Metaheuristics for Hard Optimization: Methods and Case Studies , 2005 .

[3]  Fred W. Glover,et al.  A New Optimization Method for Large Scale Fixed Charge Transportation Problems , 1981, Oper. Res..

[4]  C. Floudas,et al.  Production Scheduling of a Large-Scale Industrial Batch Plant. I. Short-Term and Medium-Term Scheduling , 2006 .

[5]  J. Gottlieb,et al.  Genetic algorithms for the fixed charge transportation problem , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[6]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7]  Anton V. Eremeev,et al.  GENETIC ALGORITHMS FOR SUPPLY MANAGEMENT PROBLEM WITH LOWER-BOUNDED DEMANDS , 2006 .

[9]  C. Reeves.  Graph Partitioning Using Genetic Algorithms , 1996 .

[10]  Minghe Sun,et al.  A tabu search heuristic procedure for the fixed charge transportation problem , 1998, Eur. J. Oper. Res..

[11]  Laurence A. Wolsey,et al.  A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem , 2003, Networks.

[12]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[13]  Jens Gottlieb,et al.  Direct Representation and Variation Operators for the Fixed Charge Transportation Problem , 2002, PPSN.

[14]  Dries R. Goossens,et al.  Exact algorithms for procurement problems under a total quantity discount structure , 2007, Eur. J. Oper. Res..

[15]  Charu C. Aggarwal,et al.  Optimized Crossover for the Independent Set Problem , 1997, Oper. Res..

[16]  Mutsunori Yagiura,et al.  The use of dynamic programming in genetic algorithms for permutation problems , 1996 .

[17]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[18]  Anton V. Eremeev,et al.  On complexity of optimized crossover for binary representations , 2007, Theory of Evolutionary Algorithms.

[19]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[20]  Colin R. Reeves,et al.  Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..

[21]  David S. Johnson,et al.  Dimacs series in discrete mathematics and theoretical computer science , 1996 .

[22]  Jean-Marie Proth,et al.  Production , Manufacturing and Logistics The concave cost supply problem , 2003 .

[23]  Gerhard J. Woeginger,et al.  Approximation of the supply scheduling problem , 2005, Oper. Res. Lett..

[24]  Guy Kortsarz,et al.  The Minimum Shift Design Problem: Theory and Practice , 2003, ESA.

[25]  Zhan De-chen,et al.  Genetic Algorithm for the Transportation Problem with Discontinuous Piecewise Linear Cost Function , 2006 .

[26]  Guy Kortsarz,et al.  The minimum shift design problem , 2007, Ann. Oper. Res..

[27]  A. Kolokolov.  Regular Partitions and Cuts in Integer Programming , 1996 .

[28]  Egon Balas,et al.  Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems , 1998, J. Heuristics.

[29]  Michel Gendreau,et al.  Cooperative Parallel Tabu Search for Capacitated Network Design , 2002, J. Heuristics.