Research On Car-sharing Site Selection And Vehicle Scheduling Optimization By Considering Network Resource Sharing

In recent years,with the rapid development of the sharing economy in China,car-sharing has developed rapidly,which is a sharing economy model and an emerging mode of travelling.However,while car-sharing is currently developing rapidly,it also faces many obstacles and challenges.On the one hand,most of the car-sharing companies have enhanced their market competitiveness by expanding their networks.Nevertheless,blindly expanding networks will lead to a imbalance between the number of car-sharing and the demand for travel,resulting in a waste of resources,which is inconsistent with the original intention of sharing resources;on the other hand,car-sharing companies still face problems such as irrational sites selection and lack of charging facilities.But,the resources of a single enterprise are limited,it is difficult to build a perfect infrastructure.In terms of the rebalancing of car-sharing,the networks of a single enterprise are relatively scattered,which causes problems such as long movement paths between networks,low scheduling efficiency,and poor convenience for users,and it reduces the users’ rental experience.In view of the above problems such as irrational site selection and low resource utilization rate,which caused by the disorderly competition of car-sharing enterprises,this thesis conducts research on the site selection and vehicle scheduling of car-sharing enterprises from the perspective of resource sharing.Firstly,based on factors such as user travel cost,network integration cost,operation service cost,vehicle residual value recovery,etc.,a 0-1 integer programming model for car-sharing site selection is established,and a genetic algorithm is designed to solve the integer model to achieve the purpose of integrating and optimizing multiple car-sharing enterprises’ networks;Secondly,from the perspective of resource sharing,the scheduling rebalancing problem of car-sharing is studied.With the goal of minimizing the total scheduling cost,the 0-1integer programming model of the problem is established,and the genetic algorithm for solving the problem is designed by combining 0-1 coding,crossover operator and mutation operator.In order to realize the reasonable optimization of the number of vehicles in and out of each network,vehicle scheduling path and staff cycling path.Finally,the feasibility and effectiveness of the above two models are verified by numerical examples.On this basis,sensitivity analysis is conducted on the new network cost,unit vehicle purchase cost,vehicle salvage value recovery rate,number of participating cooperative network,number of parked vehicles in cooperative network,number of dispatchers and other parameters.In order to determine the optimal number of participating outlets cooperation,the optimal number of dispatchers and other vehicle sharing scheduling optimization suggestions are provided.