MODELS AND METHODS FOR MANAGING MUNICIPAL FREIGHT TRANSPORTATION

Development of a mathematical model and algorithm for creating an optimal vehicle loading plan for municipal transportation, considering costs for cargo and empty mileage by applying methods of dynamic queue formation, priority ranking, and handling critical situations.System analysis, mathematical modeling, heuristic algorithms, and scheduling theory were used.The proposed model accounts for multifactor processes and constraints: scheduled and unscheduled requests, priorities, vehicle performance (VP), service time, and possible disruptions.Optimization involves preference functions, penalties, and request ranking to minimize time and costs.A mathematical model was developed to account for cargo and empty mileage costs using logical variables.A dynamic queue formation method was proposed, including sequential vehicle selection, delay cost-based request ranking, and critical situation analysis.The algorithm involves vehicle condition analysis, prioritization, loading planning, and process management, optimizing task allocation, reducing costs, and enhancing transportation efficiency.The method is based on a combined use of heuristic techniques and search algorithms, tailored to the features of municipal transport systems.Logical variables ensure flexibility and accuracy in modeling.The model can be implemented in automated transport management systems, reducing costs, optimizing resources, and improving request handling quality.The method accounts for real operating conditions with real-time dispatching capabilities.The proposed dynamic queue formation method accounts for priorities, critical situations, and economic factors, streamlining transportation processes and enhancing the efficiency of municipal transportation.