Font Size: a A A

Research And Application Of Unit Employee Carpooling Path Optimization Based On Fusion Algorithm

Posted on:2022-02-06Degree:MasterType:Thesis
Country:ChinaCandidate:Y WangFull Text:PDF
GTID:2512306533994759Subject:Electronic information
Abstract/Summary:PDF Full Text Request
With the increase in the number of cars in my country,car commuting takes up an increasing proportion of daily commuting trips.The increase in the number of cars on the road has brought about many traffic problems,and the problem of congestion during commuting hours is particularly prominent.The current mode of traffic restriction and congestion charging fails to fully consider the temporary travel needs of commuters.Carpool travel is a good way to relieve the traffic pressure and use resources efficiently during commuting,and it is also the preferred choice of many travelers.Online taxi sharing has developed rapidly in recent years,but the existing Internet taxi platforms have failed to get rid of the profit-oriented operation nature,and the number of cars driven by profit will only increase.In this thesis,a more reasonable and effective commuting scheme is put forward based on the research of vehicle sharing at home and abroad.Aiming at the problem of multiplex path optimization,an innovative intelligent algorithm is proposed to optimize multiplex path,and the related experimental research is carried out.The specific work of this thesis is as follows:The thesis describes in detail the commuting ride-sharing of unit employees,and clarifies the concept and principle of unit ride-sharing.This thesis also conducts a detailed study on the vehicle routing problem,describes and assumes the unit's shared-ride routing problem under the relevant basic model,and constructs a corresponding multi-objective optimization model.This thesis introduces and compares some common algorithms of vehicle routing problem,and selects sparrow algorithm and genetic algorithm to solve the problem in this thesis.In this thesis,the optimization algorithm is designed in detail,and the corresponding coding form is designed;In addition,adaptive weights are added to improve the local search ability and accuracy of the algorithm;As well as through the sine and cosine optimization to prevent premature convergence of the algorithm.The thesis tests the optimization of the benchmark function,and analyzes the difference between the six algorithms according to the results.Through the survey of the information of the employees of the unit,the corresponding time window shall be properly processed and set as the data set.Three algorithms are used to calculate the example,and a series of data such as travel distance,time and variance are obtained.By comparing the changes of index values before and after optimization,the effectiveness of the model and fusion algorithm is verified.The thesis builds the software system of unit multiplication based on the algorithm.Through various tests,the results show that the system can run the designed functions well,and basically achieve the functional requirements of the unit carpool scheme.Once again,it verifies the feasibility of the commuter carpooling scheme and the practicability of the innovative algorithm.This thesis provides the theory and technology for the improvement of the research on employee carpooling in subsequent units,and also lays the foundation for the later program development and practical application.
Keywords/Search Tags:Traffic congestion, Unit ride-sharing, Vehicle routing, Multi-objective optimization, Fusion algorithm
PDF Full Text Request
Related items