scholarly journals An integer optimization model and algorithms to support the cost-revenue study and provisory designing warehouses or other storage objects

2018 ◽  
Vol 4 (21) ◽  
pp. 257-269
Author(s):  
Mikalai Miatselski ◽  
Bożena Staruch ◽  
Bogdan Staruch
Keyword(s):  
Exact Solution ◽  
General Problem ◽  
Optimization Model ◽  
Optimization Problem ◽  
System Analysis ◽  
Software Tools ◽  
Integer Optimization ◽  
The Cost ◽  
Special Case ◽  
Basic Constraint

An optimization model for the cost–revenue study at the stage of system analysis and preliminary designs of storage objects such as warehouses, containers, packs and similar objects are developed. Our assumptions motivated by warehouses design lead us to a nonlinear integer optimization problem with the only basic constraint. We present algorithmic methods for obtaining the exact solution to the general problem with emphasizing the special case when both the objective and the constraint functions are increasing. The results of the paper may be used in developing software tools intended for supporting designers.

scholarly journals Cloud Brokering with Bundles: Multi-objective Optimization of Services Selection

2019 ◽  
Vol 44 (4) ◽  
pp. 407-426
Author(s):  
Jedrzej Musial ◽  
Emmanuel Kieffer ◽  
Mateusz Guzek ◽  
Gregoire Danoy ◽  
Shyam S. Wagle ◽  
...  
Keyword(s):  
Optimization Problem ◽  
Real Data ◽  
Cloud Service ◽  
Optimal Choice ◽  
Cloud Services ◽  
Multi Objective Optimization ◽  
Problem Instances ◽  
The Cost ◽  
Special Case ◽  
Single Objective

Abstract Cloud computing has become one of the major computing paradigms. Not only the number of offered cloud services has grown exponentially but also many different providers compete and propose very similar services. This situation should eventually be beneficial for the customers, but considering that these services slightly differ functionally and non-functionally -wise (e.g., performance, reliability, security), consumers may be confused and unable to make an optimal choice. The emergence of cloud service brokers addresses these issues. A broker gathers information about services from providers and about the needs and requirements of the customers, with the final goal of finding the best match. In this paper, we formalize and study a novel problem that arises in the area of cloud brokering. In its simplest form, brokering is a trivial assignment problem, but in more complex and realistic cases this does not longer hold. The novelty of the presented problem lies in considering services which can be sold in bundles. Bundling is a common business practice, in which a set of services is sold together for the lower price than the sum of services’ prices that are included in it. This work introduces a multi-criteria optimization problem which could help customers to determine the best IT solutions according to several criteria. The Cloud Brokering with Bundles (CBB) models the different IT packages (or bundles) found on the market while minimizing (maximizing) different criteria. A proof of complexity is given for the single-objective case and experiments have been conducted with a special case of two criteria: the first one being the cost and the second is artificially generated. We also designed and developed a benchmark generator, which is based on real data gathered from 19 cloud providers. The problem is solved using an exact optimizer relying on a dichotomic search method. The results show that the dichotomic search can be successfully applied for small instances corresponding to typical cloud-brokering use cases and returns results in terms of seconds. For larger problem instances, solving times are not prohibitive, and solutions could be obtained for large, corporate clients in terms of minutes.

scholarly journals An optimization problem for continuous submodular functions

2021 ◽  
Vol 66 (1) ◽  
pp. 211-222
Author(s):  
Laszlo Csirmaz
Keyword(s):  
Optimization Problem ◽  
Submodular Functions ◽  
Minimal Cost ◽  
Open Problems ◽  
Partial Derivatives ◽  
General Optimization Problem ◽  
Function Range ◽  
The Cost ◽  
Entropy Functions ◽  
Special Case

"Real continuous submodular functions, as a generalization of the corresponding discrete notion to the continuous domain, gained considerable attention recently. The analog notion for entropy functions requires additional properties: a real function defined on the non-negative orthant of $\R^n$ is entropy-like (EL) if it is submodular, takes zero at zero, non-decreasing, and has the Diminishing Returns property. Motivated by problems concerning the Shannon complexity of multipartite secret sharing, a special case of the following general optimization problem is considered: find the minimal cost of those EL functions which satisfy certain constraints. In our special case the cost of an EL function is the maximal value of the $n$ partial derivatives at zero. Another possibility could be the supremum of the function range. The constraints are specified by a smooth bounded surface $S$ cutting off a downward closed subset. An EL function is feasible if at the internal points of $S$ the left and right partial derivatives of the function differ by at least one. A general lower bound for the minimal cost is given in terms of the normals of the surface $S$. The bound is tight when $S$ is linear. In the two-dimensional case the same bound is tight for convex or concave $S$. It is shown that the optimal EL function is not necessarily unique. The paper concludes with several open problems."

scholarly journals Explore Truthful Incentives for Tasks with Heterogenous Levels of Difficulty in the Sharing Economy

2019 ◽  
Author(s):  
Pengzhan Zhou ◽  
Xin Wei ◽  
Cong Wang ◽  
Yuanyuan Yang
Keyword(s):  
Resource Allocation ◽  
General Problem ◽  
Incentive Mechanism ◽  
Sharing Economy ◽  
Time Saving ◽  
Online Implementation ◽  
Cost Distribution ◽  
The Cost ◽  
Special Case ◽  
Budget Feasible

Incentives are explored in the sharing economy to inspire users for better resource allocation. Previous works build a budget-feasible incentive mechanism to learn users' cost distribution. However, they only consider a special case that all tasks are considered as the same. The general problem asks for finding a solution when the cost for different tasks varies. In this paper, we investigate this general problem by considering a system with k levels of difficulty. We present two incentivizing strategies for offline and online implementation, and formally derive the ratio of utility between them in different scenarios. We propose a regret-minimizing mechanism to decide incentives by dynamically adjusting budget assignment and learning from users' cost distributions. Our experiment demonstrates utility improvement about 7 times and time saving of 54% to meet a utility objective compared to the previous works.

scholarly journals Fast 10-Point DFT Algorithm for Power System Harmonic Analysis

2021 ◽  
Vol 11 (15) ◽  
pp. 7007
Author(s):  
Janusz P. Paplinski ◽  
Aleksandr Cariow
Keyword(s):  
Computational Complexity ◽  
Power System ◽  
Harmonic Analysis ◽  
Efficient Algorithm ◽  
System Analysis ◽  
Spectral Leakage ◽  
Power System Analysis ◽  
Improve Accuracy ◽  
The Cost ◽  
Harmonic Power

This article presents an efficient algorithm for computing a 10-point DFT. The proposed algorithm reduces the number of multiplications at the cost of a slight increase in the number of additions in comparison with the known algorithms. Using a 10-point DFT for harmonic power system analysis can improve accuracy and reduce errors caused by spectral leakage. This paper compares the computational complexity for an L×10M-point DFT with a 2M-point DFT.

Optimal Order Picking in Carousels Storage System

2012 ◽  
Vol 601 ◽  
pp. 347-353
Author(s):  
Xiong Zhi Wang ◽  
Guo Qing Wang
Keyword(s):  
Approximation Algorithm ◽  
General Problem ◽  
Storage System ◽  
Order Picking ◽  
Total Order ◽  
Experimental Results ◽  
Optimal Order ◽  
Np Hard ◽  
Special Case

We study the order picking problem in carousels system with a single picker. The objective is to find a picking scheduling to minimizing the total order picking time. After showing the problem being strongly in NP-Hard and finding two characteristics, we construct an approximation algorithm for a special case (two carousels) and a heuristics for the general problem. Experimental results verify that the solutions are quickly and steadily achieved and show its better performance.

The Calculation of Photovoltaic System Generation Access Capacity in Distribution Network Based on Probabilistic Power Flow and the PSO Optimization

2012 ◽  
Vol 529 ◽  
pp. 371-375
Author(s):  
Lu Yao Ma ◽  
Shu Jun Yao ◽  
Yan Wang ◽  
Jing Yang ◽  
Long Hui Liu
Keyword(s):  
Distributed Generation ◽  
Power Flow ◽  
Optimization Problem ◽  
Flow Model ◽  
Expansion Method ◽  
Pso Algorithm ◽  
Photovoltaic System ◽  
System Generation ◽  
Probabilistic Power Flow ◽  
The Cost

With the distributed generation such as photovoltaic power system (PVS) is largely introduced into power grid, some significant problems such as system instability problem increase seriously. In order to make full use of PVS and make sure the voltage exceeding probability is limited within a certain range to ensure the power quality, as well as consider the cost of access device, the suitable PVS access node and capacity is important. Based on this problem, this paper establishes the probabilistic power flow model of PVS by introducing the combined Cumulants and the Gram-Charlier expansion method. Also, to solve the nonlinear combinatorial optimization problem, this paper uses PSO algorithm. Finally to get the suitable PVS access node and capacity, also calculate the solution of voltage exceeding probability.

Trajectory Optimization Applied to Space Rendezvous

2013 ◽  
Vol 756-759 ◽  
pp. 3466-3470
Author(s):  
Xu Min Song ◽  
Qi Lin
Keyword(s):  
Simulated Annealing ◽  
Optimization Model ◽  
Trajectory Optimization ◽  
Optimization Problem ◽  
Optimization Method ◽  
Nonlinear Constraints ◽  
Design Variables ◽  
Adaptive Simulated Annealing ◽  
Simulation Results

The trajcetory plan problem of spece reandezvous mission was studied in this paper using nolinear optimization method. The optimization model was built based on the Hills equations. And by analysis property of the design variables, a transform was put forward , which eliminated the equation and nonlinear constraints as well as decreaseing the problem dimensions. The optimization problem was solved using Adaptive Simulated Annealing (ASA) method, and the rendezvous trajectory was designed.The method was validated by simulation results.

Optimization of the Robot Calibration Process

1992 ◽  
Author(s):  
G. Zak ◽  
R. G. Fenton ◽  
B. Benhabib
Keyword(s):  
Optimization Problem ◽  
Kinematic Model ◽  
Optimization Procedure ◽  
Calibration Procedure ◽  
Residual Error ◽  
Industrial Robots ◽  
Multiple Objective Optimization ◽  
Robot Calibration ◽  
Calibration Process ◽  
The Cost

Abstract Most industrial robots cannot be off-line programmed to carry out a task accurately, unless their kinematic model is suitably corrected through a calibration procedure. However, proper calibration is an expensive and time-consuming procedure due to the highly accurate measurement equipment required and due to the significant amount of data that must be collected. To improve the efficiency of robot calibration, an optimization procedure is proposed in this paper. The objective of minimizing the cost of the calibration is combined with the objective of minimizing the residual error after calibration in one multiple-objective optimization. Prediction of the residual error for a given calibration process presents the main difficulty for implementing the optimization. It is proposed that the residual error is expressed as a polynomial function. This function is obtained as a result of fitting a response surface to either experimental or simulated sample estimates of the residual error. The optimization problem is then solved by identifying a reduced set of possible solutions, thus greatly simplifying the decision maker’s choice of an effective calibration procedure. An application example of this method is also included.

Optimization design of drive system for industrial robots based on dynamic performance

2017 ◽  
Vol 44 (6) ◽  
pp. 765-775 ◽  
Author(s):  
LianZheng Ge ◽  
Jian Chen ◽  
Ruifeng Li ◽  
Peidong Liang
Keyword(s):  
Optimization Model ◽  
Optimization Problem ◽  
Industrial Robot ◽  
Dynamic Performance ◽  
System Optimization ◽  
Drive System ◽  
Industrial Robots ◽  
Mixed Integer ◽  
Light Weight ◽  
Content Type

Purpose The global performance of industrial robots partly depends on the properties of drive system consisting of motor inertia, gearbox inertia, etc. This paper aims to deal with the problem of optimization of global dynamic performance for robotic drive system selected from available components. Design/methodology/approach Considering the performance specifications of drive system, an optimization model whose objective function is composed of working efficiency and natural frequency of robots is proposed. Meanwhile, constraints including the rated and peak torque of motor, lifetime of gearbox and light-weight were taken into account. Furthermore, the mapping relationship between discrete optimal design variables and component properties of drive system were presented. The optimization problem with mixed integer variables was solved by a mixed integer-laplace crossover power mutation algorithm. Findings The optimization results show that our optimization model and methods are applicable, and the performances are also greatly promoted without sacrificing any constraints of drive system. Besides, the model fits the overall performance well with respect to light-weight ratio, safety, cost reduction and others. Practical implications The proposed drive system optimization method has been used for a 4-DOF palletizing robot, which has been largely manufactured in a factory. Originality/value This paper focuses on how the simulation-based optimization can be used for the purpose of generating trade-offs between cost, performance and lifetime when designing robotic drive system. An applicable optimization model and method are proposed to handle the dynamic performance optimization problem of a drive system for industrial robot.

The Optimization Model of Wind Power and Thermal Power Jointly Run under the TOU Price

2013 ◽  
Vol 772 ◽  
pp. 705-710
Author(s):  
Li Wei Ju ◽  
Zhong Fu Tan ◽  
He Yin ◽  
Zhi Hong Chen
Keyword(s):  
Wind Power ◽  
Optimization Model ◽  
Unit Commitment ◽  
Thermal Power ◽  
Peak Load ◽  
Electricity Demand ◽  
Environmental Benefits ◽  
Power Company ◽  
The Cost ◽  
Pollution Emissions

In order to be able to absorb the abandoned wind, increasing wind-connect amount, the paper study the way of wind power, thermal power joint run and puts forward wind power, thermal power joint run optimization model based on the energy-saving generation dispatching way under the environment of TOU price and the target of minimizing the cost of coal-fired cost, unit commitment and pollution emissions. The numerical example finds, the TOU price can realize the goal of peak load shifting, increasing the electricity demand in the low load and reducing electricity demand in the peak load. The model can increase the amount of wind-connect grid, absorb the abandoned wind, reduce the use of coal-fired units under the environment, increase the average electricity sales price and profit of Power Company. Therefore, the model has significant economical environmental benefits

Sign in / Sign up

Export Citation Format

Share Document