A Collaborative Search Strategy to Solve Combinatorial Optimization and Scheduling Problems
暂无分享,去创建一个
[1] Ling Wang,et al. An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .
[2] Ming Liang,et al. Hybrid simulated annealing with memory: an evolution-based diversification approach , 2010 .
[3] Ibrahim H. Osman,et al. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..
[4] Gu Qingming,et al. A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEDULING PROBLEM , 1998 .
[5] Luca Maria Gambardella,et al. Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..
[6] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[7] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[8] Reha Uzsoy,et al. Benchmarks for shop scheduling problems , 1998, Eur. J. Oper. Res..
[9] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[10] Rubén Ruiz,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[11] Michael Kolonko,et al. Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..
[12] S. Zolfaghari,et al. Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach , 1999 .
[13] Saeed Zolfaghari,et al. Adaptive temperature control for simulated annealing: a comparative study , 2004, Comput. Oper. Res..
[14] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[15] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[16] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[17] James Kennedy,et al. Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.
[18] Saeed Zolfaghari,et al. A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling , 2007, Eur. J. Oper. Res..
[19] Mehmet Emin Aydin,et al. A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems , 2004, J. Heuristics.
[20] Renata M. Aiex,et al. Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..
[21] Rajasooriyar Partheepan. Hybrid Genetic Algorithms , 2004 .
[22] Mauricio G. C. Resende,et al. Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .
[23] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[24] Christian Bierwirth,et al. On Permutation Representations for Scheduling Problems , 1996, PPSN.
[25] Pin Luarn,et al. A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..
[26] Ming Liang,et al. Hybrid Simulated Annealing in Flow-shop Scheduling: A Diversification and Intensification Approach , 2009 .