• 제목/요약/키워드: Time-Cost Optimization

검색결과 719건 처리시간 0.027초

A Constrained Multi-objective Computation Offloading Algorithm in the Mobile Cloud Computing Environment

  • Liu, Li;Du, Yuanyuan;Fan, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권9호
    • /
    • pp.4329-4348
    • /
    • 2019
  • Mobile cloud computing (MCC) can offload heavy computation from mobile devices onto nearby cloudlets or remote cloud to improve the performance as well as to save energy for these devices. Therefore, it is essential to consider how to achieve efficient computation offloading with constraints for multiple users. However, there are few works that aim at multi-objective problem for multiple users. Most existing works concentrate on only single objective optimization or aim to obtain a tradeoff solution for multiple objectives by simply setting weight values. In this paper, a multi-objective optimization model is built to minimize the average energy consumption, time and cost while satisfying the constraint of bandwidth. Furthermore, an improved multi-objective optimization algorithm called D-NSGA-II-ELS is presented to get Pareto solutions with better convergence and diversity. Compared to other existing works, the simulation results show that the proposed algorithm can achieve better performance in terms of energy consumption, time and cost while satisfying the constraint of the bandwidth.

(m, n)중 연속(r, s) : F 시스템의 정비모형에 대한 개미군집 최적화 해법 (Ant Colony Optimization Approach to the Utility Maintenance Model for Connected-(r, s)-out of-(m, n) : F System)

  • 이상헌;신동열
    • 산업공학
    • /
    • 제21권3호
    • /
    • pp.254-261
    • /
    • 2008
  • Connected-(r,s)-out of-(m,n) : F system is an important topic in redundancy design of the complex system reliability and it's maintenance policy. Previous studies applied Monte Carlo simulation and genetic, simulated annealing algorithms to tackle the difficulty of maintenance policy problem. These algorithms suggested most suitable maintenance cycle to optimize maintenance pattern of connected-(r,s)-out of-(m,n) : F system. However, genetic algorithm is required long execution time relatively and simulated annealing has improved computational time but rather poor solutions. In this paper, we propose the ant colony optimization approach for connected-(r,s)-out of-(m,n) : F system that determines maintenance cycle and minimum unit cost. Computational results prove that ant colony optimization algorithm is superior to genetic algorithm, simulated annealing and tabu search in both execution time and quality of solution.

THE OPTIMAL CAPACITY OF THE FINITE DAM WITH COMPOUND POISSON INPUTS

  • Bae, Jong-Ho
    • Journal of the Korean Statistical Society
    • /
    • 제32권1호
    • /
    • pp.65-71
    • /
    • 2003
  • We consider the finite dam with compound Poisson inputs which is called M/G/1 finite dam. We assign some costs related to operating the dam and calculate the long-run average cost per unit time. Then, we find the optimal dam capacity under which the average costs is minimized.

Multicriteria shape design of an aerosol can

  • Aalae, Benki;Abderrahmane, Habbal;Gael, Mathis;Olivier, Beigneux
    • Journal of Computational Design and Engineering
    • /
    • 제2권3호
    • /
    • pp.165-175
    • /
    • 2015
  • One of the current challenges in the domain of the multicriteria shape optimization is to reduce the calculation time required by conventional methods. The high computational cost is due to the high number of simulation or function calls required by these methods. Recently, several studies have been led to overcome this problem by integrating a metamodel in the overall optimization loop. In this paper, we perform a coupling between the Normal Boundary Intersection - NBI - algorithm with Radial Basis Function - RBF - metamodel in order to have a simple tool with a reasonable calculation time to solve multicriteria optimization problems. First, we apply our approach to academic test cases. Then, we validate our method against an industrial case, namely, shape optimization of the bottom of an aerosol can undergoing nonlinear elasto-plastic deformation. Then, in order to select solutions among the Pareto efficient ones, we use the same surrogate approach to implement a method to compute Nash and Kalai-Smorodinsky equilibria.

Routing optimization algorithm for logistics virtual monitoring based on VNF dynamic deployment

  • Qiao, Qiujuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권5호
    • /
    • pp.1708-1734
    • /
    • 2022
  • In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.

지연귀환을 통한 비선형 섭동이 존재하는 불확실 시간지연 시스템의 성능보장 제어 (Guaranteed Cost Control for Uncertain Time-Delay Systems with nonlinear Perturbations via Delayed Feedback)

  • 박주현;권오민
    • 제어로봇시스템학회논문지
    • /
    • 제13권6호
    • /
    • pp.581-588
    • /
    • 2007
  • In this paper, we propose a delayed feedback guaranteed cost controller design method for linear time-delay systems with norm-bounded parameter uncertainties and nonlinear perturbations. A quadratic cost function is considered as the performance measure for the given system. Based on the Lyapunov method, an LMI optimization problem is formulated to design a controller such that the closed-loop cost function value is not more than a specified upper bound for all admissible system uncertainties and nonlinear perturbations. Numerical example show the effectiveness of the proposed method.

Stochastic cost optimization of ground improvement with prefabricated vertical drains and surcharge preloading

  • Kim, Hyeong-Joo;Lee, Kwang-Hyung;Jamin, Jay C.;Mission, Jose Leo C.
    • Geomechanics and Engineering
    • /
    • 제7권5호
    • /
    • pp.525-537
    • /
    • 2014
  • The typical design of ground improvement with prefabricated vertical drains (PVD) and surcharge preloading involves a series of deterministic analyses using averaged or mean soil properties for the various combination of the PVD spacing and surcharge preloading height that would meet the criteria for minimum consolidation time and required degree of consolidation. The optimum design combination is then selected in which the total cost of ground improvement is a minimum. Considering the variability and uncertainties of the soil consolidation parameters, as well as considering the effects of soil disturbance (smear zone) and drain resistance in the analysis, this study presents a stochastic cost optimization of ground improvement with PVD and surcharge preloading. Direct Monte Carlo (MC) simulation and importance sampling (IS) technique is used in the stochastic analysis by limiting the sampled random soil parameters within the range from a minimum to maximum value while considering their statistical distribution. The method has been verified in a case study of PVD improved ground with preloading, in which average results of the stochastic analysis showed a good agreement with field monitoring data.

시뮬레이티드 어닐링을 이용한(m, n)중 연속(r,s) : F 시스템의 정비모형 (A Maintenance Design of Connected-(r, s)-out-of-(m, n) F System Using Simulated Annealing)

  • 이상헌;강영태;신동열
    • 대한산업공학회지
    • /
    • 제34권1호
    • /
    • pp.98-107
    • /
    • 2008
  • The purpose of this paper is to present an optimization scheme that aims at minimizing the expected cost per unittime. This study considers a linear connected-(r, s)-ouI-of-(m, n):f lattice system whose components are orderedlike the elements of a linear (m, n)-matrix. We assume that all components are in the state 1 (operating) or 0(failed) and identical and s-independent. The system fails whenever at least one connected (r, s)-submatrix offailed components occurs. To find the optimal threshold of maintenance intervention, we use a simulatedannealing(SA) algorithm for the cost optimization procedure. The expected cost per unit time is obtained byMonte Carlo simulation. We also has made sensitivity analysis to the different cost parameters. In this study,utility maintenance model is constructed so that minimize the expense under full equipment policy throughcomparison for the full equipment policy and preventive maintenance policy. The full equipment cycle and unitcost rate are acquired by simulated annealing algorithm. The SA algorithm is appeared to converge fast inmulti-component system that is suitable to optimization decision problem.

Schedule Optimization in Resource Leveling through Open BIM Based Computer Simulations

  • 김현주
    • 한국BIM학회 논문집
    • /
    • 제9권2호
    • /
    • pp.1-10
    • /
    • 2019
  • In this research, schedule optimization is defined as balancing the number of workers while keeping the demand and needs of the project resources, creating the perfect schedule for each activity. Therefore, when one optimizes a schedule, multiple potentials of schedule changes are assessed to get an instant view of changes that avoid any over and under staffing while maximizing productivity levels for the available labor cost. Optimizing the number of workers in the scheduling process is not a simple task since it usually involves many different factors to be considered such as the development of quantity take-offs, cost estimating, scheduling, direct/indirect costs, and borrowing costs in cash flow while each factor affecting the others simultaneously. That is why the optimization process usually requires complex computational simulations/modeling. This research attempts to find an optimal selection of daily maximum workers in a project while considering the impacts of other factors at the same time through OPEN BIM based multiple computer simulations in resource leveling. This paper integrates several different processes such as quantity take-offs, cost estimating, and scheduling processes through computer aided simulations and prediction in generating/comparing different outcomes of each process. To achieve interoperability among different simulation processes, this research utilized data exchanges supported by building SMART-IFC effort in automating the data extraction and retrieval. Numerous computer simulations were run, which included necessary aspects of construction scheduling, to produce sufficient alternatives for a given project.

Sources of Cost Saving Opportunities in Highway Construction Quality Assurance Practices

  • Uddin, Mohammad Moin;Newland, James
    • Journal of Construction Engineering and Project Management
    • /
    • 제8권1호
    • /
    • pp.1-9
    • /
    • 2018
  • US transportation agencies are dealing with shrinking budgets, limited work forces, and deteriorating infrastructure. In order to cope with funding uncertainty, state highway agencies are now looking into their own organizations and identifying programs, practices, and processes that have potential for cost saving. A quality assurance (QA) program is an integral part of highway construction and ensures a project's contracted level of quality. The cost of quality (conforming and nonconforming) can constitute a sizable part of total construction cost. As the quality assurance programs evolved, various practices and processes were developed over time and later adopted by state highway agencies. These practices and processes include different QA standards and specifications, varying testing methods, central testing lab vs. on site testing, performance based vs. prescribed quality assurance practices, implementation of innovative quality assurance practices, etc. Therefore, there is an opportunity to assess different QA strategies and recommend those practices that are effective and cost efficient. A national survey was conducted by the authors, which provided a detailed mapping of various QA practices and processes used as part of QA programs and identified areas where agencies can focus on for cost savings. The survey found that QA sampling and testing plans, optimization of sampling plans, optimization of QA standards and specifications, and implementation of innovative test methods and processes are the main areas the agencies should focus to lean the current QA programs.