This content is not included in
your SAE MOBILUS subscription, or you are not logged in.
A Cost-Effective Offline Routing Optimization Approach to Employee Shuttle Services
Technical Paper
2017-01-0240
ISSN: 0148-7191, e-ISSN: 2688-3627
This content contains downloadable datasets
Annotation ability available
Sector:
Language:
English
Abstract
Ride Hailing service and Dynamic Shuttle are two key smart mobility practices, which provide on-demand door-to-door ride-sharing service to customers through smart phone apps. On the other hand, some big companies spend millions of dollars annually in third party vendors to offer shuttle services to pick up and drop off employees at fixed locations and provide them daily commutes for employees to and from work. Efficient fixed routing algorithms and analytics are the key ingredients for operating efficiency behind these services. They can significantly reduce operating costs by shortening bus routes and reducing bus numbers, while maintaining the same quality of service. This study developed an off-line optimization routing method for employee shuttle services including regular work shifts and demand based shifts (e.g. overtime shifts) in some regions.
Authors
Citation
Zhao, Y., Zhou, H., and Liu, Y., "A Cost-Effective Offline Routing Optimization Approach to Employee Shuttle Services," SAE Technical Paper 2017-01-0240, 2017, https://doi.org/10.4271/2017-01-0240.Data Sets - Support Documents
Title | Description | Download |
---|---|---|
Unnamed Dataset 1 | ||
Unnamed Dataset 2 |
Also In
References
- Letchford , A.N. , LysgaardR , J. and Eglese , W. 2007 A branch-and-cut algorithm for the capacitated open vehicle routing problem Journal of the Operational Research Society 58 12 1642 1651
- Baldacci , R. , Mingozzi , A. and Roberti , R. 2012 Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints European Journal of Operational Research 218 1 6
- Mattos Ribeiro , G. and Laporte , G. 2012 An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem Computers & Operations Research 39 728 735
- MirHassani , S.A. and Abolghasemi , N. 2011 A particle swarm optimization algorithm for open vehicle routing problem Expert Systems with Applications 38 9 11547 11551
- Salari , M. , Toth , P. and Tramontani , A. 2010 An ILP improvement procedure for the Open Vehicle Routing Problem Computers & Operations Research 37 12 2106 2120
- DE Backer , B. , Furnon , V. , Shaw , P. , Kilby , P. and Prosser , P. 2000 Solving vehicle routing problems using constraint programming and metaheuristics Journal of Heuristics 6 501 523
- Guimarans , D. , Herrero R. , Riera , D. , Juan , A.A. and Ramos , J.J. 2011 Combining probabilistic algorithms, constraint programming and lagrangian relaxation to solve the vehicle routing problem Annals of Mathematics and Artificial Intelligence 62 3-4 299 315
- Rossi , F. , van Beek , P. , Walsh , T. 2006 Handbook of Constraint Programming Elsevier Amsterdam
- Trick , M. Constraint programming [PowerPoint slides] http://mat.tepper.cmu.edu/trick/
- ILOG Inc. ILOG CPLEX 12.6.2 Documentation 2015