[1] |
KANTOROVICH L V. Mathematical methods of organizing and planning production[J]. Manage. Sci., 1990, 6:366-422.
|
[2] |
LOH K H, GOLDEN B, WASIL E. Solving the one-dimensional bin packing problem with a weight annealing heuristic[J]. Comput. Ope. Res., 2008, 35(7):2283-2291.
|
[3] |
SCHOLL A, KLEIN R, JURGENS C. BISON:a fast hybrid procedure for exactly solving the one-dimensional bin packing problem[J]. Comput. Ope. Res., 1997, 24(2):627-645.
|
[4] |
BOUGANIS A, SHANNHAN M. A vision-based intelligent system for packing 2-D irregular shapes[J]. IEEE Trans. Autom. Sci. Eng., 2007, 4(3):382-394.
|
[5] |
VILLARREAL S, JIMENEZ J A, JIN T, et al. Designing a sustainable and distributed generation system for semiconductor wafer fabs[J]. IEEE Trans. Autom. Sci. Eng., 2013, 10(1):16-26.
|
[6] |
HEMMELMAYR V, SCHMID V, BLUM C. Variable neighborhood search for the variable sized bin packing problem[J]. Comput. Ope. Res., 2012, 39(3):1097-1108.
|
[7] |
CRAINIC T G, PERBOLI G, REI W, et al. Efficient lower bounds and heuristics for the variable cost and size bin packing problem[J]. Comput. Ope. Res., 2011, 38(11):1474-1482.
|
[8] |
HAOUARI M, SERAIRI M. Relaxations and exact solution of the variable sized bin packing problem[J]. Comput. Optim. applic., 2011, 48(2):345-368.
|
[9] |
CRAINIC T G, PERBOLI G, BALDI M M, et al. The generalized bin packing problem:models and algorithms design[J]. Springer Berlin Heidelberg, 2011, 2939(2):328-339.
|
[10] |
LAI X J, HAO J K. Iterated variable neighborhood search for the capacitated clustering problem[J]. Engineering Applications of Artificial Intelligence, 2016, 56:102-120.
|
[11] |
董红宇, 黄敏, 王兴伟, 等. 变邻域搜索算法综述[J]. 控制工程, 2009, S2:1-5+13. DONG H Y, HUANG M, WANG X W, et al. A survey of variable neighborhood search algorithms[J]. Control Engineering, 2009, S2:1-5+13.
|
[12] |
宁树实, 王伟, 潘学军. 一种炼钢-连铸生产计划一体化编制方法[J]. 控制理论与应用, 2007, 24(2):374-379. NING S S, WANG W, PAN X J. A method of steelmaking and continuous casting production planning integration[J]. Control Theory and Application, 2007, 24(2):374-379.
|
[13] |
薛云灿, 郑东亮, 杨启文. 基于改进离散粒子群算法的炼钢连铸最优炉次计划[J]. 计算机集成制造系统, 2011, 17(7):1509-1517. XUE Y C, ZHENG D L, YANG Q W. Optimal steelmaking schedule for steelmaking and continuous casting based on improved discrete particle swarm optimization[J]. Computer Integrated Manufacturing System, 2011, 17(7):1509-1517.
|
[14] |
王万雷, 杨静萍, 傅洪光. 基于微粒群和满足质量约束方程的组炉方案优化方法[J]. 控制理论与应用, 2010, 27(4):509-512. WANG W L, YANG J P, FU H G. Optimization method of furnace scheme based on particle swarm and mass constraint equation[J]. Control Theory and Application, 2010, 27(4):509-512.
|
[15] |
FALKENAUER E. A new representation and operators for genetic algorithms applied to grouping problems[J]. Evolutionary Computation, 1994, 2(2):123-144.
|
[16] |
刘乐. 单机最大延迟重调度的和声变邻域搜索算法[J]. 计算机集成制造系统, 2016, 8:1977-1991. LIU L. Single variable maximum delay rescheduling based on harmony variable neighborhood search algorithm[J]. Computer Integrated Manufacturing System, 2016, 8:1977-1991.
|
[17] |
李坤, 徐铮, 田慧欣. 基于自适应变邻域搜索算法的一类混合流水车间调度问题[J]. 系统工程, 2015, 11:121-129. LI K, XU Z, TIAN H X. A hybrid flow shop scheduling problem based on adaptive variable neighborhood search algorithm[J]. Systems Engineering, 2015, 11:121-129.
|
[18] |
NENAD M, RACA T, DARGAN U. Less is more:basic variable neighborhood search for minimum differential dispersion problem[J]. Information Sciences, 2017, 179(22):382-383.
|
[19] |
YANNIS M, ATHANASIOS M, ANGELO S. A hybrid particle swarm optimization-variable neighborhood search algorithm for constrained shortest path problems[J]. European Journal of Operational Research, 2017, 261(3):819-834.
|
[20] |
SANCHEZ-ORO J, DUARTE A, SLACEDO-SANZ S. Robust total energy demand estimation with a hybrid variable neighborhood search-extreme learning machine algorithm[J]. Energy Conversion and Management, 2016, 123(8):445-452.
|
[21] |
RACA T, RACHID B, SAID H, et al. Nested general variable neighborhood search for the periodic maintenance problem[J]. European Journal of Operational Research, 2016, 252(2):385-396.
|
[22] |
LAI X J, HAO J K. Iterated variable neighborhood search for the capacitated clustering problem[J]. Engineering Applications of Artificial Intelligence, 2016, 56:102-120.
|
[23] |
LESLIE P C, THOMAS S. Exploring variable neighborhood search for automatic algorithm configuration[J]. Electronic Notes in Discrete Mathematics, 2017, 58:167-174.
|
[24] |
ZIRAN Z, XIYU L, XIAOJU G. A simple randomized variable neighborhood search for nurse rostering[J]. Computers & Industrial Engineering, 2017, 110:165-174.
|
[25] |
LI K, TIAN H X. A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem[J]. Applied Soft Computing, 2016, 43:469-479.
|
[26] |
GINTARAS P. A variable neighborhood search and simulated annealing hybrid for the profile minimization problem[J]. Computers & Operations Research, 2017, 87:83-97.
|
[27] |
JESUS S, MARC S, ANDRÉ R, et al. Improving the performance of embedded systems with variable neighborhood search[J]. Applied Soft Computing, 2017, 53:217-226.
|
[28] |
SANDRA H, MARTIN J G. Order matters-a variable neighborhood search for the swap-body vehicle routing problem[J]. European Journal of Operational Research, 2017, 263(2):419-445.
|
[29] |
RACA T, MARKO M, SAID H, et al. Adaptive general variable neighborhood search heuristics for solving the unit commitment problem[J]. International Journal of Electrical Power & Energy Systems, 2016, 78:873-883.
|
[30] |
JORDI P, MARIONA V. Variable neighborhood search heuristics for a test assembly design problem[J]. Expert Systems with Applications, 2015, 42(10):4805-4817.
|