A feasibility-preserving local search operator for constrained discrete optimization problems

2008 IEEE Congress on Evolutionary Computation, CEC 2008

Volumn , Issue , 2008, Pages 1968-1975

  Lukasiewycz, Martin ^a   Glaß, Michael ^a   Haubelt, Christian ^a   Teich, Jürgen ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANNEALING; CONSTRAINT THEORY; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SIMULATED ANNEALING;

CONSTRAINED OPTIMIZATION PROBLEMS; CONSTRAINED PROBLEMS; DISCRETE OPTIMIZATION PROBLEMS; EVOLUTION STRATEGIES; FEASIBLE SOLUTIONS; HEURISTIC OPTIMIZATIONS; LOCAL SEARCH OPERATORS; NOVEL SCHEMES; OPTIMIZATION APPROACHES; OPTIMIZATION METHODOLOGIES; TO MANY;

CONSTRAINED OPTIMIZATION;

EID: 55749115404     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2008.4631058     Document Type: Conference Paper

References (23)

1. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, Number 4598, 13 May 1983, vol. 220, 4598, pp. 671-680, 1983.
2. F. Glover, "Future paths for integer programming and links to artificial intelligence," Computers and Operations Research, vol. 13, no. 5, pp. 533-549, 1986.
3. H.-G. Beyer, The theory of evolution strategies. New York, NY, USA: Springer-Verlag New York, Inc., 2001.
4. R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. Plenum Press, 1972, pp. 85-103.
5. D. Chai and A. Kuehlmann, "A fast pseudo-boolean constraint solver," in DAC'03: Proceedings of the 40th conference on Design automation. New York, NY, USA: ACM Press, 2003, pp. 830-835.
6. H. M. Sheini and K. A. Sakallah, "Pueblo: A modern pseudo-boolean sat solver," in DATE'05: Proc. of the conf on Design, Automation and Test in Europe. Washington, DC, USA: IEEE Computer Society, 2005, pp. 684-685.
7. C. Coello, "Theoretical and numerical constraint handling techniques used with evolutionary algorithms: A survey of the state of the art," Art. Computer Methods in Applied Mechanics and Engineering, vol. 191(11-12), pp. 1245-1287, 2002.
8. Z. Michalewicz and M. Schoenauer, "Evolutionary algorithms for constrained parameter optimization problems," Evolutionary Computation, vol. 4, no. 1, pp. 1-32, 1996.
9. Z. Michalewicz, K. Deb, M. Schmidt, and T. Stidsen, "Test-case generator for nonlinear continuous parameter optimization techniques," IEEE Transactions on Evolutionary Computation., vol. 4. no. 3, pp. 197-215, 2000.
10. K. Deb, "An efficient constraint handling method for genetic algorithms," Computer Methods in Applied Mechanics and Engineering., vol. 186, pp. 311-338, 2000.
11. Z. Michalewicz and G. Nazhiyath, "Genocop iii: A co-evolutionary algorithm for numerical optimization problems with nonlinear constraints," in Proceedings of the Second IEEE Conference on Evolutionary Computation, 1995, pp. 647-651.
12. M. Lukasiewycz, M. Glaß, C. Haubelt, and J. Teich, "SAT-Decoding in Evolutionary Algorithms for Discrete Constrained Optimization Problems," in Proc. of CEC'07, 2007, pp. 935-942.
13. E. Zitzler and L. Thiele, "Multi-objective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach," IEEE Transactions on Evolutionary Computation, vol. 3, no. 4. pp. 257-271, 1999.
14. P. Larranaga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and S. Dizdarevic, "Genetic algorithms for the travelling salesman problem: A review of representations and operators," Artif. Intell. Rev., vol. 13, no. 2, pp. 129-170, 1999.
15. K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre, "Random constraint satisfaction: Easy generation of hard (satisfiable) instances," Artif. Intell., vol. 171, no. 8-9, pp. 514-534, 2007.
16. V. Manquinho and O. Roussel, "Pseudo boolean evaluation 2007," Website, 2006, available online at http://www.cril.univ-artois.fr/PB07/.
17. E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, and V. G. da Fonseca, "Performance assessment of multi-objective optimizers: an analysis and review." IEEE Trans. Evolutionary Computation, vol. 7, no. 2, pp. 117-132, 2003.
18. C. Haubelt, J. Teich, R. Feldmann, and B. Monien, "SAT-Based Techniques in System Design," in Proceedings of Design, Automation and Test in Europe, N. Wehn and D. Verkest, Eds. Munich, Germany: IEEE Computer Society, Mar. 2003, pp. 1168-1169.
19. F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallah, "Generic ilp versus specialized 0-1 ilp: an update," in Proc. of ICCAD'02, 2002, pp. 450-457.
20. M. Davis, G. Logemann, and D. Loveland, "A machine program for theorem-proving," Commun. ACM, vol. 5, no. 7, pp. 394-397, 1962.
21. S.-S. Choi, K. Jung, and J. H. Kim, "Phase transition in a random nk landscape model," in Proc. of GECCO'05, 2005, pp. 1241-1248.
22. SAT4J, "A satisfiability library for Java," http://www.sat4j.org/.
23. E. Zitzler, M. Laumanns, and L. Thiele, "SPEA2: Improving the Strength Pareto Evolutionary Algorithm," in EUROGEN 2001. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, 2002, pp. 95-100.