Folgen
Andreas Beham
Titel
Zitiert von
Zitiert von
Jahr
Genetic algorithms and genetic programming: modern concepts and practical applications
M Affenzeller, S Winkler, S Wagner, A Beham
Taylor & Francis, 2009
7712009
AbYSS: Adapting scatter search to multiobjective optimization
AJ Nebro, F Luna, E Alba, B Dorronsoro, JJ Durillo, A Beham
IEEE Transactions on Evolutionary Computation 12 (4), 439-457, 2008
3712008
Architecture and design of the HeuristicLab optimization environment
S Wagner, G Kronberger, A Beham, M Kommenda, A Scheibenpflug, ...
Advanced methods and applications in computational intelligence, 197-261, 2014
1932014
New insights on the block relocation problem
F Tricoire, J Scagnetti, A Beham
Computers & Operations Research 89, 127-139, 2018
682018
Re-warehousing vs. healing: Strategies for warehouse storage location assignment
M Kofler, A Beham, S Wagner, M Affenzeller, W Achleitner
3rd IEEE international symposium on logistics and industrial informatics, 77-82, 2011
592011
Advanced methods and applications in computational intelligence
S Wagner, G Kronberger, A Beham, M Kommenda, A Scheibenpflug, ...
Topics in Intelligent Engineering and Informatics 6, 197-261, 2014
512014
Benefits of plugin-based heuristic optimization software systems
S Wagner, S Winkler, E Pitzer, G Kronberger, A Beham, R Braune, ...
Computer Aided Systems Theory–EUROCAST 2007: 11th International Conference …, 2007
502007
Resource-constrained multi-project scheduling with activity and time flexibility
VA Hauder, A Beham, S Raggl, SN Parragh, M Affenzeller
Computers & Industrial Engineering 150, 106857, 2020
402020
A comparative study of genetic algorithm components in simulation-based optimisation
B Can, A Beham, C Heavey
2008 Winter Simulation Conference, 1829-1837, 2008
362008
Affinity based slotting in warehouses with dynamic order patterns
M Kofler, A Beham, S Wagner, M Affenzeller
Advanced methods and applications in computational intelligence, 123-143, 2014
312014
HeuristicLab 3.3: A unified approach to metaheuristic optimization
S Wagner, A Beham, G Kronberger, M Kommenda, E Pitzer, M Kofler, ...
Actas del séptimo congreso español sobre Metaheurísticas, Algoritmos …, 2010
292010
Rassigning storage locations in a warehouse to optimize the order picking process
M Kofler, A Beham, S Wagner, M Affenzeller, C Reitinger
Proceedings of the 22th european modeling and simulation symposium EMSS, 77-82, 2010
272010
Performance, quality, and control in steel logistics 4.0
A Beham, S Raggl, VA Hauder, J Karder, S Wagner, M Affenzeller
Procedia Manufacturing 42, 429-433, 2020
262020
Complexity measures for multi-objective symbolic regression
M Kommenda, A Beham, M Affenzeller, G Kronberger
Computer Aided Systems Theory–EUROCAST 2015: 15th International Conference …, 2015
252015
Automatic algorithm selection for the quadratic assignment problem using fitness landscape analysis
E Pitzer, A Beham, M Affenzeller
Evolutionary Computation in Combinatorial Optimization: 13th European …, 2013
232013
Simulation-based evolution of resupply and routing policies in rich vendor-managed inventory scenarios
S Vonolfen, M Affenzeller, A Beham, E Lengauer, S Wagner
Central European Journal of Operations Research 21, 379-400, 2013
222013
Robust storage assignment in warehouses with correlated demand
M Kofler, A Beham, S Wagner, M Affenzeller
Computational intelligence and efficiency in engineering systems, 415-428, 2015
212015
Optimizing assembly line supply by integrating warehouse picking and forklift routing using simulation
S Vonolfen, M Kofler, A Beham, M Affenzeller, W Achleitner
Proceedings of the 2012 Winter Simulation Conference (WSC), 1-12, 2012
212012
A closer look down the basins of attraction
E Pitzer, M Affenzeller, A Beham
2010 UK workshop on computational intelligence (UKCI), 1-6, 2010
212010
A genetic programming approach to solve scheduling problems with parallel simulation
A Beham, S Winkler, S Wagner, M Affenzeller
2008 IEEE International Symposium on Parallel and Distributed Processing, 1-5, 2008
212008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20