共 50 条
- [1] Solving Dynamic Double-row Layout Problem via an Improved Simulated Annealing Algorithm [J]. 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 1299 - 1304
- [2] Hybridizing tabu search with mathematical programming for solving a single row layout problem [J]. 2018 IEEE 14TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2018, : 974 - 980
- [3] A HYBRID METHODOLOGY BASED ON DYNAMIC PROGRAMMING AND SIMULATED ANNEALING FOR SOLVING AN INTEGRATED CELL FORMATION AND LAYOUT PROBLEM [J]. ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH, 2016, 50 (02): : 263 - 280
- [4] Combining ant colony optimization and dynamic programming for solving a dynamic facility layout problem [J]. World Academy of Science, Engineering and Technology, 2010, 64 : 523 - 527
- [8] Mathematical modeling and simulated annealing algorithm for spatial layout problem [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 3): : S6383 - S6391
- [10] A SIMULATED ANNEALING HEURISTIC FOR THE DYNAMIC FACILITY LAYOUT PROBLEM [J]. JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2008, 23 (04): : 863 - 870