Carsharing systems can provide more reliable service than transit systems and spare extra fees in car ownership,insurance and parking compared to private cars.To make the service more convenient,many carsharing organizations can provide travellers with a one-way service,by which travellers can return their used vehicles to any stations.While it is in nature more flexible than round-trip service,this flexibility,however,comes at a price of vehicle inventory imbalance.This paper focuses on the combined vehicle relocation and operator assignment(CVROA)problem in one-way carsharing systems.Specifically,we consider three different sufficiency conditions of system supplies(i.e.,shared vehicles and vehicle operators): 1)sufficient vehicles and sufficient operators; 2)insufficient vehicles and sufficient operators; 3)sufficient vehicles and insufficient operators.In accordance,three linear programming(LP)models are proposed to describe these conditions and optimize the corresponding system operations and CPLEX/GAMS was utilized to solve these LP problems.A numerical analysis was conducted in a modified version of the Sioux Falls network.The numerical results showed the optimal vehicle relocations and operator assignments for the proposed models.It was also proved that distributing shared vehicles in more stations obtained a less system costs.The optimal number of operators that needed for the carsharing systems was also derived from the numerical results.