Solving the Wire-Harness Design Problem at a European car manufacturer
暂无分享,去创建一个
Jean-François Cordeau | Marie-Sklaerder Vié | Nicolas Zufferey | J. Cordeau | Marie-Sklaerder Vié | N. Zufferey
[1] J. Beasley,et al. A genetic algorithm for the set covering problem , 1996 .
[2] Olivier Briant,et al. The Optimal Diversity Management Problem , 2004, Oper. Res..
[3] Zhi-Gang Ren,et al. New ideas for applying ant colony optimization to the set covering problem , 2010, Comput. Ind. Eng..
[4] Francis J. Vasko,et al. An efficient heuristic for large set covering problems , 1984 .
[5] Fred W. Glover,et al. Tabu search - wellsprings and challenges , 1998, Eur. J. Oper. Res..
[6] Karl T. Ulrich,et al. Component Sharing in the Management of Product Variety: a Study of Automotive Braking Systems , 1999 .
[7] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[8] Mark S. Hillier. The costs and benefits of commonality in assemble-to-order systems with a (Q, r)-policy for component replenishment , 2002, Eur. J. Oper. Res..
[9] L. W. Jacobs,et al. Note: A local-search heuristic for large set-covering problems , 1995 .
[10] Kannan Srinivasan,et al. Special Issue on Design and Development: Product Differentiation and Commonality in Design: Balancing Revenue and Cost Drivers , 2001, Manag. Sci..
[11] Paolo Toth,et al. A survey on vertex coloring problems , 2010, Int. Trans. Oper. Res..
[12] John E. Beasley,et al. A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..
[13] V. Jeet,et al. Lagrangian relaxation guided problem space search heuristics for generalized assignment problems , 2007, Eur. J. Oper. Res..
[14] Antonio Sassano,et al. A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..
[15] Fred W. Glover,et al. A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem , 2004, Discret. Optim..
[16] Marshall L. Fisher,et al. Managing Variety for Assembled Products: Modeling Component Systems Sharing , 2003, Manuf. Serv. Oper. Manag..
[17] Josef Tvrdík,et al. Hybrid differential evolution algorithm for optimal clustering , 2015, Appl. Soft Comput..
[18] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[19] Pierre Hansen,et al. The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..
[20] P. Hansen,et al. Variable neighborhood search for the p-median , 1997 .
[21] Zeger Degraeve,et al. Analysis of an industrial component commonality problem , 2008, Eur. J. Oper. Res..
[22] Pierre Hansen,et al. Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..
[23] Igor S. Litvinchev,et al. Lagrangian heuristic for a class of the generalized assignment problems , 2010, Comput. Math. Appl..
[24] Diego Ruiz-Hernández,et al. The component commonality problem in a real multidimensional space: An algorithmic approach , 2016, Eur. J. Oper. Res..
[25] Ulrich Wilhelm Thonemann,et al. Optimal Commonality in Component Design , 2000, Oper. Res..
[26] Kanchana Sethanan,et al. Improved differential evolution algorithms for solving generalized assignment problem , 2016, Expert Syst. Appl..
[27] Nicolas Zufferey,et al. Metaheuristics: Some Principles for an Efficient Design , 2012 .
[28] T Watson Layne,et al. A Genetic Algorithm Approach to Cluster Analysis , 1998 .
[29] Mahmoud A. Barghash,et al. An improved hybrid algorithm for the set covering problem , 2015, Comput. Ind. Eng..
[30] J. P. Kelly,et al. Tabu search for the multilevel generalized assignment problem , 1995 .
[31] Cristina Requejo,et al. Using decomposition to improve greedy solutions of the optimal diversity management problem , 2013, Int. Trans. Oper. Res..
[32] Fred W. Glover,et al. A cooperative parallel tabu search algorithm for the quadratic assignment problem , 2009, Eur. J. Oper. Res..
[33] Pierre Hansen,et al. J-MEANS: a new local search heuristic for minimum sum of squares clustering , 1999, Pattern Recognit..
[34] Fred W. Glover,et al. A path relinking approach with ejection chains for the generalized assignment problem , 2006, Eur. J. Oper. Res..
[35] Ravi P. Agarwal,et al. Multiple solutions for the Dirichlet second-order boundary value problem of nonsingular type , 1999 .
[36] Michael J. Brusco,et al. A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems , 1999, Ann. Oper. Res..
[37] J. Beasley. A lagrangian heuristic for set‐covering problems , 1990 .
[38] Abdolreza Hatamlou,et al. In search of optimal centroids on data clustering using a binary search algorithm , 2012, Pattern Recognit. Lett..
[39] Toshihide Ibaraki,et al. A 3-flip neighborhood local search for the set covering problem , 2006, Eur. J. Oper. Res..
[40] Juan A. Díaz,et al. A Tabu search heuristic for the generalized assignment problem , 2001, Eur. J. Oper. Res..
[41] Shaowen Wang,et al. A scalable parallel genetic algorithm for the Generalized Assignment Problem , 2015, Parallel Comput..
[42] Eva Labro,et al. The Cost Effects of Component Commonality: A Literature Review Through a Management-Accounting Lens , 2004, Manuf. Serv. Oper. Manag..
[43] Xin Yao,et al. European Journal of Operational Research an Efficient Local Search Heuristic with Row Weighting for the Unicost Set Covering Problem , 2022 .
[44] H. Edwin Romeijn,et al. A class of greedy algorithms for the generalized assignment problem , 2000, Discret. Appl. Math..
[45] Michel Gendreau,et al. Handbook of Metaheuristics , 2010 .
[46] John M. Wilson,et al. A genetic algorithm for the generalised assignment problem , 1997 .