Vehicle routing in one-way carsharing service with ridesharing options: A variable neighborhood search algorithm

Authors:

Publisher website

27 December 2024

journal article
research article
Published by Elsevier in Transportation Research Part C: Emerging Technologies

Vol. 171
DOI:10.1016/j.trc.2024.104983

Abstract

No abstract available

Keywords

Funding Information

Research Grants Council, University Grants Committee (HKU 17204521)
National Natural Science Foundation of China (72461160316)
National Natural Science Foundation of China (71925001)
National Natural Science Foundation of China (7210106 4)
Fundamental Research Funds for the Central Universities (JZ2023YQTD0073)

This publication has 56 references indexed in Scilit:

General Variable Neighborhood Search for the optimization of software quality
Computers & Operations Research, 2024
An adaptive large neighborhood search method for rebalancing free-floating electric vehicle sharing systems
Computers & Operations Research, 2023
Planning station capacity and fleet size of one-way electric carsharing systems with continuous state of charge functions
European Journal of Operational Research, 2020
A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
Computers & Operations Research, 2017
Carsharing operations policies: a comparison between one-way and two-way systems
Transportation, 2015
An optimization framework for the development of efficient one-way car-sharing systems
European Journal of Operational Research, 2015
The relocation problem for the one‐way electric vehicle sharing
Networks, 2014
Optimization for dynamic ride-sharing: A review
European Journal of Operational Research, 2012
An artificial bee colony algorithm for the capacitated vehicle routing problem
European Journal of Operational Research, 2011
Simulated annealing metaheuristics for the vehicle routing problem with time windows
Annals of Operations Research, 1996