Research On Scheduling And Optimization Of Multi-oil Sources Dispatching Plan In Refined Oil Region

China is a big consumer of refined oil,and a large amount of refined oil is dispatched and sold through different logistics methods every day.At present,the scheduling of multisource dispatching plans in the refined oil area is faced with difficulties such as multiple constraints,large dispatch time domains,and frequent changes in supply and demand,resulting in poor adaptability of the preparation plan and low actual operability,making manual preparation of the plan more difficult.At the same time,the centralized management and control of the national pipeline network and the independent accounting of logistics and transportation costs have gradually emerged.This paper focuses on the scheduling of multioil source dispatch planning in the refined oil region,and studies the rolling plan preparation model based on the constraint satisfaction problem and the dispatch optimization model considering the cost,which are useful for improving the informatization and intelligence level of my country's oil and gas industry and,effectively reducing the operating costs of regional sales companies,and guaranteeing the safety of refined oil supply have practical significance and theoretical research value.This paper constructs a rolling scheduling planning model based on constraint satisfaction problems,and specifically proposes a three-stage heuristic algorithm for determining sequence-time-inventory: based on the Space Recursivse Method(SRM)to determine the pipeline transportation prioritize,determine the delivery time based on the cohesion principle of the distribution operation,determine the total distribution based on the stability of the inventory,and obtain a solution to the current scheduling plan preparation problem.The effectiveness of the three-stage heuristic algorithm is verified through a real scheduling case in a large area.By adjusting the planning time domain and planning demand,and repeatedly calling the three-phase heuristic algorithm to achieve rolling planning,the problem of low practical operability and loss of guiding significance due to the large scheduling time domain is solved.In response to the requirements of the oil and gas industry for the stripping and reorganization of the pipeline network and cost control,this article considers the cost accounting of the dispatch plan instruction,and aims at minimizing the transportation cost and inventory cost,and establishes a continuous-time mixed integer linear programming(MILP)model considering multiple oil products and complex pipeline networks,and proposes an improved variable neighborhood search algorithm based on critical values,which can be obtained in a short time Cost-optimized feasible scheduling plan.Through the development of a refined oil product dispatching plan management system in a petrochemical region,this paper realizes the functions of dispatching plan command generation,dispatching cost accounting,plan forecasting and early warning,plan difference analysis,etc.,providing auxiliary decision support for dispatching staff and greatly reducing labor workload,improving the implementability of the plan,and at the same time verifies the feasibility and effectiveness of the rolling plan preparation model based on the constraint satisfaction problem and the scheduling optimization model considering the cost.