Two genetic algorithms to solve a layout problem in the fashion industry

European Journal of Operational Research

Volumn 154, Issue 1, 2004, Pages 304-322

  Martens, J ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Genetic algorithms; Integer programming; Layout problem; Problem formulation

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; INDUSTRIAL ECONOMICS; INTEGER PROGRAMMING; INVENTORY CONTROL; NONLINEAR PROGRAMMING; PROBLEM SOLVING; WASTE UTILIZATION;

FASHION INDUSTRY; LAYOUT PROBLEMS;

OPERATIONS RESEARCH;

EID: 0344011675     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00706-3     Document Type: Article

References (13)

1. Chen C.L., Vempati V.S., Aljaber N. An application of genetic algorithms for flow shop problems. European Journal of Operational Research. 80:1995;389-396.
2. J. Gottlieb, L. Paulmann, Genetic algorithms for the fixed charge transportation problem. Proceedings of the 1998 IEEE World Congress on Computational Intelligence, 1998, pp. 330-335.
3. Y. Nagata, S. Kobayashi, Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem, in: T. Bäck (Ed.), Proceedings of the 7th International Conference on GAs, 1997, pp. 450-457.
4. Beasley J.E., Chu P.C. A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics. 4:1998;63-96.
5. Degraeve Z., Vandebroek M. A mixed integer programming model for solving a layout problem in the fashion industry. Management Science. 44:1998;301-310.
6. Z. Degraeve, W. Gochet, R. Jans, Alternative formulations for a layout problem in the fashion industry, Research Report, Katholieke Universiteit Leuven, Belgium, 1998.
7. Holland J.H. Adaptation in Natural and Artificial Systems. 1975;The University of Michigan Press, Ann Arbor, MI.
8. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning. 1989;Addison-Wesley, Reading, MA.
9. Davis L. Handbook of Genetic Algorithms. 1991;Van Nostrand Reinhold, New York.
10. Mathias K.E., Whitley L.D. Genetic operators, the fitness landscape and the traveling salesman problem. Männer R., Manderick B. Parallel Problem Solving from Nature. vol. 2:1992;219-228 Elsevier Science Publishers, Amsterdam.
11. Beasley J.E., Chu P.C. Constraint handling in genetic algorithms, the set partitioning problem. Journal of Heuristics. 11:1998;323-357.
12. G.R. Raidl, An improved genetic algorithm for the multiconstrained 0-1 knapsack problem. in: Proceedings of the 1998 IEEE World Congress on Computational Intelligence, 1998, pp. 207-211.
13. Z. Michalewicz, The significance of the evaluation function in evolutionary algorithms, in: L. Davis, K. De Jong, M. Vose, D. Whitley (Eds.), The IMA Volumes in Mathematics and its Applications, vol. 111, 1998, pp. 151-167.