Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables

2016 ◽  
pp. 782-791 ◽  
Author(s):  
Benjamin Doerr ◽  
Carola Doerr ◽  
Timo Kötzing
Keyword(s):  
Decision Variables

Quasi-Periodic Control Technique for Minimizing Fuel Consumption During Record Vehicle Competition

2013 ◽  
Vol 60 (2) ◽  
pp. 185-197 ◽  
Author(s):  
Paweł Sulikowski ◽  
Ryszard Maronski
Keyword(s):  
Fuel Consumption ◽  
Optimal Control Theory ◽  
Slope Angle ◽  
Control Technique ◽  
Decision Variables ◽  
Aeronautical Engineering ◽  
The One ◽  
Optimal Driving ◽  
The Given ◽  
Engine Power

The problem of the optimal driving technique during the fuel economy competition is reconsidered. The vehicle is regarded as a particle moving on a trace with a variable slope angle. The fuel consumption is minimized as the vehicle covers the given distance in a given time. It is assumed that the run consists of two recurrent phases: acceleration with a full available engine power and coasting down with the engine turned off. The most fuel-efficient technique for shifting gears during acceleration is found. The decision variables are: the vehicle velocities at which the gears should be shifted, on the one hand, and the vehicle velocities when the engine should be turned on and off, on the other hand. For the data of students’ vehicle representing the Faculty of Power and Aeronautical Engineering it has been found that such driving strategy is more effective in comparison with a constant speed strategy with the engine partly throttled, as well as a strategy resulting from optimal control theory when the engine is still active.

scholarly journals A Fuzzy Optimization Model for the Berth Allocation Problem and Quay Crane Allocation Problem (BAP + QCAP) with n Quays

2021 ◽  
Vol 9 (2) ◽  
pp. 152
Author(s):  
Edwar Lujan ◽  
Edmundo Vergara ◽  
Jose Rodriguez-Melquiades ◽  
Miguel Jiménez-Carrión ◽  
Carlos Sabino-Escobar ◽  
...  
Keyword(s):  
Optimization Model ◽  
Fuzzy Optimization ◽  
Optimal Solution ◽  
Allocation Problem ◽  
Berth Allocation ◽  
Triangular Fuzzy Numbers ◽  
Berth Allocation Problem ◽  
Arrival Times ◽  
Decision Variables ◽  
Short Time

This work introduces a fuzzy optimization model, which solves in an integrated way the berth allocation problem (BAP) and the quay crane allocation problem (QCAP). The problem is solved for multiple quays, considering vessels’ imprecise arrival times. The model optimizes the use of the quays. The BAP + QCAP, is a NP-hard (Non-deterministic polynomial-time hardness) combinatorial optimization problem, where the decision to assign available quays for each vessel adds more complexity. The imprecise vessel arrival times and the decision variables—berth and departure times—are represented by triangular fuzzy numbers. The model obtains a robust berthing plan that supports early and late arrivals and also assigns cranes to each berth vessel. The model was implemented in the CPLEX solver (IBM ILOG CPLEX Optimization Studio); obtaining in a short time an optimal solution for very small instances. For medium instances, an undefined behavior was found, where a solution (optimal or not) may be found. For large instances, no solutions were found during the assigned processing time (60 min). Although the model was applied for n = 2 quays, it can be adapted to “n” quays. For medium and large instances, the model must be solved with metaheuristics.

Pareto domain: an invaluable source of process information

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Geraldine Cáceres Sepúlveda ◽  
Silvia Ochoa ◽  
Jules Thibault
Keyword(s):  
Case Studies ◽  
Optimal Solution ◽  
Pareto Optimal ◽  
Process Variables ◽  
Optimal Point ◽  
Decision Variables ◽  
Visualization Tools ◽  
Pareto Domain ◽  
And Performance ◽  
Typical Process

AbstractDue to the highly competitive market and increasingly stringent environmental regulations, it is paramount to operate chemical processes at their optimal point. In a typical process, there are usually many process variables (decision variables) that need to be selected in order to achieve a set of optimal objectives for which the process will be considered to operate optimally. Because some of the objectives are often contradictory, Multi-objective optimization (MOO) can be used to find a suitable trade-off among all objectives that will satisfy the decision maker. The first step is to circumscribe a well-defined Pareto domain, corresponding to the portion of the solution domain comprised of a large number of non-dominated solutions. The second step is to rank all Pareto-optimal solutions based on some preferences of an expert of the process, this step being performed using visualization tools and/or a ranking algorithm. The last step is to implement the best solution to operate the process optimally. In this paper, after reviewing the main methods to solve MOO problems and to select the best Pareto-optimal solution, four simple MOO problems will be solved to clearly demonstrate the wealth of information on a given process that can be obtained from the MOO instead of a single aggregate objective. The four optimization case studies are the design of a PI controller, an SO2 to SO3 reactor, a distillation column and an acrolein reactor. Results of these optimization case studies show the benefit of generating and using the Pareto domain to gain a deeper understanding of the underlying relationships between the various process variables and performance objectives.

scholarly journals Two-stage multi-tasking transform framework for large-scale many-objective optimization problems

2021 ◽  
Author(s):  
Lu Chen ◽  
Handing Wang ◽  
Wenping Ma
Keyword(s):  
Large Scale ◽  
Original Problem ◽  
Optimization Problems ◽  
Reference Points ◽  
Optimization Strategy ◽  
Two Stage ◽  
Decision Space ◽  
Second Stage ◽  
Decision Variables ◽  
Objective Space

AbstractReal-world optimization applications in complex systems always contain multiple factors to be optimized, which can be formulated as multi-objective optimization problems. These problems have been solved by many evolutionary algorithms like MOEA/D, NSGA-III, and KnEA. However, when the numbers of decision variables and objectives increase, the computation costs of those mentioned algorithms will be unaffordable. To reduce such high computation cost on large-scale many-objective optimization problems, we proposed a two-stage framework. The first stage of the proposed algorithm combines with a multi-tasking optimization strategy and a bi-directional search strategy, where the original problem is reformulated as a multi-tasking optimization problem in the decision space to enhance the convergence. To improve the diversity, in the second stage, the proposed algorithm applies multi-tasking optimization to a number of sub-problems based on reference points in the objective space. In this paper, to show the effectiveness of the proposed algorithm, we test the algorithm on the DTLZ and LSMOP problems and compare it with existing algorithms, and it outperforms other compared algorithms in most cases and shows disadvantage on both convergence and diversity.

A system dynamics model for routing and scheduling of cross-dock and transportation in reverse logistics network of perishable goods

2021 ◽  
pp. 1-17
Author(s):  
Pezhman Abbasi Tavallali ◽  
Mohammad Reza Feylizadeh ◽  
Atefeh Amindoust
Keyword(s):  
System Dynamics ◽  
Reverse Logistics ◽  
Logistics Network ◽  
Routing And Scheduling ◽  
Perishable Goods ◽  
Decision Variables ◽  
Proposed Model ◽  
Reverse Logistics Network ◽  
The Cross ◽  
Space Requirements

Cross-dock is defined as the practice of unloading goods from incoming vehicles and loading them directly into outbound vehicles. Cross-docking can simplify supply chains and help them to deliver goods to the market more swiftly and efficiently by removing or minimizing warehousing costs, space requirements, and use of inventory. Regarding the lifetime of perishable goods, their routing and scheduling in the cross-dock and transportation are of great importance. This study aims to analyze the scheduling and routing of cross-dock and transportation by System Dynamics (SD) modeling to design a reverse logistics network for the perishable goods. For this purpose, the relations between the selected variables are first specified, followed by assessing and examining the proposed model. Finally, four scenarios are developed to determine the optimal values of decision variables. The results indicate the most influencing factors on reaching the optimal status is the minimum distance between the cross-dock and destination, rather than increasing the number of manufactories.

scholarly journals A Planning Method for Partially Grid-Connected Bus Rapid Transit Systems Operating with In-Motion Charging Batteries

Energies ◽  
2021 ◽  
Vol 14 (9) ◽  
pp. 2550
Author(s):  
Andrés E. Díez ◽  
Mauricio Restrepo
Keyword(s):  
Planning Method ◽  
Bus Rapid Transit ◽  
Rapid Transit ◽  
Infrastructure Planning ◽  
Transit Systems ◽  
Power Train ◽  
Medium Voltage ◽  
Grid Connection ◽  
Electric Bus ◽  
Decision Variables

This paper presents an electrical infrastructure planning method for transit systems that operate with partially grid-connected vehicles incorporating on-board batteries. First, the state-of-the-art of electric transit systems that combine grid-connected and battery-based operation is briefly described. Second, the benefits of combining a grid connection and battery supply in Bus Rapid Transit (BRT) systems are introduced. Finally, the planning method is explained and tested in a BRT route in Medellin, Colombia, using computational simulations in combination with real operational data from electric buses that are currently operating in this transit line. Unlike other methods and approaches for Battery Electric Bus (BEB) infrastructure planning, the proposed technique is system-focused, rather than solely limited to the vehicles. The objective of the technique, from the vehicle’s side, is to assist the planner in the correct sizing of batteries and power train capacity, whereas from the system side the goal is to locate and size the route sections to be electrified. These decision variables are calculated with the objective of minimizing the installed battery and achieve minimum Medium Voltage (MV) network requirements, while meeting all technical and reliability conditions. The method proved to be useful to find a minimum feasible cost solution for partially electrifying a BRT line with In-motion Charging (IMC) technology.

Market Segment Response to the Marketing Decision Variables

1974 ◽  
Vol 11 (4) ◽  
pp. 399-412 ◽  
Author(s):  
John M. Mccann
Keyword(s):  
Panel Data ◽  
Econometric Analysis ◽  
Market Segment ◽  
Market Segments ◽  
Marketing Decision ◽  
Decision Variables ◽  
Managerial Implications ◽  
Differential Responsiveness

This article presents the results of an econometric analysis of panel data directed toward the measurement of differential responsiveness of market segments to changes in advertising expenditures, price, and the level of dealing. Evidence is found for considerable differences in levels of response, and the managerial implications of these differences are investigated.

scholarly journals A New Methodology for Solving Trajectory Planning and Dynamic Load-Carrying Capacity of a Robot Manipulator

2016 ◽  
Vol 2016 ◽  
pp. 1-28 ◽  
Author(s):  
Wanjin Guo ◽  
Ruifeng Li ◽  
Chuqing Cao ◽  
Xunwei Tong ◽  
Yunfeng Gao
Keyword(s):  
Trajectory Planning ◽  
Dynamic Load ◽  
Carrying Capacity ◽  
Robot Manipulator ◽  
Time Interval ◽  
Planning Problem ◽  
Load Carrying Capacity ◽  
Objective Functions ◽  
Decision Variables ◽  
Load Carrying

A new methodology using a direct method for obtaining the best found trajectory planning and maximum dynamic load-carrying capacity (DLCC) is presented for a 5-degree of freedom (DOF) hybrid robot manipulator. A nonlinear constrained multiobjective optimization problem is formulated with four objective functions, namely, travel time, total energy involved in the motion, joint jerks, and joint acceleration. The vector of decision variables is defined by the sequence of the time-interval lengths associated with each two consecutive via-points on the desired trajectory of the 5-DOF robot generalized coordinates. Then this vector of decision variables is computed in order to minimize the cost function (which is the weighted sum of these four objective functions) subject to constraints on joint positions, velocities, acceleration, jerks, forces/torques, and payload mass. Two separate approaches are proposed to deal with the trajectory planning problem and the maximum DLCC calculation for the 5-DOF robot manipulator using an evolutionary optimization technique. The adopted evolutionary algorithm is the elitist nondominated sorting genetic algorithm (NSGA-II). A numerical application is performed for obtaining best found solutions of trajectory planning and maximum DLCC calculation for the 5-DOF hybrid robot manipulator.

Sign in / Sign up

Export Citation Format

Share Document