Forschungszentrum Business Informatics
Filtern
Erscheinungsjahr
Dokumenttyp
- Wissenschaftlicher Artikel (54)
- Konferenzveröffentlichung (44)
- Teil eines Buches (Kapitel) (9)
- Bericht (4)
- Dissertation (3)
- Buch (Monographie) (2)
Institut
Schlagworte
ÖMG Conference 2019
(2019)
On the extension of digital ecosystems for SCM and customs with distributed ledger technologies
(2019)
Global supply chains represent the backbone of the modern manufacturing industry. Planning of global supply chains still represents a major hurdle, mainly because of the high complexity and unforeseen disruptions that have to be mastered for meeting the different logistics windows in a globally distributed production environment. Trust in supply chains is an additional challenge. A major – albeit sometimes overlooked - part of Supply Chain Management (SCM) is the management and integration of customs processes, clearing of tariffs, (re-)billing of customers, and fulfilling other legal requirements related to crossing borders, ranging from environmental standards over goods inspection to general paper work. With the exception of work offered by the World Customs Organization (WCO) the issue of customs and blockchain is still underrepresented in research and practice. In this paper, we look at innovations that drive the current ICTenabled SCM research and how these can be combined with smart customs management. After a literature review and introduction to the state-of-the-art, we list potential trust-based innovations for SCM and customs in digital business ecosystems. Based upon the innovations we also describe a requirements analysis of existing distributed ledger technologies (requirements for system layout, system configuration, system governance). A description of the prototype for the Lake Constance region – on which we are currently working – concludes the paper.
In engineering design, optimization methods are frequently used to improve the initial design of a product. However, the selection of an appropriate method is challenging since many
methods exist, especially for the case of simulation-based optimization. This paper proposes a systematic procedure to support this selection process. Building upon quality function deployment, end-user and design use case requirements can be systematically taken into account via a decision
matrix. The design and construction of the decision matrix are explained in detail. The proposed
procedure is validated by two engineering optimization problems arising within the design of box-type boom cranes. For each problem, the problem statement and the respectively applied optimization methods are explained in detail. The results obtained by optimization validate the use
of optimization approaches within the design process. The application of the decision matrix shows the successful incorporation of customer requirements to the algorithm selection.
Analysis of the (μ/μI,λ)-CSA-ES with repair by projection applied to a conically constrained problem
(2019)
Stress testing is part of today’s bank risk management and often required by the governing regulatory authority. Performing such a stress test with stress scenarios derived from a distribution, instead of pre-defined expert scenarios, results in a systematic approach in which new severe scenarios can be discovered. The required scenario distribution is obtained from historical time series via a Vector-Autoregressive time series model. The worst-case search, i.e. finding the scenario yielding the most severe situation for the bank, can be stated as an optimization problem. The problem itself is a constrained optimization problem in a high-dimensional search space. The constraints are the box constraints on the scenario variables and the plausibility of a scenario.
The latter is expressed by an elliptic constraint. As the evaluation of the stress scenarios is performed with a simulation tool, the optimization problem can be seen as black-box optimization problem. Evolution Strategy, a well-known optimizer for black-box problems, is applied here. The necessary adaptations to the algorithm are explained and a set of different algorithm design choices are investigated. It is shown that a simple box constraint handling method, i.e. setting variables which violate a box constraint to the respective boundary of the feasible domain, in combination with a repair of implausible scenarios provides good results.
