Vehicle routing problem in distribution (VRPD) is a widely used type of vehicle routing problem (VRP), which has been proved as NP-Hard, and it is usually modeled as single objective optimization problem when mode...Vehicle routing problem in distribution (VRPD) is a widely used type of vehicle routing problem (VRP), which has been proved as NP-Hard, and it is usually modeled as single objective optimization problem when modeling. For multi-objective optimization model, most researches consider two objectives. A multi-objective mathematical model for VRP is proposed, which considers the number of vehicles used, the length of route and the time arrived at each client. Genetic algorithm is one of the most widely used algorithms to solve VRP. As a type of genetic algorithm (GA), non-dominated sorting in genetic algorithm-Ⅱ (NSGA-Ⅱ) also suffers from premature convergence and enclosure competition. In order to avoid these kinds of shortage, a greedy NSGA-Ⅱ (GNSGA-Ⅱ) is proposed for VRP problem. Greedy algorithm is implemented in generating the initial population, cross-over and mutation. All these procedures ensure that NSGA-Ⅱ is prevented from premature convergence and refine the performance of NSGA-Ⅱ at each step. In the distribution problem of a distribution center in Michigan, US, the GNSGA-Ⅱ is compared with NSGA-Ⅱ. As a result, the GNSGA-Ⅱ is the most efficient one and can get the most optimized solution to VRP problem. Also, in GNSGA-Ⅱ, premature convergence is better avoided and search efficiency has been improved sharply.展开更多
In this paper,a novel location inventory routing(LIR)model is proposed to solve cold chain logistics network problem under uncertain demand environment. The goal of the developed model is to optimize costs of location...In this paper,a novel location inventory routing(LIR)model is proposed to solve cold chain logistics network problem under uncertain demand environment. The goal of the developed model is to optimize costs of location,inventory and transportation.Due to the complex of LIR problem( LIRP), a multi-objective genetic algorithm(GA), non-dominated sorting in genetic algorithm Ⅱ( NSGA-Ⅱ) has been introduced. Its performance is tested over a real case for the proposed problems. Results indicate that NSGA-Ⅱ provides a competitive performance than GA,which demonstrates that the proposed model and multi-objective GA are considerably efficient to solve the problem.展开更多
风电并网在实现节约化石能源和减少有害气体排放等效益的同时,也将对电力系统的可靠性造成一定的负面影响。为达到投资经济性、系统可靠性、环保效果的整体最优,构建了多目标风电场接入的输电线路与电网的联合优化规划模型;针对目标权...风电并网在实现节约化石能源和减少有害气体排放等效益的同时,也将对电力系统的可靠性造成一定的负面影响。为达到投资经济性、系统可靠性、环保效果的整体最优,构建了多目标风电场接入的输电线路与电网的联合优化规划模型;针对目标权重未知、人工神经网络(artificial neuralnetwork,ANN)收敛困难、无法合理决策等问题,采用方差最大化决策和分类逼近理想解的排序方法(technique fororder preference by similarity to an ideal solution,TOPSIS)缩小最优解的范围,并在此基础上提出了随机模拟、神经元网络和非劣排序遗传算法II(non-dominated sorting geneticalgorithm II,NSGA-Ⅱ)相结合的混合智能算法;对增加风电场的改进IEEE Garver-6系统进行计算分析,结果表明该方法具有较高的决策效率和计算精度,从而验证了所提出模型和方法的合理性和有效性。展开更多
基金supported by National Natural Science Foundation of China (No.60474059)Hi-tech Research and Development Program of China (863 Program,No.2006AA04Z160).
文摘Vehicle routing problem in distribution (VRPD) is a widely used type of vehicle routing problem (VRP), which has been proved as NP-Hard, and it is usually modeled as single objective optimization problem when modeling. For multi-objective optimization model, most researches consider two objectives. A multi-objective mathematical model for VRP is proposed, which considers the number of vehicles used, the length of route and the time arrived at each client. Genetic algorithm is one of the most widely used algorithms to solve VRP. As a type of genetic algorithm (GA), non-dominated sorting in genetic algorithm-Ⅱ (NSGA-Ⅱ) also suffers from premature convergence and enclosure competition. In order to avoid these kinds of shortage, a greedy NSGA-Ⅱ (GNSGA-Ⅱ) is proposed for VRP problem. Greedy algorithm is implemented in generating the initial population, cross-over and mutation. All these procedures ensure that NSGA-Ⅱ is prevented from premature convergence and refine the performance of NSGA-Ⅱ at each step. In the distribution problem of a distribution center in Michigan, US, the GNSGA-Ⅱ is compared with NSGA-Ⅱ. As a result, the GNSGA-Ⅱ is the most efficient one and can get the most optimized solution to VRP problem. Also, in GNSGA-Ⅱ, premature convergence is better avoided and search efficiency has been improved sharply.
基金Natural Science Foundation of Shanghai,China(No.15ZR1401600)the Fundamental Research Funds for the Central Universities,China(No.CUSF-DH-D-2015096)
文摘In this paper,a novel location inventory routing(LIR)model is proposed to solve cold chain logistics network problem under uncertain demand environment. The goal of the developed model is to optimize costs of location,inventory and transportation.Due to the complex of LIR problem( LIRP), a multi-objective genetic algorithm(GA), non-dominated sorting in genetic algorithm Ⅱ( NSGA-Ⅱ) has been introduced. Its performance is tested over a real case for the proposed problems. Results indicate that NSGA-Ⅱ provides a competitive performance than GA,which demonstrates that the proposed model and multi-objective GA are considerably efficient to solve the problem.
文摘风电并网在实现节约化石能源和减少有害气体排放等效益的同时,也将对电力系统的可靠性造成一定的负面影响。为达到投资经济性、系统可靠性、环保效果的整体最优,构建了多目标风电场接入的输电线路与电网的联合优化规划模型;针对目标权重未知、人工神经网络(artificial neuralnetwork,ANN)收敛困难、无法合理决策等问题,采用方差最大化决策和分类逼近理想解的排序方法(technique fororder preference by similarity to an ideal solution,TOPSIS)缩小最优解的范围,并在此基础上提出了随机模拟、神经元网络和非劣排序遗传算法II(non-dominated sorting geneticalgorithm II,NSGA-Ⅱ)相结合的混合智能算法;对增加风电场的改进IEEE Garver-6系统进行计算分析,结果表明该方法具有较高的决策效率和计算精度,从而验证了所提出模型和方法的合理性和有效性。