Planning and optimising organisational travel plans using an evolutionary algorithm

Authors:
Neil Urquhart
Affiliations:
Centre for Emergent Computing, Edinburgh Napier University, Edinburgh, UK
Venue:
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
Year:
2011

Citing 5
Cited 0

The vehicle routing problem

The vehicle routing problem
On fairness in the carpool problem

Journal of Algorithms
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows

Applied Intelligence
Carbon-friendly travel plan construction using an evolutionary algorithm

Proceedings of the 9th annual conference on Genetic and evolutionary computation
A search space analysis for the waste collection vehicle routing problem with time windows

Proceedings of the 11th Annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Commuting to the workplace is a highly individualistic experience, especially where the private car is the chosen mode of transport. The costs of using cars with low occupancy rates are significant in environmental terms as well as requiring the provision of parking space at the workplace. This paper examines the use of an Evolutionary Algorithm based problem solver to construct travel plans for three sites with 248,404 and 520 employees respectively at each site. Results presented suggest that a significant saving in overall distance travelled and parking spaces required is possible. The algorithm employed takes into account both hard constraints and soft constraints (such as work patterns and journey flexibility).