The vehicle relocation problem with operation teams in one-way carsharing systems.
Saved in:
| Title: | The vehicle relocation problem with operation teams in one-way carsharing systems. |
|---|---|
| Authors: | Lu, Yuwei1,2 (AUTHOR), Wang, Kangzhou3 (AUTHOR), Yuan, Biao4,5 (AUTHOR) biaoyuan_ie@163.com |
| Source: | International Journal of Production Research. Jun2022, Vol. 60 Issue 12, p3829-3843. 15p. 1 Diagram, 8 Charts, 2 Graphs, 1 Map. |
| Subjects: | Teams in the workplace, Mathematical programming, Car sharing, Search algorithms, Vehicles, Problem solving |
| Geographic Terms: | Shanghai (China) |
| Abstract: | The imbalance of available vehicles at different stations is an outstanding challenge in one-way carsharing systems. Dedicated to this issue, the operation teams in one company in Shanghai, China, each of which contains several workers, take operation vehicles to rebalance sharing vehicles among stations. A pertinent optimization problem, called the vehicle relocation problem with operation teams, is encountered in practice to find the relocation pairs of stations and the visiting routes of operation vehicles. In this paper, a mathematical programming model for minimizing the sum of relocation distance of sharing vehicles and travel distance of operation vehicles is constructed. An adaptive large neighbourhood search algorithm with several problem-specific algorithmic components is developed to efficiently solve the problem. Computational results validate the competitive performance of the proposed approach by comparing it with the commercial optimization software and a sequential approach. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | The imbalance of available vehicles at different stations is an outstanding challenge in one-way carsharing systems. Dedicated to this issue, the operation teams in one company in Shanghai, China, each of which contains several workers, take operation vehicles to rebalance sharing vehicles among stations. A pertinent optimization problem, called the vehicle relocation problem with operation teams, is encountered in practice to find the relocation pairs of stations and the visiting routes of operation vehicles. In this paper, a mathematical programming model for minimizing the sum of relocation distance of sharing vehicles and travel distance of operation vehicles is constructed. An adaptive large neighbourhood search algorithm with several problem-specific algorithmic components is developed to efficiently solve the problem. Computational results validate the competitive performance of the proposed approach by comparing it with the commercial optimization software and a sequential approach. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00207543 |
| DOI: | 10.1080/00207543.2021.1933238 |
