Biased random-key genetic algorithms for combinatorial optimization
暂无分享,去创建一个
[1] John E. Beasley. A population heuristic for constrained two-dimensional non-guillotine cutting , 2004, Eur. J. Oper. Res..
[2] Celso C. Ribeiro,et al. A biased random-key genetic algorithm for routing and wavelength assignment , 2011, J. Glob. Optim..
[3] S. Binato,et al. A GRASP FOR JOB SHOP SCHEDULING , 2001 .
[4] Jorge M. S. Valente,et al. A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties , 2009, Comput. Oper. Res..
[5] Michael Mutingi,et al. A genetic algorithm approach to cellular manufacturing systems , 2001 .
[6] Armin Scholl,et al. Simple assembly line balancing—Heuristic approaches , 1997, J. Heuristics.
[7] James C. Bean,et al. Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..
[8] Nina Skorin-Kapov,et al. Routing and wavelength assignment in optical networks using bin packing based algorithms , 2007, Eur. J. Oper. Res..
[9] Marvin D. Troutt,et al. Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem , 2003, Eur. J. Oper. Res..
[10] Rainer Kolisch,et al. Project Scheduling under Resource Constraints , 1995 .
[11] K. Bouleimen,et al. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version , 2003, Eur. J. Oper. Res..
[12] Nicos Christofides,et al. An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..
[13] Panos M. Pardalos,et al. A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..
[14] Rainer Kolisch,et al. Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .
[15] P. Y. Wang,et al. Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..
[16] José Fernando Gonçalves,et al. Heuristic solutions for general concave minimum cost network flow problems , 2007 .
[17] Christos Dimopoulos,et al. A hierarchical clustering methodology based on genetic programming for the solution of simple cell-formation problems , 2001 .
[18] Francisco Ballestín,et al. A Population-Based Approach to the Resource-Constrained Project Scheduling Problem , 2004, Ann. Oper. Res..
[19] José Fernando Gonçalves,et al. A Hybrid Genetic Algorithm for the Early/tardy Scheduling Problem , 2006, Asia Pac. J. Oper. Res..
[20] Jorge M. S. Valente,et al. Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties , 2008, Comput. Oper. Res..
[21] FEDERICO DELLA CROCE,et al. A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..
[22] Jan Karel Lenstra,et al. A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..
[23] Mauricio G. C. Resende,et al. A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem , 2011, J. Heuristics.
[24] G. Srinivasan. A clustering algorithm for machine cell formation in group technology using minimum spanning trees , 1994 .
[25] Rainer Kolisch,et al. Adaptive search for solving hard project scheduling problems , 1996 .
[26] Toshihide Ibaraki,et al. Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem , 2002 .
[27] W. Spears,et al. On the Virtues of Parameterized Uniform Crossover , 1995 .
[28] Panos M. Pardalos,et al. A hybrid genetic algorithm for road congestion minimization , 2009 .
[29] Rolf H. Möhring,et al. Solving Project Scheduling Problems by Minimum Cut Computations , 2002, Manag. Sci..
[30] Jorge M. S. Valente. Heuristics for the single machine scheduling problem with early and quadratic tardy penalties , 2007 .
[31] Y. Kochetov,et al. Evolutionary Local Search with Variable Neighborhood for the Resource Constrained Project Scheduling Problem , 2003 .
[32] Sándor P. Fekete,et al. A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing , 2003, Math. Oper. Res..
[33] Nicos Christofides,et al. An exact algorithm for general, orthogonal, two-dimensional knapsack problems , 1995 .
[34] Francisco Ballestín,et al. Justification and RCPSP: A technique that pays , 2005, Eur. J. Oper. Res..
[35] E. Nowicki,et al. A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .
[36] Goldberg,et al. Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.
[37] Mario Vanhoucke,et al. A Decomposition-Based Heuristic For The Resource-Constrained Project Scheduling Problem , 2005 .
[38] William V. Gehrlein,et al. A comparative evaluation of heuristic line balancing techniques , 1986 .
[39] Sönke Hartmann,et al. A competitive genetic algorithm for resource-constrained project scheduling , 1998 .
[40] Mauricio G. C. Resende,et al. A genetic algorithm for the resource constrained multi-project scheduling problem , 2008, Eur. J. Oper. Res..
[41] Jorge M. S. Valente. Beam Search Heuristics for the Single Machine Scheduling Problem with Linear earliness and Quadratic tardiness Costs , 2009, Asia Pac. J. Oper. Res..
[42] Bert De Reyck,et al. A hybrid scatter search/electromagnetism meta-heuristic for project scheduling , 2006, Eur. J. Oper. Res..
[43] Thomas R. Hoffmann,et al. Assembly line balancing: a set of challenging problems , 1990 .
[44] Sönke Hartmann,et al. A self‐adapting genetic algorithm for project scheduling under resource constraints , 2002 .
[45] Nicos Christofides,et al. A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems , 2006, Eur. J. Oper. Res..
[46] G. Srinivasan,et al. GRAFICS—a nonhierarchical clustering algorithm for group technology , 1991 .
[47] Sándor P. Fekete,et al. A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems , 1997, ESA.
[48] Celso C. Ribeiro,et al. Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.
[49] Ling Wang,et al. An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..
[50] Mhand Hifi,et al. Exact algorithms for the guillotine strip cutting/packing problem , 1998, Comput. Oper. Res..
[51] Renata M. Aiex,et al. Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..
[52] George Z. Li. Single machine earliness and tardiness scheduling , 1997 .
[53] Mauricio G. C. Resende,et al. An evolutionary algorithm for manufacturing cell formation , 2004, Comput. Ind. Eng..
[54] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .
[55] Mauricio G. C. Resende,et al. A hybrid genetic algorithm for the job shop scheduling problem , 2005, Eur. J. Oper. Res..
[56] Ramón Alvarez-Valdés,et al. A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems , 2005, J. Oper. Res. Soc..
[57] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[58] Mikkel Thorup,et al. Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..
[59] Zhi-Long Chen. Solution algorithms for the parallel replacement problem under economy of scale , 1998 .
[60] Panos M. Pardalos,et al. Handbook of applied optimization , 2002 .
[61] Nicos Christofides,et al. Upper bounds for single-source uncapacitated concave minimum-cost network flow problems , 2003, Networks.
[62] E. Hopper,et al. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..
[63] M. Chandrasekharan,et al. ZODIAC—an algorithm for concurrent formation of part-families and machine-cells , 1987 .
[64] José Fernando Gonçalves,et al. A Hybrid Genetic Algorithm for Assembly Line Balancing , 2002, J. Heuristics.
[65] Rainer Kolisch,et al. Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .
[66] Robert H. Storer,et al. Genetic Algorithms in Problem Space for Sequencing Problems , 1993 .
[67] Christian Artigues,et al. LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search , 2004, Ann. Oper. Res..
[68] Mauricio G. C. Resende,et al. A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion , 2011, Int. Trans. Oper. Res..
[69] Krzysztof Fleszar,et al. Solving the resource-constrained project scheduling problem by a variable neighbourhood search , 2004, Eur. J. Oper. Res..
[70] Ramón Alvarez-Valdés,et al. A tabu search algorithm for a two-dimensional non-guillotine cutting problem , 2007, Eur. J. Oper. Res..
[71] Armin Scholl,et al. Data of assembly line balancing problems , 1995 .
[72] Manuel Iori,et al. A hybrid genetic algorithm for the two-dimensional single large object placement problem , 2007, Eur. J. Oper. Res..
[73] Erwin Pesch,et al. Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..
[74] V. Jorge Leon,et al. Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling , 1995 .
[75] F. Glover,et al. Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.
[76] Celso C. Ribeiro,et al. Design of Survivable Networks: A survey , 2005 .
[77] Mauricio G. C. Resende,et al. A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem , 2011, J. Comb. Optim..
[78] José Fernando Gonçalves,et al. A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem , 2007, Eur. J. Oper. Res..
[79] Mauricio G. C. Resende,et al. A random key based genetic algorithm for the resource constrained project scheduling problem , 2009, Comput. Oper. Res..
[80] Mikkel Thorup,et al. Survivable IP network design with OSPF routing , 2007 .
[81] Andrew W. Shogan,et al. Semi-greedy heuristics: An empirical study , 1987 .
[82] Kam-Fai Wong,et al. A TSP-based heuristic for forming machine groups and part families , 1998 .
[83] Celso C. Ribeiro,et al. Routing and wavelength assignment by partition colouring , 2006, Eur. J. Oper. Res..
[84] S. Jakobs,et al. European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 2022 .
[85] John E. Beasley,et al. An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..
[86] Rainer Kolisch. Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .
[87] Rainer Kolisch,et al. Efficient priority rules for the resource-constrained project scheduling problem , 1996 .
[88] Thomas R. Hoffman. Eureka: a hybrid system for assembly line balancing , 1992 .
[89] P. Brucker,et al. Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem , 1999 .
[90] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .