The location of the distribution facilities and the routing of the vehicles from these facilities are interdependent in many distribution systems. Such a concept recognizes the interdependence;attempts to integrate th...The location of the distribution facilities and the routing of the vehicles from these facilities are interdependent in many distribution systems. Such a concept recognizes the interdependence;attempts to integrate these two decisions have been limited. Multi-objective location-routing problem (MLRP) is combined with the facility location and the vehicle routing decision and satisfied the different objectives. Due to the problem complexity, simultaneous solution methods are limited, which are given in different objectives with conflicts in functions satisfied. Two kinds of optimal mathematical models are proposed for the solution of MLRP. Three methods have been emphatically developed for MLRP. MGA architecture makes it possible to search the solution space efficiently, which provides a path for searching the solution with two-objective LRP. At last the practical proof is given by random analysis for regional distribution with nine cities.展开更多
By dint of the stability of Cauchy-type integral with kernel density of class H＊ for an open arc, this paper discusses the stability of the solution of Riemann boundary value problem with respect to the perturbation ...By dint of the stability of Cauchy-type integral with kernel density of class H＊ for an open arc, this paper discusses the stability of the solution of Riemann boundary value problem with respect to the perturbation of boundary curve to be an open arc.展开更多
Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it pos...Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it poses become an NP-hard problem.This problem has major practical significance because the effectiveness of the schedules obtained has strong economical impact for any mining project.Despite of the rapid theoretical and technical advances in this field,heuristics is still the only viable approach for large scale industrial applications.This work presents an approach combining genetic algorithms(GAs) and Lagrangian relaxation(LR) to optimally determine the CLTPSP of open pit mines.GAs are stochastic,parallel search algorithms based on the natural selection and the process of evolution.LR method is known for handling large-scale separable problems; however,the convergence to the optimal solution can be slow.The proposed Lagrangian relaxation and genetic algorithms(LR-GAs) combines genetic algorithms into Lagrangian relaxation method to update the Lagrangian multipliers.This approach leads to improve the performance of Lagrangian relaxation method in solving CLTPSP.Numerical results demonstrate that the LR method using GAs to improve its performance speeding up the convergence.Subsequently,highly near-optimal solution to the CLTPSP can be achieved by the LR-GAs.展开更多
This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the ...This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.展开更多
In this paper, we give a hybrid method to numerically solve the inverse open cavity scattering problem for cavity shape, given the scattered solution on the opening of the cavity. This method is a hybrid between an it...In this paper, we give a hybrid method to numerically solve the inverse open cavity scattering problem for cavity shape, given the scattered solution on the opening of the cavity. This method is a hybrid between an iterative method and an integral equations method for solving the Cauchy problem. The idea of this hybrid method is simple, the operation is easy, and the computation cost is small. Numerical experiments show the feasibility of this method, even for cases with noise.展开更多
A newly developed approach without crack surface discretization for modeling 2D solids with large number of cracks in linear elastic fracture mechanics is proposed with the eigen crack opening displacement (COD) bound...A newly developed approach without crack surface discretization for modeling 2D solids with large number of cracks in linear elastic fracture mechanics is proposed with the eigen crack opening displacement (COD) boundary integral equations in this paper. The eigen COD is defined as a crack in an infinite domain under fictitious traction acting on the crack surface. Respect to the computational accuracies and efficiencies, the multiple crack problems in finite and infinite plates are solved and compared numerically using three different kinds of boundary integral equations (BIEs): 1) the dual BIEs require crack surface discretization;2) the BIEs with numerical Green’s functions (NGF) without crack surface discretization, but have to solve a complementary matrix;3) the eigen crack opening displacement (COD) BIEs in the present paper. With the concept of eigen COD, the multiple crack problems can be solved by using a conventional displacement discontinuity boundary integral equation in an iterative fashion with a small size of system matrix as that in the NGF approach, but without troubles to determine the complementary matrix. Solution of the stress intensity factors of multiple crack problems is solved and compared in some numerical examples using the above three computational algorithms. Numerical results clearly demonstrate the numerical models of eigen COD BIEs have much higher efficiency, providing a newly numerical technique for multiple crack problems. Not only the accuracy and efficiency of computation can be guaranteed, but also the overall properties and local details can be obtained. In conclusion, the numerical models of eigen COD BIEs realize the simulations for multiple crack problems with large quantity of cracks.展开更多
The article introduces the main practices and achievements of the Environment and Plant Protection Institute of Chinese Academy of Tropical Agricultural Sciences in promoting the sharing of large-scale instruments and...The article introduces the main practices and achievements of the Environment and Plant Protection Institute of Chinese Academy of Tropical Agricultural Sciences in promoting the sharing of large-scale instruments and equipment in recent years,analyzes the existing problems in the management system,management team,assessment incentives and maintenance guarantee,and proposes improvement measures and suggestions from aspects of improving the sharing management system,strengthening management team building,strengthening sharing assessment and incentives,improving maintenance capabilities and expanding external publicity,to further improve the sharing management of large-scale instruments and equipment.展开更多
目的针对当前物流背景下普遍出现的送货公司外包、退换货频繁等问题,结合现有的碳排放政策,提出低碳背景下开放式同时送取货选址−路径模型(Low-Carbon Open Location-routing Problem with Simultaneous Pickup and Delivery Problem,LO...目的针对当前物流背景下普遍出现的送货公司外包、退换货频繁等问题,结合现有的碳排放政策,提出低碳背景下开放式同时送取货选址−路径模型(Low-Carbon Open Location-routing Problem with Simultaneous Pickup and Delivery Problem,LOLRPSPD),并通过改进野马算法进行求解。方法首先设计一种新的解码方式,使得原离散问题可以采用连续算法求解。之后,运用哈尔顿序列生成初始解,改进非线性进化概率因子,使用模拟二进制交叉,增加变异操作,以及精英保留、设置连续失败重新初始化等步骤,改进野马算法。最后,通过6组不同大小的算例将改进野马算法与原始野马算法、模拟退火算法、粒子群算法、遗传算法进行对比。结果针对中大型算例,改进野马算法远超原始野马算法。针对小型算例,在确保准确率的同时,改进野马算法对比各经典算法也在速度上具有优势。结论提出的LOLRPSD模型具备合理性,改进的野马算法针对选址路径问题具有较好的搜索能力。展开更多
文摘The location of the distribution facilities and the routing of the vehicles from these facilities are interdependent in many distribution systems. Such a concept recognizes the interdependence;attempts to integrate these two decisions have been limited. Multi-objective location-routing problem (MLRP) is combined with the facility location and the vehicle routing decision and satisfied the different objectives. Due to the problem complexity, simultaneous solution methods are limited, which are given in different objectives with conflicts in functions satisfied. Two kinds of optimal mathematical models are proposed for the solution of MLRP. Three methods have been emphatically developed for MLRP. MGA architecture makes it possible to search the solution space efficiently, which provides a path for searching the solution with two-objective LRP. At last the practical proof is given by random analysis for regional distribution with nine cities.
基金supported by Natural Science Foundation of China (10071016)the Natural Science Foundation of Fujian Province (2008J0187)the Science and Technology Foundation of Education Department of Fujian Province (JA08255), China
文摘By dint of the stability of Cauchy-type integral with kernel density of class H＊ for an open arc, this paper discusses the stability of the solution of Riemann boundary value problem with respect to the perturbation of boundary curve to be an open arc.
文摘Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it poses become an NP-hard problem.This problem has major practical significance because the effectiveness of the schedules obtained has strong economical impact for any mining project.Despite of the rapid theoretical and technical advances in this field,heuristics is still the only viable approach for large scale industrial applications.This work presents an approach combining genetic algorithms(GAs) and Lagrangian relaxation(LR) to optimally determine the CLTPSP of open pit mines.GAs are stochastic,parallel search algorithms based on the natural selection and the process of evolution.LR method is known for handling large-scale separable problems; however,the convergence to the optimal solution can be slow.The proposed Lagrangian relaxation and genetic algorithms(LR-GAs) combines genetic algorithms into Lagrangian relaxation method to update the Lagrangian multipliers.This approach leads to improve the performance of Lagrangian relaxation method in solving CLTPSP.Numerical results demonstrate that the LR method using GAs to improve its performance speeding up the convergence.Subsequently,highly near-optimal solution to the CLTPSP can be achieved by the LR-GAs.
基金supported by the National Natural Science Foundation of China (61963022,51665025,61873328)。
文摘This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.
基金Supported by Major State Research Development Program of China(2005CB321701)National Natural Science Foundation of China(10971083)
文摘In this paper, we give a hybrid method to numerically solve the inverse open cavity scattering problem for cavity shape, given the scattered solution on the opening of the cavity. This method is a hybrid between an iterative method and an integral equations method for solving the Cauchy problem. The idea of this hybrid method is simple, the operation is easy, and the computation cost is small. Numerical experiments show the feasibility of this method, even for cases with noise.
文摘A newly developed approach without crack surface discretization for modeling 2D solids with large number of cracks in linear elastic fracture mechanics is proposed with the eigen crack opening displacement (COD) boundary integral equations in this paper. The eigen COD is defined as a crack in an infinite domain under fictitious traction acting on the crack surface. Respect to the computational accuracies and efficiencies, the multiple crack problems in finite and infinite plates are solved and compared numerically using three different kinds of boundary integral equations (BIEs): 1) the dual BIEs require crack surface discretization;2) the BIEs with numerical Green’s functions (NGF) without crack surface discretization, but have to solve a complementary matrix;3) the eigen crack opening displacement (COD) BIEs in the present paper. With the concept of eigen COD, the multiple crack problems can be solved by using a conventional displacement discontinuity boundary integral equation in an iterative fashion with a small size of system matrix as that in the NGF approach, but without troubles to determine the complementary matrix. Solution of the stress intensity factors of multiple crack problems is solved and compared in some numerical examples using the above three computational algorithms. Numerical results clearly demonstrate the numerical models of eigen COD BIEs have much higher efficiency, providing a newly numerical technique for multiple crack problems. Not only the accuracy and efficiency of computation can be guaranteed, but also the overall properties and local details can be obtained. In conclusion, the numerical models of eigen COD BIEs realize the simulations for multiple crack problems with large quantity of cracks.
文摘The article introduces the main practices and achievements of the Environment and Plant Protection Institute of Chinese Academy of Tropical Agricultural Sciences in promoting the sharing of large-scale instruments and equipment in recent years,analyzes the existing problems in the management system,management team,assessment incentives and maintenance guarantee,and proposes improvement measures and suggestions from aspects of improving the sharing management system,strengthening management team building,strengthening sharing assessment and incentives,improving maintenance capabilities and expanding external publicity,to further improve the sharing management of large-scale instruments and equipment.
文摘目的针对当前物流背景下普遍出现的送货公司外包、退换货频繁等问题,结合现有的碳排放政策,提出低碳背景下开放式同时送取货选址−路径模型(Low-Carbon Open Location-routing Problem with Simultaneous Pickup and Delivery Problem,LOLRPSPD),并通过改进野马算法进行求解。方法首先设计一种新的解码方式,使得原离散问题可以采用连续算法求解。之后,运用哈尔顿序列生成初始解,改进非线性进化概率因子,使用模拟二进制交叉,增加变异操作,以及精英保留、设置连续失败重新初始化等步骤,改进野马算法。最后,通过6组不同大小的算例将改进野马算法与原始野马算法、模拟退火算法、粒子群算法、遗传算法进行对比。结果针对中大型算例,改进野马算法远超原始野马算法。针对小型算例,在确保准确率的同时,改进野马算法对比各经典算法也在速度上具有优势。结论提出的LOLRPSD模型具备合理性,改进的野马算法针对选址路径问题具有较好的搜索能力。
