Abstract
AbstractThis study presents a cooperative car‐sharing system in which various service providers jointly operate a sharing service. A distributed algorithm is proposed for rebalancing control to reduce deadhead vehicles as much as possible under the constraints of dispatchable vehicles and parking slots at car stations. Each provider cooperatively searches for the optimal solution by exchanging the estimated values of the optimal dual solutions over the communication networks between providers. Event‐driven communication is considered in which information exchange with the neighboring providers is performed only when the amount of change of the estimated optimal dual solution exceeds a threshold. Numerical instances explain that the estimations of all service providers meet the optimal rebalancing solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
