A discrete hybrid differential evolution algorithm for solving integer programming problems

References

• Balev, S., N. Yanev, A. Fréville, and R. Andonov. 2008. “A Dynamic Programming Based Reduction Procedure for the Multidimensional 0–1 Knapsack Problem.” European Journal of Operational Research 186 (1), 63–76. doi: 10.1016/j.ejor.2006.02.058
   Web of Science ®Google Scholar
• Brest, J., S. Greiner, B. Boskovic, M. Mernik, and V. Zumer. 2006. “Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems.” IEEE Transactions on Evolutionary Computation 10 (6), 646–657. doi: 10.1109/TEVC.2006.872133
   Web of Science ®Google Scholar
• Chan, D. Y., C. Y. Ku, and M. C. Li. 2006. “A Method to Improve Integer Linear Programing Problem with Branch-and-Bound Procedure.” Applied Mathematics and Computation 179 (2), 484–493. doi: 10.1016/j.amc.2005.11.171
   Web of Science ®Google Scholar
• Chen, Wei-Neng, Jun Zhang, Henry S. H. Chung, Wen-Liang Zhong, Wei-Gang Wu, and Yu-hui Shi. 2010. “A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems.” IEEE Transactions on Evolutionary Computation 14 (2), 278–300. doi: 10.1109/TEVC.2009.2030331
   Web of Science ®Google Scholar
• Coello Coello, Carlos A. 2002. “Theoretical and Numerical Constraint-Handling Techniques Used With Evolutionary Algorithms: A Survey of the State of the Art.” Computer Methods in Applied Mechanics and Engineering 191 (11-12), 1245–1287. doi: 10.1016/S0045-7825(01)00323-1
   Web of Science ®Google Scholar
• Deng, C., C. Liang, B. Zhao, Y. Yang, and A. Deng. 2011. “Structure-Encoding Differential Evolution for Integer Programming.” Journal of Software 6 (1), 140–147.
   Google Scholar
• Fang, K. T., and C. X. Ma. 2001. Orthogonal and Uniform Experimental Design. Beijing: Science Press.
   Google Scholar
• Fisher, M. L., 1981. “The Lagrangian Relaxation Method for Solving Integer Programming Problems.” Management Science 27 (1), 1–18. doi: 10.1287/mnsc.27.1.1
   Web of Science ®Google Scholar
• García, S., D. Molina, M. Lozano, and F. Herrera. 2009. “A Study on the Use of Non-Parametric Tests for Analyzing the Evolutionary Algorithms’ Behaviour: A Case Study on the CEC’2005 Special Session on Real Parameter Optimization.” Journal of Heuristics 15 (6), 617–644. doi: 10.1007/s10732-008-9080-4
   Web of Science ®Google Scholar
• Ge, R., and H. Huang. 1989. “A Continuous Approach to Nonlinear Integer Programming.” Applied Mathematics and Computation 34 (1), 39–60. doi: 10.1016/0096-3003(89)90005-2
   Web of Science ®Google Scholar
• Glover, F. 2006. “Parametric Tabu-Search for Mixed Integer Programs.” Computers & Operations Research 33 (9), 2449–2494. doi: 10.1016/j.cor.2005.07.009
   Web of Science ®Google Scholar
• Ho, S. Y., L. S. Shu, and J. H. Chen. 2004. “Intelligent Evolutionary Algorithms for Large Parameter Optimization Problems.” IEEE Transactions on Evolutionary Computation 8 (6), 522–540. doi: 10.1109/TEVC.2004.835176
   Web of Science ®Google Scholar
• Hrstka, O., A. Kučerová, M. Lepš, and J. Zeman. 2003. “A Competitive Comparison of Different Types of Evolutionary Algorithms.” Computers and Structures 81 (18), 1979–1990. doi: 10.1016/S0045-7949(03)00217-7
   Web of Science ®Google Scholar
• Hua, Z., and F. Huang. 2006. “A Variable-Grouping Based Genetic Algorithm for Large-Scale Integer Programming.” Information Sciences 176 (19), 2869–2885. doi: 10.1016/j.ins.2005.04.009
   Web of Science ®Google Scholar
• Kesen, S. E., S. K. Das, and Z. Güngör. 2010. “A Genetic Algorithm Based Heuristic for Scheduling of Virtual Manufacturing Cells (VMCs).” Computers & Operations Research 37 (6), 1148–1156. doi: 10.1016/j.cor.2009.10.006
   Web of Science ®Google Scholar
• Lee, W. J., A. V. Cabot, and M. A. Venkataramanan. 1994. “A Branch and Bound Algorithm for Solving Separable Convex Integer Programming Problems.” Computers & Operations Research 91 (9), 1011–1024. doi: 10.1016/0305-0548(94)90072-8
   Web of Science ®Google Scholar
• Leung, Y. W., and Y. Wang. 2001. “An Orthogonal Genetic Algorithm with Quantization for Global Numerical Optimization.” IEEE Transactions on Evolutionary Computation 5 (1), 41–53. doi: 10.1109/4235.910464
   Web of Science ®Google Scholar
• Li, H., Y. C. Jiao, L. Zhang, and Z. W. Gu. 2006. “Genetic Algorithm Based on the Orthogonal Design for Multidimensional Knapsack Problems.” In Part 1 of Proceedings of the Second International Conference on Advances in Natural Computation (ICNC 2006), 24–28 September 2006, Xi'an, PR China, edited by Licheng Jiao, Lipo Wang, Xinbo Gao, Jing Liu, and Feng Wu. Vol. 4221 of Lecture Notes in Computer Science, 696–705.: Springer-Verlag.
   Google Scholar
• Lin, Y. C., and K. S. Hwang. 2004. “A Mixed-Coding Scheme of Evolutionary Algorithms to Solve Mixed-Integer Nonlinear Programming Problems.” Computers and Mathematics with Applications 47 (8–9), 1295–1307. doi: 10.1016/S0898-1221(04)90123-X
   Web of Science ®Google Scholar
• Mezura-Montes, Efrén, and Carlos Coello Coello. 2005. “A Simple Multimembered Evolution Strategy to Solve Constrained Optimization Problems.” IEEE Transactions on Evolutionary Computation 9 (1), 1–17. doi: 10.1109/TEVC.2004.836819
   Web of Science ®Google Scholar
• Mohan, C., and H. T. Nguyen. 1999. “A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization Problems.” Computational Optimization and Applications 14 (1), 103–132. doi: 10.1023/A:1008761113491
   Web of Science ®Google Scholar
• Muppani, V. R., and G. K. Adil. 2008. “A Branch and Bound Algorithm for Class Based Storage Location Assignment.” European Journal of Operational Research 189 (2), 492–507. doi: 10.1016/j.ejor.2007.05.050
   Web of Science ®Google Scholar
• Murray, W., and K. M. Ng. 2010. “An Algorithm for Nonlinear Optimization Problems with Binary Variables.” Computational Optimization and Applications 47 (2), 257–288. doi: 10.1007/s10589-008-9218-1
   Web of Science ®Google Scholar
• Ng, C. K., D. Li, and L. S. Zhang. 2007. “Discrete Global Descent Method for Discrete Global Optimization and Nonlinear Integer Programming.” Journal of Global Optimization 37 (3), 357–379. doi: 10.1007/s10898-006-9053-9
   Web of Science ®Google Scholar
• Ng, C. K., L. S. Zhang, D. Li, and W. W. Tian. 2005. “Discrete Filled Function Method for Discrete Global Optimization.” Computational Optimization and Applications 31 (1), 87–115. doi: 10.1007/s10589-005-0985-7
   Web of Science ®Google Scholar
• Noman, N., and H. Iba. 2008. “Accelerating Differential Evolution Using an Adaptive Local Search.” IEEE Transactions on Evolutionary Computation 12 (1), 107–125. doi: 10.1109/TEVC.2007.895272
   Web of Science ®Google Scholar
• Oguz, O. 2010. “Cutting Plane Algorithms for 0–1 Programming Based on Cardinality Cuts.” European Journal of Operational Research 205 (2), 273–279. doi: 10.1016/j.ejor.2010.01.006
   Web of Science ®Google Scholar
• Parsopoulos, K. E., and M. N. Vrahatis. 2002. “Recent Approaches to Global Optimization Problems Through Particle Swarm Optimization.” Natural Computing 1 (2–3), 235–306. doi: 10.1023/A:1016568309421
   Google Scholar
• Price, K. V., R. M., Storn, and J. A. Lampinen. 2005. Differential Evolution: A Practical Approach to Global Optimization. Berlin: Springer.
   Google Scholar
• Rahnamayan, S., H. R. Tizhoosh, and M. M. A. Salama. 2008. “Opposition-Based Differential Evolution.” IEEE Transactions on Evolutionary Computation 12 (1), 64–79. doi: 10.1109/TEVC.2007.894200
   Web of Science ®Google Scholar
• Runarsson, T. P., and X. Yao. 2005. “Search Biases in Constrained Evolutionary Optimization.” IEEE Transactions on Systems, Man, and Cybernetics—Part C: Applications and Reviews 35 (2), 233–243. doi: 10.1109/TSMCC.2004.841906
   Web of Science ®Google Scholar
• Safaei, N., M. Saidi-Mehrabad, and M. S. Jabal-Ameli. 2008. “A Hybrid Simulated Annealing for Solving an Extended Model of Dynamic Cellular Manufacturing System.” European Journal of Operational Research 185 (2), 563–592. doi: 10.1016/j.ejor.2006.12.058
   Web of Science ®Google Scholar
• Seçkiner, S. U., and M. Kurt. 2007. “A Simulated Annealing Approach to the Solution of Job Rotation Scheduling Problems.” Applied Mathematics and Computation 188 (1), 31–45. doi: 10.1016/j.amc.2006.09.082
   Web of Science ®Google Scholar
• Sloane, N. J. A. 2007. A Library of Orthogonal Arrays. http://www2.research.att.com/~njas/oadir/.
   Google Scholar
• Storn, R., and K. Price. 1997. “Differential Evolution—A Simple and Efficient Heuristic for Global Optimization Over Continuous Spaces.” Journal of Global Optimization 11 (4), 341–359. doi: 10.1023/A:1008202821328
   Web of Science ®Google Scholar
• Takahama, T., and S. Sakai. 2005. “Constrained Optimization By Applying the α Constrained Method to the Nonlinear Simplex Method With Mutations.” IEEE Transactions on Evolutionary Computation 9 (5), 437–451. doi: 10.1109/TEVC.2005.850256
   Web of Science ®Google Scholar
• Tang, L., H. Xuan, and J. Liu. 2006. “A New Lagrangian Relaxation Algorithm for Hybrid Flowshop Scheduling to Minimize Total Weighted Completion Time.” Computers & Operations Research 33 (11), 3344–3359. doi: 10.1016/j.cor.2005.03.028
   Web of Science ®Google Scholar
• Tsai, J. T., T. K. Liu, and J. H. Chou. 2004. “Hybrid Taguchi-Genetic Algorithm for Global Numerical Optimization.” IEEE Transactions on Evolutionary Computation 8 (4), 365–377. doi: 10.1109/TEVC.2004.826895
   Web of Science ®Google Scholar
• Vegh, V., G. K. Pierens and Q. M. Tieng. 2011. “A Variant of Differential Evolution for Discrete Optimization Problems Requiring Mutually Distinct Variables.” International Journal of Innovative Computing, Information and Control 7 (2), 897–914.
   Web of Science ®Google Scholar
• Zhang, Q., and Y. W. Leung. 1999. “An Orthogonal Genetic Algorithm for Multimedia Multicast Routing.” IEEE Transactions on Evolutionary Computation 3 (1), 53–62. doi: 10.1109/4235.752920
   Web of Science ®Google Scholar
• Zhu, W. X., and M. M. Ali. 2009. “Discrete Dynamic Convexized Method for Nonlinearly Constrained Nonlinear Integer Programming.” Computers & Operations Research 36 (10), 2723–2728. doi: 10.1016/j.cor.2008.12.002
   Web of Science ®Google Scholar
• Zhu, W. X., and H. Fan. 2009. “A Discrete Dynamic Convexized Method for Nonlinear Integer Programming.” Journal of Computational and Applied Mathematics 223 (1), 356–373. doi: 10.1016/j.cam.2008.01.023
   Web of Science ®Google Scholar