apl. Prof. Dr. Andreas Bortfeldt

apl. Prof. Dr. Andreas Bortfeldt

Fakultät für Wirtschaftswissenschaft (FWW)
Lehrstuhl BWL, insb. Management Science
About

The research interests of Prof. Dr. Andreas Bortfeldt focus on advanced methods for decision support like graph search strategies and metaheuristics, including also parallel metaheuristics. New approaches are developed in the first line for cutting and packing problems of different types and dimensions. Recently highly topical problems in the area of transportation logistics which combine packing and routing aspects are investigated. Moreover, other application fields, e.g., container management in seaports or school timetabling, are also addressed. Further research activities are concerned with the development of patterns for object oriented system analysis. Current research projects are dealing with:

  • the development of advanced metaheuristics for solving different variants of the vehicle routing and loading problem,
  • the development of a graph search approach for three-dimensional container loading that is capable to take into account a broad spectrum of packing constraints,
  • the development of graph search approaches for container pre-marshalling problems in container seaports,
  • the development of an instance generator for 3D container loading problems with multiple constraints.
Curriculum Vitae
Education
  2009 Habilitation in Information Systems and Operations Research, Universität in Hagen, Fakultät für Wirtschaftswissenschaft.
  1994 Doctorate (Dr. rer. pol., equiv. to Ph.D. in Business Administration), Freie Universität Berlin, thesis title: „Informierte Graphensuchverfahren und genetische Algorithmen zur Lösung von Containerbeladeproblemen.“ Advisor: Prof. Dr. Hermann Gehring, co-advisor: Prof. Dr. Peter Mevert.
  1978 Graduate in mathematics (Dipl.-Math., equiv. to master degree in mathematics), Humboldt Universität Berlin.

Positions

  since 2012 Senior lecturer, Otto-von-Guericke Universität Magdeburg, Management Science (Prof. Dr. Gerhard Wäscher).
  2009 - 2012 Private lecturer, FernUniversität - University of Hagen, Information Systems.
  1996 - 2009 Senior lecturer, FernUniversität - University of Hagen, Information Systems (Prof. Dr. Hermann Gehring).
  1989 - 1995 PhD student and research assistant, Freie Universität Berlin, Information Systems (Prof. Dr. Hermann Gehring).
  1978 - 1989 Software developer and analyst in several firms and public boards (power generation, water management, public health care).
Publications

Books and edited books

Bortfeldt, A.; Homberger, J.; Kopfer, H.; Pankratz, G.; Strangmeier, R. (Eds.) (2008): Intelligent decision support – Current challenges and approaches, Intelligente Entscheidungsunterstützung – Aktuelle Herausforderungen und Lösungsansätze. Deutscher Universitäts-Verlag, Wiesbaden.

Bortfeldt, A.; Fischer, T.; Homberger, J.; Pankratz, G.; Strangmeier, R. (Eds.) (2003): Planen, Lernen, Optimieren – Beiträge zu Logistik und E-Learning. Festschrift für Hermann Gehring zum 60. Geburtstag, Diskussionsbeitrag Nr. 338. Fachbereich Wirtschaftswissenschaft, FernUniversität Hagen.

Bortfeldt, A. (1995): Informierte Graphensuchverfahren und genetische Algorithmen zur Lösung von Containerbeladeproblemen. Verlag Dr. Köster, Berlin.

 

Articles in scientific journals

Moura, A.; Bortfeldt, A. (2016): A two-stage packing problem procedure. In: International Transactions In Operational Research (in press), DOI: 10.1111/itor.12251.

Bortfeldt, A.; Hahn, T.; Männel, D.; Mönch, L. (2015): Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints. In: European Journal of Operational Research 243, 82-96.

Bortfeldt, A. (2013): A reduction approach for solving the rectangle packing area minimization problem. In: European Journal of Operational Research 224, 486–496.

Bortfeldt, A.; Homberger, J. (2013): Packing first, routing second – A heuristic for the vehicle routing and loading problem. In: Computers & Operations Research 40, 873–885.

Bortfeldt, A.; Wäscher, G. (2013): Constraints in container loading – A state-of-the-art review. In: European Journal of Operational Research 229, 1–20.

Bortfeldt, A. (2012): Hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. In: Computers & Operations Research 39, 2248–2257.

Bortfeldt, A.; Forster, F. (2012): A tree search procedure for the container pre-marshalling problem. In: European Journal of Operational Research 217, 531–540.

Bortfeldt, A.; Jungmann, S. (2012): A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint. In: Annals of Operations Research 196, 53–71.

Forster, F.; Bortfeldt, A. (2012): A tree search procedure for the container relocation problem. In: Computers & Operations Research 39, 299–309.

Mack, D.; Bortfeldt, A. (2012): A heuristic for solving large bin packing problems in two and three dimensions. In: Central European Journal of Operations Research 20, 337–354.

Kubach, T.; Bortfeldt, A.; Tilli T.; Gehring H. (2011): Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid. In: Asia-Pacific Journal of Operational Research 28, 739–753.

Fanslau, T.; Bortfeldt, A. (2010): A tree search algorithm for solving the container loading problem. In: Informs Journal on Computing 22, 222–235.

Bortfeldt, A.; Winter, T. (2009): A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces. In: International Transactions in Operational Research 16, 685–713.

Kubach, T.; Bortfeldt, A., Gehring, H. (2009): Parallel greedy algorithms for packing unequal circles into a strip or a rectangle. In: Central European Journal of Operations Research 17, 461–477.

Bortfeldt, A.; Mack, D. (2007): A heuristic for the three-dimensional strip packing problem. In: European Journal of Operational Research 183, 1267–1279.

Papke, T.; Bortfeldt, A.; Gehring, H. (2007): Software applications to a real-world cutting problem of a german wood panel manufacturer – A case study. In: WSEAS Transactions on Information Science & Applications 4, 932–939.

Bortfeldt, A. (2006): A genetic algorithm for the two-dimensional strip-packing problem. In: European Journal of Operational Research 172, 814–837. 

Mack, D.; Bortfeldt, A.; Gehring, H. (2004): A parallel hybrid local search algorithm for the container loading problem. In: International Transactions in Operational Research 11, 511–534. 

Bortfeldt, A.; Gehring, H.; Mack, D. (2003): A parallel tabu search algorithm for solving the container problem. In: Parallel Computing 29, 641–662.

Gehring, H.; Bortfeldt, A. (2002): A parallel genetic algorithm for solving the container loading problem.  In: International Transactions of Operational Research 9, 497–511.

Bortfeldt, A.; Gehring, H. (2001): A hybrid genetic algorithm for the container loading problem. In: European Journal of Operational Research 131, 143–161.

Bortfeldt, A. (2000): Eine Heuristik für Multiple Containerladeprobleme. In: OR Spektrum. 22, 239–261.

Bortfeldt, A.; Gehring, H. (1998): Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat. In: OR Spektrum 20, 237–250.

Gehring, H.; Bortfeldt, A. (1997): A genetic algorithm for solving the container loading problem. In: International Transactions of Operational Research 4, 401–418.

 

Articles in books and proceedings

Bortfeldt, A.; Hahn, T.; Mönch, L. (2013): A hybrid algorithm for the vehicle routing problem with backhauls and 3D loading constraints. In: Proceedings X Metaheuristic International Conference (MIC) 2013, Singapore, 59-61.

Forster, F.; Bortfeldt, A. (2012): A tree search procedure for the container retrieval problem. In: Klatte, D.; Lüthi, H. J.; Schmedders, K. (Eds.): Operations Research Proceedings 2011. Selected Papers of the International Conference on Operations Research (OR 2011). Springer, Berlin, Part 8, 257-262.

Bortfeldt, A.; Homberger, J. (2008): Packing first, routing second – A heuristic for the vehicle routing and loading problem. In: Bortfeldt, A. et al. (Eds.): Intelligent Decision Support – Current Challenges and Approaches, Intelligente Entscheidungsunterstützung – Aktuelle Herausforderungen und Lösungsansätze. Deutscher Universitäts-Verlag, Wiesbaden, 91-113.

Bortfeldt, A.; Winter, T. (2008): Ein genetischer Algorithmus für das beschränkte zweidimensionale Knapsackproblem ohne Guillotineschnitt-Bedingung. In: Mönch, L.; Pankratz, G. (Eds.): Intelligente Systeme zur Entscheidungsunterstützung, SCS Publishing House, San Diego/Erlangen, 179–188.

Bortfeldt, A.; Gehring, H. (2006): New large benchmark instances for the two-dimensional strip packing problem with rectangular pieces. Proceedings of the 39th Annual Hawaii International Conference on System Sciences 2006 (HICSS '06), Volume 2, 30b.

Jacobsen, F.; Bortfeldt, A.; Gehring, H. (2006): Timetabling at German secondary schools: Tabu search versus constraint programming. In: E. K. Burke, H. Rudova (Eds.), PATAT '06, Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, 439–442.

Gehring, H.; Bortfeldt, A.; Desef, T. (2005): Modellierung und Lösung des Timetabling-Problems an deutschen Grundschulen. In: Mroß, D.; Thielmann-Holzmayer (Eds.), Zeitgemäßes Personalmanagement, Gabler, Wiesbaden, 269-286.

Bortfeldt, A. (2004): A heuristic for the container pre-marshalling problem. In: Bertram, V.; Armada, M. (Eds.): Proceedings of the 3rd International Conference on Computer and IT Applications in the Maritime Industries (COMPIT '04), Siguenza (Spanien), 9.-12. Mai, 419–429.

Desef, T.; Bortfeldt, A.; Gehring, H. (2004): A tabu search algorithm for solving the timetabling problem for German primary schools. In: E. K. Burke, M. Trick (Eds.), PATAT 2004, Proceedings of the 5th Internat. Conf. on the Practice and Theory of Automated Timetabling, Pittsburgh, PA, 465–470.

Levenhagen, J.; Bortfeldt, A.; Gehring, H. (2001): Path tracing in genetic algorithms applied to the multiconstrained knapsack problem. In: Boers, E.J.W. et al. (Eds.): EvoWorkshop 2001, LNCS 2037 - Applications of Evolutionary Computing, Springer-Verlag, Berlin/Heidelberg,
40–49.

Bortfeldt A.; Gehring, H. (1999): Two metaheuristics for strip packing problems. In: Despotis, D.K.; Zopounidis, C. (Eds.): Proceedings of the 5th International Conference of the Decision Sciences Institute, Athen, Vol. 2, 1153–1156.

Bortfeldt A.; Gehring, H. (1999): Zur Behandlung von Restriktionen bei der Stauraumoptimierung am Beispiel eines genetischen Algorithmus für das Containerbeladeproblem. In: Kopfer, H.; Bierwirth, C. (Eds.): Logistik Management - Intelligente I+K Technologien, Springer Verlag, Berlin, 83–100.

Gehring, H.; Bortfeldt, A. (1999): Ein verteilt-paralleles Tabu Search-Verfahren für Containerladeprobleme mit schwach heterogenem Kistenvorrat. in: Kall, P.; Lüthi, H.-J. (Eds.): Operations Research Proceedings 1998, Springer Verlag, Berlin, 220-227.

Bortfeldt, A.; Gehring, H. (1998): Applying tabu search to container loading problems. In: Kischka, P. et al. (Eds.) Operations Research Proceedings 1997, Springer Verlag, Berlin, 533-538.

 

Working papers (sample)

Moura, A.; Bortfeldt, A. (2010): A two-stage packing procedure for a Portuguese trading company. Diskussionsbeitrag Nr. 457, FernUniversität Hagen, Fakultät für Wirtschaftswissenschaft.

Blaimer, N.; Bortfeldt, A.; Pankratz, G. (2010): Patterns in object-oriented analysis. Diskussionsbeitrag Nr. 451, FernUniversität Hagen, Fakultät für Wirtschaftswissenschaft.

Pleß, V.; Pankratz, G.; Bortfeldt, A. (2005): The tariff pattern: An analysis pattern for the flexible parameterization of charges, fees and prices. Diskussionsbeitrag Nr. 386, FernUniversität Hagen, Fachbereich Wirtschaftswissenschaft.

Desef T.; Bortfeldt, A.; Gehring H. (2004): Ein Tabu Search-Verfahren zur Lösung des Timetabling-Problems an deutschen Grundschulen, Diskussionsbeitrag Nr. 364, FernUniversität Hagen, Fachbereich Wirtschaftswissenschaft.

Bortfeldt, A. (2003): Ein genetischer Algorithmus für das zweidimensionale Strip-Packing-Problem. In: Bortfeldt, A.; Fischer, T.; Homberger, J.; Pankratz, G.; Strangmeier, R.: Planen, Lernen, Optimieren – Beiträge zu Logistik und E-Learning. Festschrift für Hermann Gehring zum 60. Geburtstag, Diskussionsbeitrag Nr. 338, FernUniversität Hagen, Fachbereich Wirtschaftswissenschaft, 1–35.

Gehring, H.; Neubert, B.; Karpf, C.; Bortfeldt, A. (1999): Ein Entscheidungsunterstützungssystem zur Aktienanlage auf der Basis eines genetisch lernenden neuronalen Netzwerks. Diskussionsbeitrag Nr. 268, FernUniversität Hagen, Fachbereich Wirtschaftswissenschaft.

Last Modification: 25.09.2018 - Contact Person:

Sie können eine Nachricht versenden an: Webmaster
Sicherheitsabfrage:
Captcha
 
Lösung: