A statistical learning based approach for parameter fine-tuning of metaheuristics

Metaheuristics are approximation methods used to solve combinatorial optimization problems. Their performance usually depends on a set of parameters that need to be adjusted. The selection of appropriate parameter values causes a loss of efficiency, as it requires time, and advanced analytical and problem-specific skills. This paper provides an overview of the principal approaches to tackle the Parameter Setting Problem, focusing on the statistical procedures employed so far by the scientific community. In addition, a novel methodology is proposed, which is tested using an already existing algorithm for solving the Multi-Depot Vehicle Routing Problem.Peer ReviewedPostprint (published version

A statistical learning based approach for parameter fine-tuning of metaheuristics

Metaheuristics are approximation methods used to solve combinatorial optimization problems. Their performance usually depends on a set of parameters that need to be adjusted. The selectionof appropriate parameter values causes a loss of efficiency, as it requires time, and advanced analytical and problem-specific skills. This paper provides an overview of the principal approaches to tackle the Parameter Setting Problem, focusing on the statistical procedures employed so far by the scientific community. In addition, a novel methodology is proposed, which is tested using an already existing algorithm for solving the Multi-Depot Vehicle Routing Problem

A statistical learning based approach for parameter fine-tuning of metaheuristics

Metaheuristics are approximation methods used to solve combinatorial optimization problems. Their performance usually depends on a set of parameters that need to be adjusted. The selectionof appropriate parameter values causes a loss of efficiency, as it requires time, and advanced analytical and problem-specific skills. This paper provides an overview of the principal approaches to tackle the Parameter Setting Problem, focusing on the statistical procedures employed so far by the scientific community. In addition, a novel methodology is proposed, which is tested using an already existing algorithm for solving the Multi-Depot Vehicle Routing Problem.Peer Reviewe

Optimal staffing under an annualized hours regime using Cross-Entropy optimization

This paper discusses staffing under annualized hours. Staffing is the selection of the most cost-efficient workforce to cover workforce demand. Annualized hours measure working time per year instead of per week, relaxing the restriction for employees to work the same number of hours every week. To solve the underlying combinatorial optimization problem this paper develops a Cross-Entropy optimization implementation that includes a penalty function and a repair function to guarantee feasible solutions. Our experimental results show Cross-Entropy optimization is efficient across a broad range of instances, where real-life sized instances are solved in seconds, which significantly outperforms an MILP formulation solved with CPLEX. In addition, the solution quality of Cross-Entropy closely approaches the optimal solutions obtained by CPLEX. Our Cross-Entropy implementation offers an outstanding method for real-time decision making, for example in response to unexpected staff illnesses, and scenario analysis

Metaheuristics for online drive train efficiency optimization in electric vehicles

Utilization of electric vehicles provides a solution to several challenges in today’s individual mobility. However, ensuring maximum efficient operation of electric vehicles is required in order to overcome their greatest weakness: the limited range. Even though the overall efficiency is already high, incorporating DC/DC converter into the electric drivetrain improves the efficiency level further. This inclusion enables the dynamic optimization of the intermediate voltage level subject to the current driving demand (operating point) of the drivetrain. Moreover, the overall drivetrain efficiency depends on the setup of other drivetrain components’ electric parameters. Solving this complex problem for different drivetrain parameter setups subject to the current driving demand needs considerable computing time for conventional solvers and cannot be delivered in real-time. Therefore, basic metaheuristics are identified and applied in order to assure the optimization process during driving. In order to compare the performance of metaheuristics for this task, we adjust and compare the performance of different basic metaheuristics (i.e. Monte-Carlo, Evolutionary Algorithms, Simulated Annealing and Particle Swarm Optimization). The results are statistically analyzed and based on a developed simulation model of an electric drivetrain. By applying the bestperforming metaheuristic, the efficiency of the drivetrain could be improved by up to 30% compared to an electric vehicle without the DC/DC- converter. The difference between computing times vary between 30 minutes (for the Exhaustive Search Algorithm) to about 0.2 seconds (Particle Swarm) per operating point. It is shown, that the Particle Swarm Optimization as well as the Evolutionary Algorithm procedures are the best-performing methods on this optimization problem. All in all, the results support the idea that online efficiency optimization in electric vehicles is possible with regard to computing time and success probability

A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times

Green transportation is becoming relevant in the context of smart cities, where the use of electric vehicles represents a promising strategy to support sustainability policies. However the use of electric vehicles shows some drawbacks as well, such as their limited driving-range capacity. This paper analyses a realistic vehicle routing problem in which both driving-range constraints and stochastic travel times are considered. Thus, the main goal is to minimize the expected time-based cost required to complete the freight distribution plan. In order to design reliable Routing plans, a simheuristic algorithm is proposed. It combines Monte Carlo simulation with a multi-start metaheuristic, which also employs biased-randomization techniques. By including simulation, simheuristics extend the capabilities of metaheuristics to deal with stochastic problems. A series of computational experiments are performed to test our solving approach as well as to analyse the effect of uncertainty on the routing plans.Peer Reviewe

Adaptiver Suchansatz zur multidisziplinären Optimierung von Leichtbaustrukturen unter Verwendung hybrider Metaheuristik

Within the last few years environmental regulations, safety requirements and market competitions forced the automotive industry to open up a wide range of new technologies. Lightweight design is considered as one of the most innovative concepts to fulfil environmental, safety and many other objectives at competitive prices. Choosing the best design and production process in the development period is the most significant link in the automobile production chain. A wide range of design and process parameters needs to be evaluated to achieve numerous goals of production. These goals often stand in conflict with each other. In addition to the variation of the concepts and following the objectives, some limitations such as manufacturing restrictions, financial limits, and deadlines influence the choice of the best combination of variables. This study introduces a structural optimization tool for assemblies made of sheet metal, e.g. the automobile body, based on parametrization and evaluation of concepts in CAD and CAE. This methodology focuses on those concepts, which leads to the use of the right amount of light and strong material in the right place, instead of substituting the whole structure with the new material. An adaptive hybrid metaheuristic algorithm is designed to eliminate all factors that would lead to a local minimum instead of global optimum. Finding the global optimum is granted by using some explorative and exploitative search heuristics, which are intelligently organized by a central controller. Reliability, accuracy and the speed of the proposed algorithm are validated via a comparative study with similar algorithms for an academic optimization problem, which shows valuable results. Since structures might be subject to a wide range of load cases, e.g. static, cyclic, dynamic, temperature-dependent etc., these requirements need to be addressed by a multidisciplinary optimization algorithm. To handle the nonlinear response of objectives and to tackle the time-consuming FEM analyses in crash situations, a surrogate model is implemented in the optimization tool. The ability of such tool to present the optimum results in multi-objective problems is improved by using some user-selected fitness functions. Finally, an exemplary sub-assembly made of sheet metal parts from a car body is optimized to enhance both, static load case and crashworthiness.Die Automobilindustrie hat in den letzten Jahren unter dem Druck von Umweltvorschriften, Sicherheitsanforderungen und wettbewerbsfähigem Markt neue Wege auf dem Gebiet der Technologien eröffnet. Leichtbau gilt als eine der innovativsten und offenkundigsten Lösungen, um Umwelt- und Sicherheitsziele zu wettbewerbsfähigen Preisen zu erreichen. Die Wahl des besten Designs und Verfahrens für Produktionen in der Entwicklungsphase ist der wichtigste Ring der Automobilproduktionskette. Um unzählige Produktionsziele zu erreichen, müssen zahlreiche Design- und Prozessparameter bewertet werden. Die Anzahl und Variation der Lösungen und Ziele sowie einige Einschränkungen wie Fertigungsbeschränkungen, finanzielle Grenzen und Fristen beeinflussen die Auswahl einer guten Kombination von Variablen. In dieser Studie werden strukturelle Optimierungswerkzeuge für aus Blech gefertigte Baugruppen, z. Karosserie, basierend auf Parametrisierung und Bewertung von Lösungen in CAD bzw. CAE. Diese Methodik konzentriert sich auf die Lösungen, die dazu führen, dass die richtige Menge an leichtem / festem Material an der richtigen Stelle der Struktur verwendet wird, anstatt vollständig ersetzt zu werden. Eine adaptive Hybrid-Metaheuristik soll verhindern, dass alle Faktoren, die Bedrohungsoptimierungstools in einem lokalen Minimum konvergieren, anstelle eines globalen Optimums. Das Auffinden des globalen Optimums wird durch einige explorative und ausbeuterische Such Heuristiken gewährleistet. Die Zuverlässigkeit, Genauigkeit und Geschwindigkeit des vorgeschlagenen Algorithmus wird mit ähnlichen Algorithmen in akademischen Optimierungsproblemen validiert und führt zu respektablen Ergebnissen. Da Strukturen möglicherweise einem weiten Bereich von Lastfällen unterliegen, z. statische, zyklische, dynamische, Temperatur usw. Möglichkeit der multidisziplinären Optimierung wurde in Optimierungswerkzeugen bereitgestellt. Um die nichtlineare Reaktion von Zielen zu überwinden und um den hohen Zeitverbrauch von FEM-Analysen in Absturzereignissen zu bewältigen, könnte ein Ersatzmodell vom Benutzer verwendet werden. Die Fähigkeit von Optimierungswerkzeugen, optimale Ergebnisse bei Problemen mit mehreren Zielsetzungen zu präsentieren, wird durch die Verwendung einiger vom Benutzer ausgewählten Fitnessfunktionen verbessert. Eine Unterbaugruppe aus Blechteilen, die zur Automobilkarosserie gehören, ist optimiert, um beide zu verbessern; statischer Lastfall und Crashsicherheit