To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,...To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.展开更多
Electrochemical machining（ECM） is one of the important non-traditional machining processes,which is used for machining of difficult-to-machine materials and intricate profiles.Being a complex process,it is very diff...Electrochemical machining（ECM） is one of the important non-traditional machining processes,which is used for machining of difficult-to-machine materials and intricate profiles.Being a complex process,it is very difficult to determine optimal parameters for improving cutting performance.Metal removal rate and surface roughness are the most important output parameters,which decide the cutting performance.There is no single optimal combination of cutting parameters,as their influences on the metal removal rate and the surface roughness are quite opposite.A multiple regression model was used to represent relationship between input and output variables and a multi-objective optimization method based on a non-dominated sorting genetic algorithm-Ⅱ（NSGA-Ⅱ） was used to optimize ECM process.A non-dominated solution set was obtained.展开更多
Aimed at the uncertain characteristics of discrete logistics network design,an interval hierarchical triangular uncertain OD demand model based on interval demand and network flow is presented.Under consideration of t...Aimed at the uncertain characteristics of discrete logistics network design,an interval hierarchical triangular uncertain OD demand model based on interval demand and network flow is presented.Under consideration of the system profit,the uncertain demand of logistics network is measured by interval variables and interval parameters,and an interval planning model of discrete logistics network is established.The risk coefficient and maximum constrained deviation are defined to realize the certain transformation of the model.By integrating interval algorithm and genetic algorithm,an interval hierarchical optimal genetic algorithm is proposed to solve the model.It is shown by a tested example that in the same scenario condition an interval solution[3275.3,3 603.7]can be obtained by the model and algorithm which is obviously better than the single precise optimal solution by stochastic or fuzzy algorithm,so it can be reflected that the model and algorithm have more stronger operability and the solution result has superiority to scenario decision.展开更多
Transportation problem on network needs to determine the freight quantity and the transportation route between supply point and demand point. Therefore, taken the uncertainty of freight supply and demand into account,...Transportation problem on network needs to determine the freight quantity and the transportation route between supply point and demand point. Therefore, taken the uncertainty of freight supply and demand into account, a collaborative optimization model is formulated with transportation capacity constraint. In addition, a two-stage genetic algorithm （GA） is put forward. Herein, the first stage of this GA is adopted a priority-based encoding method for determining the supply and demand relationship between different points. Then supply and demand relationship which the supply and the demand are both greater than zero is a minimum cost flow （MCF） problem on network in the second stage. Aim at the purpose to solve MCF problem, a GA is employed. Moreover, this algorithm is suitable for balance and unbalance transportation on directed network or undirected network. At last, the model and algorithm are verified to be efficient by a numerical example.展开更多
基金supported by Natural Science Foundation Project of Gansu Provincial Science and Technology Department(No.1506RJZA084)Gansu Provincial Education Department Scientific Research Fund Grant Project(No.1204-13).
文摘To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.
文摘Electrochemical machining（ECM） is one of the important non-traditional machining processes,which is used for machining of difficult-to-machine materials and intricate profiles.Being a complex process,it is very difficult to determine optimal parameters for improving cutting performance.Metal removal rate and surface roughness are the most important output parameters,which decide the cutting performance.There is no single optimal combination of cutting parameters,as their influences on the metal removal rate and the surface roughness are quite opposite.A multiple regression model was used to represent relationship between input and output variables and a multi-objective optimization method based on a non-dominated sorting genetic algorithm-Ⅱ（NSGA-Ⅱ） was used to optimize ECM process.A non-dominated solution set was obtained.
基金Project(51178061)supported by the National Natural Science Foundation of ChinaProject(2010FJ6016)supported by Hunan Provincial Science and Technology,China+1 种基金Project(12C0015)supported by Scientific Research Fund of Hunan Provincial Education Department,ChinaProject(13JJ3072)supported by Hunan Provincial Natural Science Foundation of China
文摘Aimed at the uncertain characteristics of discrete logistics network design,an interval hierarchical triangular uncertain OD demand model based on interval demand and network flow is presented.Under consideration of the system profit,the uncertain demand of logistics network is measured by interval variables and interval parameters,and an interval planning model of discrete logistics network is established.The risk coefficient and maximum constrained deviation are defined to realize the certain transformation of the model.By integrating interval algorithm and genetic algorithm,an interval hierarchical optimal genetic algorithm is proposed to solve the model.It is shown by a tested example that in the same scenario condition an interval solution[3275.3,3 603.7]can be obtained by the model and algorithm which is obviously better than the single precise optimal solution by stochastic or fuzzy algorithm,so it can be reflected that the model and algorithm have more stronger operability and the solution result has superiority to scenario decision.
基金This project is supported in part by Natural Science Foundation of Gansu Province （0710RJZA048） National Natural Science Foundation of China（60870008）
文摘Transportation problem on network needs to determine the freight quantity and the transportation route between supply point and demand point. Therefore, taken the uncertainty of freight supply and demand into account, a collaborative optimization model is formulated with transportation capacity constraint. In addition, a two-stage genetic algorithm （GA） is put forward. Herein, the first stage of this GA is adopted a priority-based encoding method for determining the supply and demand relationship between different points. Then supply and demand relationship which the supply and the demand are both greater than zero is a minimum cost flow （MCF） problem on network in the second stage. Aim at the purpose to solve MCF problem, a GA is employed. Moreover, this algorithm is suitable for balance and unbalance transportation on directed network or undirected network. At last, the model and algorithm are verified to be efficient by a numerical example.
