@misc{DeeFuegenschuhKaimakamis, author = {Dee, Robin and F{\"u}genschuh, Armin and Kaimakamis, George}, title = {The Unit Re-Balancing Problem}, series = {Mathematics}, volume = {9}, journal = {Mathematics}, number = {24}, issn = {2227-7390}, doi = {10.3390/math9243205}, language = {en} } @incollection{FuegenschuhMarahrensJohannsmannetal., author = {F{\"u}genschuh, Armin and Marahrens, S{\"o}nke and Johannsmann, Leonie M. and Matuszewski, Sandra and M{\"u}llenstedt, Daniel and Schmidt, Johannes}, title = {Using Computer-Generated Virtual Realities, Operations Research, and Board Games for Conflict Simulations}, series = {Simulation and Wargaming}, booktitle = {Simulation and Wargaming}, editor = {Turnitsa, Charles and Blais, Curtis Blais and Tolk, Andreas}, publisher = {John Wiley \& Sons, Inc.}, address = {Hoboken, NJ}, isbn = {978-1-119-60478-5}, doi = {10.1002/9781119604815}, pages = {273 -- 287}, language = {en} } @techreport{BeisegelBuhlIzaretal., author = {Beisegel, Jesse and Buhl, Johannes and Izar, Rameez and Schmidt, Johannes and Bambach, Markus and F{\"u}genschuh, Armin}, title = {Mixed-integer programming for additive manufacturing}, editor = {F{\"u}genschuh, Armin}, address = {Cottbus}, doi = {10.26127/BTUOpen-5731}, pages = {28}, language = {en} } @misc{SchmidtFuegenschuh, author = {Schmidt, Johannes and F{\"u}genschuh, Armin}, title = {Trajectory optimization for arbitrary layered geometries in wire-arc additive manufacturing}, series = {Optimization and Engineering}, volume = {25}, journal = {Optimization and Engineering}, issn = {1573-2924}, doi = {10.1007/s11081-023-09813-z}, pages = {529 -- 553}, language = {en} } @misc{GnegelFuegenschuh, author = {Gnegel, Fabian and F{\"u}genschuh, Armin}, title = {Branch-and-refine for solving time-expanded MILP formulations}, series = {Computers \& Operations Research}, volume = {Vol. 149}, journal = {Computers \& Operations Research}, issn = {1873-765X}, doi = {10.1016/j.cor.2022.106043}, pages = {1 -- 15}, language = {en} } @misc{SchmidtFuegenschuh, author = {Schmidt, Johannes and F{\"u}genschuh, Armin}, title = {A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles}, series = {Computational Optimization and Applications}, volume = {85}, journal = {Computational Optimization and Applications}, number = {1}, issn = {1573-2894}, doi = {10.1007/s10589-023-00450-x}, pages = {293 -- 335}, language = {en} } @misc{SchmidtFuegenschuh, author = {Schmidt, Johannes and F{\"u}genschuh, Armin}, title = {Temperature-Based Trajectory Planning for Surfaces in Wire- Arc Additive Manufacturing}, series = {Operations Research Proceedings 2022 : Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Karlsruhe, Germany, September 6-9, 2022}, journal = {Operations Research Proceedings 2022 : Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Karlsruhe, Germany, September 6-9, 2022}, editor = {Grothe, Oliver and Nickel, Stefan and Rebennack, Steffen and Stein, Oliver}, publisher = {Springer}, address = {Heidelberg}, isbn = {978-3-031-24906-8}, pages = {539 -- 545}, language = {en} } @incollection{BeisegelBuhlIsraretal., author = {Beisegel, Jesse and Buhl, Johannes and Israr, Rameez and Schmidt, Johannes and Bambach, Martin and F{\"u}genschuh, Armin}, title = {Mixed-Integer Programming Models for Two Metal Additive Manufacturing Methods}, series = {Mathematical Methods for Objects Reconstruction}, booktitle = {Mathematical Methods for Objects Reconstruction}, editor = {Cristiani, Emiliano and Falcone, Maurizio and Tozza, Silvia}, publisher = {Springer}, address = {Heidelberg}, isbn = {978-981-9907-75-5}, pages = {121 -- 155}, language = {en} } @techreport{SchmidtFuegenschuh, author = {Schmidt, Johannes and F{\"u}genschuh, Armin}, title = {Trajectory optimization for arbitrary layered geometries in wire-arc additive manufacturing}, address = {Cottbus ; Senftenberg}, doi = {10.26127/BTUOpen-6267}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-62678}, pages = {21}, language = {en} } @misc{GnegelSchaudtClausenetal., author = {Gnegel, Fabian and Schaudt, Stefan and Clausen, Uwe and F{\"u}genschuh, Armin}, title = {A graph-refinement algorithm to minimize squared delivery delays using parcel robots}, series = {Mathematics}, volume = {12}, journal = {Mathematics}, number = {20}, publisher = {MDPI AG}, issn = {2227-7390}, doi = {10.3390/math12203201}, pages = {27}, language = {en} } @misc{AliSarkarAlietal., author = {Ali, Irfan and Sarkar, Biswajit and Ali, Syed Mithun and F{\"u}genschuh, Armin}, title = {Editorial: Environmental waste and renewable energy optimization for the sustainable development goals achievement}, series = {Frontiers in Environmental Science}, volume = {11}, journal = {Frontiers in Environmental Science}, issn = {2296-665X}, doi = {10.3389/fenvs.2023.1167835}, language = {en} } @misc{FuegenschuhLorenzPelz, author = {F{\"u}genschuh, Armin and Lorenz, Ulf and Pelz, Peter F.}, title = {OPTE special issue on technical operations research (TOR)}, series = {Optimization and Engineering}, volume = {22}, journal = {Optimization and Engineering}, number = {2}, issn = {1389-4420}, doi = {10.1007/s11081-021-09640-0}, pages = {581 -- 586}, language = {en} } @misc{RahmanShaikhAlietal., author = {Rahman, Md Sadikur and Shaikh, Ali Akbar and Ali, Irfan and Bhunia, Asoke Kumar and F{\"u}genschuh, Armin}, title = {A Theoretical Framework for Optimality Conditions of Nonlinear Type-2 Interval-Valued Unconstrained and Constrained Optimization Problems Using Type-2 Interval Order Relations}, series = {Mathematics}, volume = {9}, journal = {Mathematics}, number = {8}, issn = {2227-7390}, doi = {10.3390/math9080908}, language = {en} } @misc{Fuegenschuh, author = {F{\"u}genschuh, Armin}, title = {MEDEVAC mission planning and decision making with mixed-integer programming and wargaming}, series = {Proceedings of the 18th NATO Operations Research and Analysis (OR\&A) Conference}, volume = {STO-MP-SAS-192}, journal = {Proceedings of the 18th NATO Operations Research and Analysis (OR\&A) Conference}, publisher = {NATO Science and Technology Organization (STO)}, isbn = {978-92-837-2580-0}, doi = {10.14339/STO-MP-SAS-192-15-PDF}, pages = {1 -- 14}, abstract = {In the highly dynamic environment of military operations, efficient medical evacuation (MEDEVAC) of casualties is a critical strategic challenge. This paper presents a method for planning MEDEVAC missions using mathematical optimization and gamification. By applying Mixed-Integer Programming (MIP), a mathematical optimization technique, to solve a MEDEVAC dispatching and routing problem, a structured approach to decision making in emergency situations is presented. Our MIP model enables the detailed consideration of operational conditions and the mission support with combat helicopters as escorts, and thus improves the strategic planning and efficiency of MEDEVAC operations. When it comes to balance mission safety versus execution speed, we will enter the realm of multicriteria optimization models. As a further aspect, the role of gamification is emphasized by developing a board game that simulates the planning task and thus promotes understanding of the planning software. This approach allows planners to compare the quality of their manual planning with the computer-generated solution, improve their own planning skills and realize the benefits of software support for automated, AI- (Artificial Intelligence-) -assisted planning.}, language = {en} } @techreport{ZellFuegenschuh, author = {Zell, Sascha and F{\"u}genschuh, Armin}, title = {Optimizing autonomous unmanned aircraft system deployment locations for enhanced wildfire detection and monitoring}, publisher = {Brandenburgische Technische Universit{\"a}t Cottbus-Senftenberg}, address = {Cottbus}, issn = {2627-6100}, doi = {10.26127/BTUOpen-6942}, pages = {16}, abstract = {The increase in the frequency and severity of wildfires as a symptom of climate change requires innovative methods of wildfire fighting. For this reason, we propose a framework for an autonomous Unmanned Aircraft System (UAS), consisting of a fleet of Micro Air Vehicles (MAVs) stored in purpose-built hangars. The intention is to deploy the UAS as the first responder to an alarm and have the sensor-equipped MAVs monitor the target area even before other standard firefighting vehicles have arrived. The focus of this paper is primarily on the development and application of a location-allocation optimization Mixed-Integer Linear Programming (MILP) model that selects different MAV and hangar types and locates them, with the objective of approaching the target area as quickly as possible while guaranteeing a certain monitoring time at the scene. The model is applied to a large, sparsely populated, rural operational area, around a third of which consists of forest in the South of Brandenburg, Germany. The spatial demand is measured through an easily reproducible and transferable open data approach. Finally, several instances with different fixed numbers of hangars and MAVs to be set up are solved by the commercial state-of-the-art solver CPLEX and analyzed for their computation time.}, language = {en} } @incollection{SchmidtFuegenschuh, author = {Schmidt, Johannes and F{\"u}genschuh, Armin}, title = {A column generation approach for weighted set packing problems with forbidden pairs}, series = {Operations Research Proceedings 2023 : selected papers of the Annual International Conference of the German Operations Research Society (GOR), Germany, August 29-September 1, 2023}, booktitle = {Operations Research Proceedings 2023 : selected papers of the Annual International Conference of the German Operations Research Society (GOR), Germany, August 29-September 1, 2023}, publisher = {Springer Nature Switzerland}, address = {Cham}, isbn = {978-3-031-58405-3}, issn = {2731-040X}, doi = {10.1007/978-3-031-58405-3_14}, pages = {107 -- 113}, abstract = {The weighted set packing problem (WSPP) is a variant of the well-known set packing problem, assigning a weight to every considered subset of a given finite base set. Its solution is a maximum sum-weight, element-disjoint covering of the base set. Using its formulation as a binary linear program (BLP), every column of the constraint matrix describes one of the given subsets. Thus, column generation (CG) provides a good solution method, generating iteratively only promising subsets as candidates for the covering. We consider an extension of the WSPP, where forbidden pairs are taken into consideration, i.e., there can be pairs of subsets that cannot be chosen at the same time, and adapt CG to derive a new solution algorithm to solve the resulting BLP. At each iteration, the optimal solution obtained with CG is checked for potential conflicts and either they are resolved locally without changing the objective function value or a new linear constraint forbidding the conflicting pair of columns is added. Then the CG procedure starts again. The applicability of this approach is shown for a team orienteering problem involving two unmanned aerial vehicles that must maintain safety distances between them.}, language = {en} } @techreport{SchmidtFuegenschuh, author = {Schmidt, Johannes and F{\"u}genschuh, Armin}, title = {Inter-sample avoidance in trajectory planning via an integer-polytope formulation for mixed-integer optimization}, publisher = {Brandenburgische Technische Universit{\"a}t Cottbus-Senftenberg}, address = {Cottbus}, issn = {2627-6100}, doi = {10.26127/BTUOpen-7169}, pages = {19}, abstract = {Autonomous vehicles such as drones or mobile robots must plan trajectories that avoid static obstacles. Their dynamics are captured by Newton's laws and discretized numerically, so the vehicle's position is tracked only at finitely many sample points. The resulting information gap allows a path to cut through an obstacle while still appearing feasible at all samples, a phenomenon called corner cutting. Finer time grids mitigate but never eliminate this artefact and increase computation time. We propose a new inter-sample avoidance scheme for polyhedral obstacles. The facet-defining half-spaces partition the three-dimensional mission space into sub-domains that we encode with binary sign vectors. Feasible one-step moves correspond to a specific subset of these vectors; we (i) enumerate that set exhaustively and (ii) give an integer-polytope formulation that enforces it without additional state variables or extra time steps. For planar motion with a single triangular no-fly zone we prove that the formulation is tight-the polytope equals the convex hull of its 0/1 points. The method is compared qualitatively with existing inter-sample avoidance techniques and its limitations are discussed. Computational experiments with a mixed-integer linear programming model for UAV mission planning, solved by Gurobi, demonstrate that the new formulation achieves realistic trajectories at competitive, or lower, solution times}, language = {en} } @techreport{SchmidtFuegenschuhBoeschow, author = {Schmidt, Johannes and F{\"u}genschuh, Armin and B{\"o}schow, Moritz}, title = {Sports league scheduling with minitournaments}, publisher = {Brandenburgische Technische Universit{\"a}t Cottbus-Senftenberg}, address = {Cottbus}, issn = {2627-4019}, doi = {10.26127/BTUOpen-7029}, pages = {15}, abstract = {In amateur or youth sports leagues, the teams play all matches during their leisure time. Thus, a schedule with a smaller number of game days is preferred and the teams are willing to partly renounce on the fairness for this by playing minitournaments instead of single matches. In this format, multiple teams meet at one of them and play against each other, reducing the number of necessary game days and required referees at the cost of unevenly distributed home field advantages. The travel times of all teams now depend on their assignment to the respective minitournaments and the choice of the home team. We present a binary linear optimization model to schedule a sports league as a double Round Robin tournament with minitournaments and most evenly distributed home field advantages, yielding a feasible league schedule with minimal total traveling distances for all teams. After adjusting orbital shrinking to break the occurring symmetries in the possible assignments, we discuss the computational efficiency and evaluate an existing schedule for the "Basketball Senioren Landesliga Brandenburg" amateur basketball league in Germany.}, language = {en} }