Abstract
Route optimization of hazardous materials transportation is one of the basic steps in ensuring the safety of hazardous materials transportation. The optimization scheme may be a security risk if road screening is not completed before the distribution route is optimized. For road screening issues of hazardous materials transportation, a road screening algorithm of hazardous materials transportation is built based on genetic algorithm and Levenberg–Marquardt neural network (GA-LM-NN) by analyzing 15 attributes data of each road network section. A multi-objective robust optimization model with adjustable robustness is constructed for the hazardous materials transportation problem of single distribution center to minimize transportation risk and time. A multi-objective genetic algorithm is designed to solve the problem according to the characteristics of the model. The algorithm uses an improved strategy to complete the selection operation, applies partial matching cross shift and single ortho swap methods to complete the crossover and mutation operation, and employs an exclusive method to construct Pareto optimal solutions. Studies show that the sets of hazardous materials transportation road can be found quickly through the proposed road screening algorithm based on GA-LM-NN, whereas the distribution route Pareto solutions with different levels of robustness can be found rapidly through the proposed multi-objective robust optimization model and algorithm.
Highlights
Hazardous materials refer to products with flammable, poisonous, and corrosive properties that can cause casualties, damage to properties, and environmental pollution, and require special protection in the process of transportation, loading, unloading, and storage
Distribution route optimization of hazardous materials refers to the design of a safe and efficient distribution plan based on existing transportation network according to the characteristics of hazardous materials and transportation requirements
This paper extensively studies the problem of road screening for hazardous materials transportation, and builds road screening algorithm based on genetic algorithm (GA)-LM-NN and the multi-objective robust optimization model of transportation route with adjustable robustness based on Bertsimas
Summary
Hazardous materials refer to products with flammable, poisonous, and corrosive properties that can cause casualties, damage to properties, and environmental pollution, and require special protection in the process of transportation, loading, unloading, and storage. When Gri 1⁄4 0, the max part objective function is equal to 0, and the model is the most sensitive to uncertain information, that is, when the weight of a road section changes in the transportation network, the optimal solution of the model is expected to change; with Gri increasing gradually, sensitivity of the model to uncertain information is reduced and the obtained solution is robust[32] In this part, the adjacency matrix of uncertain risk of transportation and time among the nodes is changed into one-dimensional matrix, m = (i−1)n+J(1 i n, 0 j n), decision variables xij = xm, uncertain transportation risk ~rij 1⁄4 ~rm, uncertain transportation time ~tij 1⁄4 ~tm, and other corresponding basic data are changed in the form of subscript m. Set feasible solution set Xvrp to satisfy all constraints, and robust discrete optimization criterion of the literature [33] will be used to change the multi-objective robust optimization model of hazardous materials distribution route in solving the following nominal problem
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.