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

European Journal of Operational Research

Volumn 195, Issue 3, 2009, Pages 770-779

  Borisovsky, P ^a   Dolgui, A ^b   Eremeev, A ^c  

^a OMSK STATE TECHNICAL UNIVERSITY   (Russian Federation)

^b ECOLE DES MINES DE SAINT ETIENNE   (France)

^c SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Genetic algorithms; Integer programming; Recombination operators; Supply chain management

Indexed keywords

ALGORITHMS; COMPETITION; DECODING; DIESEL ENGINES; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; INTEGER PROGRAMMING; MATHEMATICAL OPERATORS; PLASMA WAVES; SUPPLY CHAIN MANAGEMENT; SUPPLY CHAINS;

BINARY REPRESENTATIONS; FEASIBLE SOLUTIONS; LOWER AND UPPER BOUNDS; MIXED INTEGER PROGRAMMINGS; PERMUTATION REPRESENTATIONS; RECOMBINATION OPERATORS; SET OF CUSTOMERS; SUPPLY MANAGEMENT PROBLEMS; TOTAL COSTS;

PROBLEM SOLVING;

EID: 56349120808     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.06.060     Document Type: Article

References (31)

1. Aggarwal C., Orlin J., and Tai R. An optimized crossover for maximum independent set. Operations Research 45 (1997) 225-234
2. Balas E., and Niehaus W. Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. Journal of Heuristics 4 2 (1998) 107-122
3. Barr R., Glover R., and Klingman D. A new optimization method for large scale fixed charge transportation problems. Operations Research 29 3 (1981) 448-463
4. Borisovsky, P., 2004. Genetic algorithms for a supply management problem. In: Proceedings of the International Conferences on Systems, Mechanisms and Machines Dynamics. OmGTU, Omsk, Russia, pp. 255-258 (in Russian).
5. Borisovsky P., Dolgui A., and Eremeev A. Genetic algorithms for supply management problem with lower-bounded demands. In: Dolgui A., Morel G., and Pereira C. (Eds). Information Control Problems in Manufacturing 2006: A Proceedings volume from the 12th IFAC International Symposium vol. 3 (2006), Elsevier Science, St. Etienne, France 521-526 17-19 May 2006
6. Chauhan S., and Proth J.-M. The concave cost supply problem. European Journal of Operational Research 148 2 (2003) 374-383
7. Chauhan, S., Eremeev, A., Romanova, A., Servakh, V., 2004. Approximation of linear cost supply management problem with lower-bounded demands. In: Proceedings of Discrete Optimization Methods in Production and Logistics (DOM'2004). Nasledie Dialog-Sibir, Omsk, Russia, pp. 16-21.
8. Chauhan S., Eremeev A., Kolokolov A., and Servakh V. Concave cost supply management problem for single manufacturing unit. In: Dolgui A., Soldek J., and Zaikin O. (Eds). Supply Chain Optimisation. Product/Process Design, Facility Location and Flow Control (2005), Springer Verlag 167-174
9. Chauhan S., Eremeev A., Romanova A., Servakh V., and Woeginger G. Approximation of the supply scheduling problem. Operations Research Letters 33 3 (2005) 249-254
10. Crainic T., and Gendreau M. Cooperative parallel tabu search for capacitated network design. Journal of Heuristics 8 (2002) 601-627
11. Danna E., Rothberd E., and Pape C.L. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming, Series A 102 (2005) 71-90
12. De Jong, K.A., 1975. An analysis of the behaviour of a class of genetic adaptive systems. University of Michigan, Ann Arbor, MI, doctoral dissertation.
13. Dréo J., Petrowski A., Siarry P., and Taillard E. Metaheuristics for Hard Optimization: Methods and Case Studies (2006), Springer
14. Eckert C., and Gottlieb J. Direct representation and variation operators for the fixed charge transportation problem. Proceedings of Parallel Problem Solving from Nature - PPSN VII, Seventh International Conference. LNCS vol. 2439 (2002), Springer Verlag 77-87
15. Eremeev, A., 2007. On complexity of optimized crossover for binary representations. Omsk Branch of Sobolev Institute of Mathematics, technical report. .
16. Eremeev A., Romanova A., Servakh V., and Chauhan S. Approximate solution of supply management problem. Journal of Applied and Industrial Mathematics 1 4 (2007) 433-441
17. Gaspero L.D., Gärtner J., Kortsarz G., Musliu N., Schaerf A., and Slany W. The minimum shift design problem: Theory and practice. Annals of Operations Research 155 1 (2007) 79-105
18. Glover F., and Sherali H. Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints. Annals of Operations Research 140 1 (2005) 215-233
19. Glover F., Laguna M., and Marti R. Fundamentals of scatter search and path relinking. Control and Cybernetics 29 3 (2000) 653-684
20. Goossens D., Maas A., Spieksma F., and van de Klundert J. Exact algorithms for procurement problems under a total quantity discount structure. European Journal of Operational Research 178 2 (2007) 603-626
21. Gottlieb J., and Paulmann L. Genetic algorithms for the fixed charge transportation problem. Proceedings of the Fifth IEEE International Conference on Evolutionary Computation (1998), IEEE Press 330-335
22. Höhn C., and Reeves C. Graph partitioning using genetic algorithms. Proceedings of the Second International Conference on Massively Parallel Computing Systems (1996), IEEE Computer Society Press 31-38
23. Holland J. Adaptation in Natural and Artificial Systems (1975), University of Michigan Press
24. Janak S.L., Floudas C.A., Kallrath J., and Vormbrock N. Production scheduling of a large-scale industrial batch plant. I. Short-term and medium-term scheduling. Industrial and Engineering Chemistry Research 45 (2006) 8234-8252
25. In: Johnson D., and Trick M. (Eds). Cliques, Coloring, and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), AMS
26. Ortega F., and Wolsey L. A branch-and-cut algorithm for the single commodity uncapacitated fixed-charge network flow problem. Networks 41 3 (2003) 143-158
27. Reeves C. Genetic algorithms for the operation researcher. INFORMS Journal on Computing 9 3 (1997) 231-250
28. Sheng S., Dechen Z., and Xiaofei X. Genetic algorithm for the transportation problem with discontinuous piecewise linear cost function. International Journal of Computer Science and Network Security 6 7A (2006) 181-190
29. Steinberg D. Designing a heuristic for the fixed-charge transportation problem. Reprints in Mathematics and the Mathematical Sciences (1977), Southern Illinois University at Edwardsville, Edwardsville, IL
30. Sun M., Aronson J., McKeown P., and Drinka D. A tabu search heuristic procedure for the fixed charge transportation problem. European Journal of Operational Research 106 (1998) 441-456
31. Yagiura M., and Ibaraki T. The use of dynamic programming in genetic algorithms for permutation problems. European Journal of Operational Research 92 (1996) 387-401