Genetic algorithms for supply management problem with lower-bounded demands

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 12, Issue PART 1, 2006, Pages

  Borisovsky, Pavel ^a   Dolgui, Alexandre ^b   Eremeev, Anton ^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; Gradient methods; Mathematical programming

Indexed keywords

GRADIENT METHODS; MATHEMATICAL PROGRAMMING; SHIPS;

BINARY REPRESENTATIONS; DELIVERY COSTS; LOWER AND UPPER BOUNDS; PERMUTATION REPRESENTATION; SUPPLY MANAGEMENT PROBLEMS; TRANSPORTATION COST;

GENETIC ALGORITHMS;

EID: 79961177989     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20060517-3-fr-2903.00277     Document Type: Conference Paper

References (15)

1. Aggarwal, C.C., J.B. Orlin and R.P. Tai (1997). An optimized crossover for maximum independent set. Oper. Res. 45, 225-234.
2. Balas, E. and W. Niehaus (1998). Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. Journ. of Heuristics 4(2), 107-122. (Pubitemid 128514872)
3. Barr, R.S., R.S. Glover and D. Klingman (1981). A new optimization method for large scale fixed charge transportation problems. Oper. Res. 29(3), 448-463.
4. Borisovsky, P.A. (2004). Genetic algorithms for a supply management problem. In: Proc. Intern. Conf. "Systems, Mechanisms and Machines Dynamics". pp. 255-258. Omsk. (In Russian).
5. Chauhan, S.S. and J.-M. Proth (2003). The concave cost supply problem. Europ. Journ. of Oper. Res. 148(2), 374-383.
6. Chauhan, S.S., A.V. Eremeev, A.A. Kolokolov and V.V. Servakh (2005). Concave cost supply management problem for single manufacturing unit. In: Supply Chain Optimisation, Product/Process Design, Facility Location and Flow Control (O. Zaikin A. Dolgui, J. Soldek, Ed.). pp. 167-174. Springer Verlag.
7. Chauhan, S.S., A.V. Eremeev, A.A. Romanova and V.V. Servakh (2004). Approximation of linear cost supply management problem with lower-bounded demands. In: Proc. of Discrete Optimization Methods in Production and Logistics (DOM'2004). pp. 16-21. Omsk.
8. Eckert, C. and J. Gottlieb (2002). Direct representation and variation operators for the fixed charge transportation problem. In: Proc. of PPSN 2002. pp. 77-87.
9. Eremeev, A.V. (1999). A genetic algorithm with a non-binary representation for the set covering problem. In: Proc. of Operations Research (OR'98). pp. 175-181. Springer Verlag.
10. Gottlieb, J. and L. Paulmann (1998). Genetic algorithms for the fixed charge transportation problem. In: Proc. of 5th IEEE Int. Conf. on Evol. Comp.. pp. 330-335.
11. Klingman, D., A. Napier and J. Stutz (1974). Netgen: A program for generating large scale capacitated assignment, transportation and minimum cost flow networks. Manag. Sci. 20, 814-820.
12. Kolokolov, A.A. and T.V. Levanova (1996). Decomposition and L-class enumeration algorithms for solving some location problems. Vestnik Omskogo Universiteta 1, 21-23. (in Russian).
13. Reeves, C.R. (1997). Genetic algorithms for the operation researcher. INFORMS Journ. on Comput. 9(3), 231-250.
14. Sun, M., J.E. Aronson, P.G. McKeown and D. Drinka (1998). A tabu search heuristic procedure for the fixed charge transportation problem. Europ. Journ. of Oper. Res. 106, 441-456. (Pubitemid 128399662)
15. Zaozerskaya, L.A. (2003). A branch and bound algorithm for solving the concave cost supply management problem. In: Book of Abstr. of GOR Society Int. Conf.. p. 136.