首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
    
Sustainability has been considered as a growing concern in supply chain network design (SCND) and in the order allocation problem (OAP). Accordingly, there still exists a gap in the quantitative modeling of sustainable SCND that consists of OAP. In this article, we cover this gap through simultaneously considering the sustainable OAP in the sustainable SCND as a strategic decision. The proposed supply chain network is composed of five echelons including suppliers classified in different classes, plants, distribution centers that dispatch products via two different ways, direct shipment, and cross-docks, to satisfy stochastic demand received from a set of retailers. The problem has been mathematically formulated as a multi-objective optimization model that aims at minimizing the total costs and environmental effect of integrating SCND and OAP, simultaneously. To tackle the addressed problem, a novel multi-objective hybrid approach called MOHEV with two strategies for its best particle selection procedure (BPSP), minimum distance, and crowding distance is proposed. MOHEV is constructed through hybridization of two multi-objective algorithms, namely the adapted multi-objective electromagnetism mechanism algorithm (AMOEMA) and adapted multi-objective variable neighborhood search (AMOVNS). According to achieved results, MOHEV achieves better solutions compared with the others, and also crowding distance method for BPSP outperforms minimum distance. Finally, a case study for an automobile industry is used to demonstrate the applicability of the approach.  相似文献   

2.
    
This paper proposes an efficient decomposition and dual-stage multi-objective optimization (DDMO) method for designing water distribution systems with multiple supply sources (WDS-MSSs). Three phases are involved in the proposed DDMO approach. In Phase 1, an optimal source partitioning cut-set is identified for a WDS-MSS, allowing the entire WDS-MSS to be decomposed into sub-networks. Then in Phase 2 a non-dominated sorting genetic algorithm (NSGA-II) is employed to optimize the sub-networks separately, thereby producing an optimal front for each sub-network. Finally in Phase 3, another NSGA-II implementation is used to drive the combined sub-network front (an approximate optimal front) towards the Pareto front for the original complete WDS-MSS. Four WDS-MSSs are used to demonstrate the effectiveness of the proposed approach. Results obtained show that the proposed DDMO significantly outperforms the NSGA-II that optimizes the entire network as a whole in terms of efficiently finding good quality optimal fronts.  相似文献   

3.
    
This paper describes a multi-objective optimization model including Real Options concepts for the design and operation of water distribution networks. This approach is explained through a case study with some possible expansion areas defined to fit different future scenarios. A multi-objective decision model with conflicting objectives is detailed. Also, environmental impacts are considered that take into account not only the life cycle carbon emissions of the different materials used during the construction of the networks but also the emissions related to energy consumption during operation. These impacts are translated by giving a cost to each tonne of carbon dioxide emitted. This work presents a new multi-objective simulated annealing algorithm linked to a hydraulic simulator to verify the hydraulic constraints, and the results are represented as points on the Pareto front. The results show that the approach can deal explicitly with conflicting objectives, with environmental impacts and with future uncertainty.  相似文献   

4.
    
Evolutionary algorithms (EAs) have been widely used in handling various water resource optimization problems in recent years. However, it is still challenging for EAs to identify near-optimal solutions for realistic problems within the available computational budgets. This paper introduces a novel multi-objective optimization method to improve the efficiency of a typically difficult water resource problem: water distribution network (WDN) design. In the proposed approach, a WDN is decomposed into different sub-networks using decomposition techniques. EAs optimize these sub-networks individually, generating Pareto fronts for each sub-network with great efficiency. A propagation method is proposed to evolve Pareto fronts of the sub-networks towards the Pareto front for the full network while eliminating the need to hydraulically simulate the intact network itself. Results from two complex realistic WDNs show that the proposed approach is able to find better fronts than conventional full-search algorithms (optimize the entire network without decomposition) with dramatically improved efficiency.  相似文献   

5.
B.Y. Qu 《Information Sciences》2010,180(17):3170-242
Most multi-objective evolutionary algorithms (MOEAs) use the concept of dominance in the search process to select the top solutions as parents in an elitist manner. However, as MOEAs are probabilistic search methods, some useful information may be wasted, if the dominated solutions are completely disregarded. In addition, the diversity may be lost during the early stages of the search process leading to a locally optimal or partial Pareto-front. Beside this, the non-domination sorting process is complex and time consuming. To overcome these problems, this paper proposes multi-objective evolutionary algorithms based on Summation of normalized objective values and diversified selection (SNOV-DS). The performance of this algorithm is tested on a set of benchmark problems using both multi-objective evolutionary programming (MOEP) and multi-objective differential evolution (MODE). With the proposed method, the performance metric has improved significantly and the speed of the parent selection process has also increased when compared with the non-domination sorting. In addition, the proposed algorithm also outperforms ten other algorithms.  相似文献   

6.
Currently available life cycle assessment (LCA) tools provide only a rough estimation of the environmental impact of different manufacturing operations (e.g. energy consumption). To address this limitation, a web-based and application programming interface (API) based process analysis software tools were developed to estimate the energy consumption of a computer numerically controlled (CNC) machine tool operation and to evaluate its environmental impact as a first step towards sustainable manufacturing analysis. Acceleration/deceleration of machine tool axes and the direction of axes movement were considered to estimate the total energy demand and processing time of the machine tool operation. Several tool path generation schemes were tested to analyze the energy consumption and resulting green house gas emission of CNC machine tool operation. It showed that tool path generation schemes affect the amount of energy and the processing time required to machine the same part, and location of the machining resulted in different amount and characteristics of green house gas emission.  相似文献   

7.
    
This paper shows how embedding a local search algorithm, such as the iterated linear programming (LP), in the multi-objective genetic algorithms (MOGAs) can lead to a reduction in the search space and then to the improvement of the computational efficiency of the MOGAs. In fact, when the optimization problem features both continuous real variables and discrete integer variables, the search space can be subdivided into two sub-spaces, related to the two kinds of variables respectively. The problem can then be structured in such a way that MOGAs can be used for the search within the sub-space of the discrete integer variables. For each solution proposed by the MOGAs, the iterated LP can be used for the search within the sub-space of the continuous real variables. An example of this hybrid algorithm is provided herein as far as water distribution networks are concerned. In particular, the problem of the optimal location of control valves for leakage attenuation is considered. In this framework, the MOGA NSGAII is used to search for the optimal valve locations and for the identification of the isolation valves which have to be closed in the network in order to improve the effectiveness of the control valves whereas the iterated linear programming is used to search for the optimal settings of the control valves. The application to two case studies clearly proves the reduction in the MOGA search space size to render the hybrid algorithm more efficient than the MOGA without iterated linear programming embedded.  相似文献   

8.
This paper presents a bi-objective mathematical programming model for the restricted facility location problem, under a congestion and pricing policy. Motivated by various applications such as locating server on internet mirror sites and communication networks, this research investigates congested systems with immobile servers and stochastic demand as M/M/m/k queues. For this problem, we consider two simultaneous perspectives; (1) customers who desire to limit waiting time for service and (2) service providers who intend to increase profits. We formulate a bi-objective facility location problem with two objective functions: (i) maximizing total profit of the whole system and (ii) minimizing the sum of waiting time in queues; the model type is mixed-integer nonlinear. Then, a multi-objective optimization algorithm based on vibration theory (so-called multi-objective vibration damping optimization (MOVDO)), is developed to solve the model. Moreover, the Taguchi method is also implemented, using a response metric to tune the parameters. The results are analyzed and compared with a non-dominated sorting genetic algorithm (NSGA-II) as a well-developed multi-objective evolutionary optimization algorithm. Computational results demonstrate the efficiency of the proposed MOVDO to solve large-scale problems.  相似文献   

9.
Embedded systems have become integral parts of today's technology-based life, starting from various home appliances to satellites. Such a wide range of applications encourages for their economic design using optimization-based tools. The JPEG encoder is an embedded system, which is applied for obtaining high quality output from continuous-tone images. It has emerged in recent years as a problem of optimum partitioning of its various processes into hardware and software components. Realizing pairing and conflicting nature among its various cost terms, for the first time the JPEG encoder is formulated and partitioned here as a multi-objective optimization problem. A multi-objective binary-coded genetic algorithm is proposed for this purpose, whose effectiveness is demonstrated through the application to a real case study and a number of large-size hypothetical instances.  相似文献   

10.
    
Greenhouse gas (GHG) emissions from agroecosystems, particularly nitrous oxide (N2O), are an increasing concern. To quantify N2O emissions from agroecosystems, which occur as a result of nitrogen (N) cycling, a new physically-based routine was developed for the Soil and Water Assessment Tool (SWAT) model to predict N2O flux during denitrification and an existing nitrification routine was modified to capture N2O flux during this process. The new routines predict N2O emissions by coupling the carbon (C) and N cycles with soil moisture/temperature and pH in SWAT. The model uses reduction functions to predict total denitrification (N2+ N2O) and partitions N2 from N2O using a ratio method. The modified SWAT nitrification routine likewise predicts N2O emissions using reduction functions. The new denitrification routine and modified nitrification routine were tested using GRACEnet data at University Park, Pennsylvania, and West Lafayette, Indiana. Results showed strong correlations between plot measurements of N2O flux and the model predictions for both test sites and suggest that N2O emissions are particularly sensitive to soil pH and soil N, and moderately sensitive to soil temperature/moisture and total soil C levels.  相似文献   

11.
This paper presents a fuzzy-Pareto dominance driven possibilistic model based planning of electrical distribution systems using multi-objective particle swarm optimization (MOPSO). This multi-objective planning model captures the possibilistic variations of the system loads using a fuzzy triangular number. The MOPSO based on the Pareto-optimality principle is used to obtain a set of non-dominated solutions representing different network structures under uncertainties in load demands and these non-dominated solutions are stored in an elite archive of limited size. Normally, choosing the candidate non-dominated solutions to be retained in the elite archive while maintaining the quality of the Pareto-approximation front as well as maintaining the diversity of solutions on this front is very much computationally demanding. In this paper, the principles of fuzzy Pareto-dominance are used to find out and rank the non-dominated solutions on the Pareto-approximation front. This ranking in turn is used to maintain the elite archive of limited size by discarding the lower ranked solutions. The two planning objectives are: (i) minimization of total installation and operational cost and (ii) minimization of risk factor. The risk factor is defined as a function of an index called contingency-load-loss index (CLLI), which captures the effect of load loss under contingencies, and the degree of network constraint violations. The minimization of the CLLI improves network reliability. The network variables that are optimized are: (i) number of feeders and their routes, and (ii) number and locations of sectionalizing switches. An MOPSO (developed by the authors), based on a novel technique for the selection and assignment of leaders/guides for efficient search of non-dominated solutions, is used as the optimization tool. The proposed planning approach is validated on a typical 100-node distribution system. Performance comparisons between the planning approaches with the possibilistic and deterministic load models are provided highlighting the relative merits and demerits. It is also verified that the proposed solution ranking scheme based on the fuzzy-Pareto dominance is very much better from both quality and computational burden point of view in comparison with the other well-known archive truncation techniques based on clustering and solution density measurement etc.  相似文献   

12.
    
Explicitly representing uncertainty is recognised as a fundamental requirement of any long-term forecast. We propose and illustrate an expert elicitation protocol for constructing long-term probabilistic projections. Each projection represents a possible realization of a time series with autocorrelation properties, and thus a plausible future evolution of a quantity of interest. We illustrate the approach using two quantities – GDP growth rates and coal prices – that were elicited as part of a project producing baseline forecasts of greenhouse gas emissions in South Africa to 2050. The elicited projections can be used as inputs to deterministic structural models of the energy, economic, and environmental sectors (e3 or energy-environment-economic models), to generate similar probabilistic projections for any desired outputs of the e3 model. An R package for the generation and visualization of these probabilistic projections is provided.  相似文献   

13.
    
Water reservoir operations have great potential for contributing positively to the development of different socio-economic sectors as well as for reducing the vulnerabilities of water systems caused by changing hydroclimatic and anthropogenic forcing. This motivates the search for advanced, flexible, and open tools supporting the design of operating policies capable of meeting multiple competing objectives. This work contributes the Multi-Objective Optimal Operations (M3O) Matlab toolbox, which allows users to design Pareto optimal (or approximate) operating policies for managing water reservoir systems through several alternative state-of-the-art methods. Version 1.0 of M3O includes Deterministic and Stochastic Dynamic Programming, Implicit Stochastic Optimization, Sampling Stochastic Dynamic Programming, fitted Q-iteration, Evolutionary Multi-Objective Direct Policy Search, and Model Predictive Control. The toolbox is designed to be accessible to practitioners, researchers, and students, and to provide a fully commented and customizable code for more experienced users.  相似文献   

14.
多目标微粒群优化算法及其应用研究进展*   总被引:2,自引:0,他引:2  
多目标微粒群优化(MOPSO)算法是一类基于群体智能的新型全局多目标优化方法,已受到广泛关注,并在许多领域得到应用。针对近几年来MOPSO算法及其应用的进展进行了综述和评论。首先描述了MOPSO算法的基本框架;接着对MOPSO算法进行了分类和分析,并给出了MOPSO算法的一些改进策略;然后介绍了MOPSO算法的应用进展;最后,展望了MOPSO算法值得进一步研究的方向。  相似文献   

15.
人工免疫系统是受自然免疫原理启发而建立的计算模型,多目标优化问题是当前演化计算的一个重要研究方向。然而,当前的各种免疫优化算法的运行机制和操作过程均不相同。提出一种多目标优化免疫算法的统一表达方法,抽象出免疫算法的3类核心算子的主要原理和运行过程。核心算子可表达经典免疫优化算法NNIA和CMOIA,证明了3类免疫算子表达算法的可行性和高效性。  相似文献   

16.
陈亦欧  吕信科  凌翔 《计算机科学》2017,44(8):42-45, 70
随着信号处理的复杂度的增加,多核并行架构成为数字信号系统的有效解决方案。主要研究了面向数字信号处理系统的无线多核阵列的任务调度问题。从数字信号处理系统与无线多核阵列的性能和开销要求出发,以功耗、热分布以及延时为优化目标,设计出相应的功耗、热均衡评估与延时模型,作为多目标优化算法的目标函数。同时,在NSGA-II算法的基础上改进拥挤策略与初始种群,并设计新的适应度函数,兼顾3个优化目标的性能,增加探索到更优解的可能性。最后,在无线多核阵列平台上采用多种任务图进行仿真,验证了所提算法的有效性与优越性。  相似文献   

17.
This paper proposes an approach for including deeply uncertain factors directly into a multi-objective search procedure, to aid in incorporating divergent quantitative scenarios within the model-based decision support process. Specifically, we extend Many Objective Robust Decision Making (MORDM), a framework for finding and evaluating planning solutions under multiple objectives, to include techniques from robust optimization. Traditional MORDM first optimized a problem under a baseline scenario, then evaluated candidate solutions under an ensemble of uncertain conditions, and finally discovered scenarios under which solutions are vulnerable. In this analysis, we perform multiple multi-objective search trials that directly incorporate these discovered scenarios within the search. Through the analysis, we have created multiple problem formulations to show how methodological choices of severe scenarios affect the resulting candidate planning solutions. We demonstrate the approach through a water planning portfolio example in the Lower Rio Grande Valley of Texas.  相似文献   

18.
    
In this paper, we research the optimization problems with multiple Z-number valued objectives. First, we convert Z-numbers to classical fuzzy numbers to simplify the calculation. A new dominance relationship of two fuzzy numbers based on the lower limit of the possibility degree is proposed. Then according to this dominance relationship, we present a multi-objective evolutionary algorithm to solve the optimization problems. Finally, a simple example is used to demonstrate the validity of the suggested algorithm.  相似文献   

19.
    
We present a green vehicle routing and scheduling problem (GVRSP) considering general time-dependent traffic conditions with the primary objective of minimizing CO2 emissions and weighted tardiness. A new mathematical formulation is proposed to describe the GVRSP with hierarchical objectives and weighted tardiness. The proposed formulation is an alternative formulation of the GVRSP in the way that a vehicle is allowed to travel an arc in multiple time periods. The schedule of a vehicle is determined based on the actual distance that the vehicle travels each arc in each time period instead of the time point when the vehicle departs from each node. Thereby, more general time dependent traffic patterns can be considered in the model. The proposed formulation is studied using various objectives functions, such as minimizing the total CO2 emissions, the total travel distance, and the total travel time. Computational results show that up to 50% reduction in CO2 emissions can be achieved with average reductions of 12% and 28% compared to distance-oriented solutions and travel-time-oriented solutions, respectively. In addition, a simulated annealing (SA) algorithm is introduced to solve large-sized problem instances. To reduce the search space, the SA algorithm searches only for vehicle routes and rough schedules, and a straightforward heuristic procedure is used to determine near-optimal detailed schedules for a given set of routes. The performance of the SA algorithm is tested on large-sized problems with up to 100 nodes and 10 time periods.  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号