An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

References

• Aiyoshi, E., & Shimizu, K. (1984). A solution method for the static constrained stackelberg problem via penalty method. IEEE Transactions on Automatic Control, 29(12), 1111–1114.
   Web of Science ®Google Scholar
• Allende, G.B., & Still, G. (2013). Solving bilevel programs with the KKT-approach. Mathematical Programming, 138(1–2), 309–332.
   Web of Science ®Google Scholar
• Anandalingam, G., & White, D.J. (1990). A solution for the linear static Stackelberg problem using penalty function. IEEE Transactions Automatic Control, 35, 1170–1173.
   Web of Science ®Google Scholar
• Angelo, J.S., Krempser, E., & Barbosa, H.J.C. (2013). Differential evolution for bilevel programming. In 2013 IEEE Congress on Evolutionary Computation (pp. 470–477). Cancún: IEEE.
   Google Scholar
• Banks, A., Vincent, J., & Anyakoha, C. (2007). A review of particle swarm optimization, Part I: Background and development. Natural Computing, 6(4), 467–484.
   Google Scholar
• Banks, A., Vincent, J., & Anyakoha, C. (2008). A review of particle swarm optimization, Part II: Hybridisation, combinatorial, multicriteria and constrained optimization and indicative applications. Natural Computing, 7(1), 109–124.
   Google Scholar
• Bard, J.F. (1988). Convex two-level optimization. Mathematical Programming, 40, 15–27.
   Web of Science ®Google Scholar
• Bard, J.F. (1998). Practical Bilevel optimization: Algorithms and applications. Dordrecht: Kluwer Academic Publishers.
   Google Scholar
• Bard, J.F., & Moore, J.T. (1992). An algorithm for the discrete bilevel programming problem. Naval Research Logistics, 39, 419–435.
   Web of Science ®Google Scholar
• Brotcorne, L., Hanafi, S., & Mansi, R. (2013). One-level reformulation of the bilevel knapsack problem using dynamic programming. Discrete Optimization, 10, 1–10.
   Web of Science ®Google Scholar
• Colson, B., Marcotte, P., & Savard, G. (2005). Bilevel programming: A survey. 4OR, 3, 87–107.
   Google Scholar
• Das, S., & Suganthan, P.N. (2011). Differential evolution: A survey of the state-of-the-art. IEEE Transactions on Evolutionary Computation, 15(1), 4–31.
   Web of Science ®Google Scholar
• Deb, K. (2000). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186(2–4), 311–338.
   Web of Science ®Google Scholar
• Dempe, S., Kalashnikov, V., & Ríos-Mercado, R.Z. (2005). Discrete bilevel programming: Application to a natural gas cashout problem. European Journal of Operational Research, 166, 469–488.
   Web of Science ®Google Scholar
• Dempe, S., & Richter, K. (2000). Bilevel programming with knapsack constraints. Central European Journal of Operations Research, 8, 93–107.
   Google Scholar
• Eberhart, R., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceedings of Sixth International Symposium on Micro Machine Human Science (pp. 39–43). Nagoya: IEEE.
   Google Scholar
• Edmunds, T.A., & Bard, J.F. (1992). An algorithm for the mixed integer nonlinear bilevel programming problem. Annals of Operations Research, 34(1), 149–162.
   Google Scholar
• Etoa Etoa, J.B. (2010). Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm. Journal of Global Optimization, 47(7), 615–637.
   Web of Science ®Google Scholar
• Etoa Etoa, J.B. (2011). Solving quadratic convex bilevel programming problems using a smoothing method. Applied Mathematics and Computation, 217, 6680–6690.
   Web of Science ®Google Scholar
• Facchinei, F., Jiang, H., & Qi, L. (1999). A smoothing method for mathematical programs with equilibrium constraints. Mathematical Programming, 85, 107–134.
   Web of Science ®Google Scholar
• Falk, J.E., & Liu, J. (1995). On bilevel programming, Part I: General nonlinear cases. Mathematical Programming, 70, 47–72.
   Web of Science ®Google Scholar
• Fanghänel, D., & Dempe, S. (2009). Bilevel programming with discrete lower level problems. Optimization, 58(8), 1029–1047.
   Web of Science ®Google Scholar
• Fukushima, M., & Lin, G.H. (2004). Smoothing methods for mathematical programs with equilibrium constraints. In Proceedings of the 12th International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS’04) (pp. 206–213). Kyoto: IEEE Computer Society.
   Google Scholar
• Gümüş, Z.H., & Floudas, C.A. (2005). Global optimization of mixed-integer bilevel programming problems. Computational Management Science, 2(3), 181–212.
   Google Scholar
• Hansen, P., Jaumard, B., & Savard, G. (1992). New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing, 13(5), 1194–1217.
   Web of Science ®Google Scholar
• Jiang, H., & Ralph, D. (2000). Smooth SQP methods for mathematical programs with nonlinear complementarity constraints. SIAM Journal on Optimization, 10, 779–808.
   Web of Science ®Google Scholar
• Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings IEEE International Conference on Neural Networks (pp. 1942–1948). Perth: IEEE.
   Google Scholar
• Li, H., & Jiao, Y.C. (2008). A hybrid evolutionary algorithm for mixed-integer nonlinear bilevel programming problems. In Second International Conference on Genetic and Evolutionary Computing (pp. 549–553). Jingzhou; Piscataway, NJ: IEEE Computer Society.
   Google Scholar
• Li, H., & Zhang, L. (2013). A differential evolution with two mutation strategies for linear bilevel programming problems. In 2013 9th International Conference on Computational Intelligence and Security (CIS) (pp. 55–60). Leshan.
   Google Scholar
• Li, H., & Zhang, L. (2014). A discrete hybrid differential evolution algorithm for solving integer programming problems. Engineering Optimization, 46(9), 1238–1268.
   Web of Science ®Google Scholar
• Mansi, R., Alves, C., Valério de Carvalho, J.M., & Hanafi, S. (2012). An exact algorithm for bilevel 0-1 knapsack problems. Mathematical Problems in Engineering, 2012, 1–23. doi:10.1155/2012/504713.
   Web of Science ®Google Scholar
• Mezura-Montes, E., & Coello Coello, C.A. (2005). A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Transactions on Evolutionary Computation, 9(1), 1–17.
   Web of Science ®Google Scholar
• Mitsos, A. (2010). Global solution of nonlinear mixed-integer bilevel programs. Journal of Global Optimization, 47(4), 557–582.
   Web of Science ®Google Scholar
• Moore, J.T., & Bard, J.F. (1990). The mixed integer linear bilevel programming problem. Operations Research, 38, 911–921.
   Web of Science ®Google Scholar
• Niwa, K., Nishizaki, I., & Sakawa, M. (1998). Decentralized two-level 0–1 programming through genetic algorithms with double strings. In 1998 Second International Conference on Knowledge-based Intelligent Electronic Systems (pp. 278–284). Adelaide: IEEE.
   Google Scholar
• Niwa, K., Nishizaki, I., & Sakawa, M. (1999). Computational methods for two-level 0-1 programming problems with fuzzy parameters through genetic algorithms. In Proceedings of 1999 IEEE International Conference on Fuzzy Systems (pp. 1510–1515). Seoul: IEEE.
   Google Scholar
• Parsopoulos, K.E., & Vrahatis, M.N. (2002). Recent approaches to global optimization problems through particle Swarm optimization. Natural Computing, 1, 235–306.
   Google Scholar
• Poli, R., Kennedy, J., & Blackwell, T. (2007). Particle swarm optimization: An overview. Swarm Intelligence, 1, 33–57.
   Google Scholar
• Rajesh, J., Gupta, K., Kusumakar, H., Jayaraman, V.K., & Kulkarni, B.D. (2003). A tabu search based approach for solving a class of bilevel programming problems in chemical engineering. Journal of Heuristics, 9, 307–319.
   Web of Science ®Google Scholar
• Sahin, K.H., & Ciric, A.R. (1998). A dual temperature simulated annealing approach for solving bilevel programming problems. Computers and Chemical Engineering, 23(1), 11–25.
   Web of Science ®Google Scholar
• Shimizu, K., & Aiyoshi, E. (1981). A new computational method for stackelberg and min-max problems by use of a penalty method. IEEE Transactions on Automatic Control, 26(2), 460–466.
   Web of Science ®Google Scholar
• Storn, R., & Price, K. (1997). Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4), 341–359.
   Web of Science ®Google Scholar
• Tuy, H., Migdalas, A., & Hoai-Phuong, N.T. (2007). A novel approach to bilevel nonlinear programming. Journal of Global Optimization, 38, 527–554.
   Web of Science ®Google Scholar
• Vicente, L., Savaro, G., & Judice, J. (1996). Discrete linear bilevel programming problem. Journal of Optimization Theory and Applications, 89(3), 597–614.
   Web of Science ®Google Scholar
• Wang, Y., Jiao, Y.C., & Li, H. (2005). An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handing scheme. IEEE Transactions on Systems, Man, and Cybernetics-Part C Applications and Reviews, 35(2), 221–232.
   Web of Science ®Google Scholar
• Wen, U.P., & Huang, A.D. (1996). A simple tabu search method to solve the mixed-integer linear bilevel programming problem. European Journal of Operational Research, 88(3), 563–571.
   Web of Science ®Google Scholar
• Wen, U.P., & Yang, Y.H. (1990). Algorithms for solving the mixed integer two-level linear programming problem. Computers & Operations Research, 17(2), 133–142.
   Web of Science ®Google Scholar