Abstract
This paper shows the work done in the definition of a new hybrid algorithm that is based on two evolutionary techniques: simulated annealing and genetic algorithms. The new algorithm has been used to solve the problem of finding the optimal route for a bus in a rural area where people are geographically dispersed. The result of the work done is an algorithm that (in a reasonable time) is able to obtain good solutions regardless of the number of stops along a route.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M.R., Johnson, D.S.: Computers and Intractability; a Guide to the Theory of Np-Completeness. W. H. Freeman & Co., New York (1990)
Jorgensen, R.M., Larsen, J., Bergvinsdottir, K.B.: Solving the Dial-a-Ride problem using genetic algorithms (2004)
Applegate, D.L., Bixby, R.M., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem (2006), ISBN 0691129932
Dantzig, G.B., Ramser, J.H.: The Truck Dispatching Problem. Management Science 6(1), 80–91 (1959)
Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems (2005)
Repoussis, P.P., Tarantilis, C.D., Ioannou, G.: Arc-guided evolutionary algorithm for the vehicle routing problem with time windows (2009)
Rutenbar, R.A.: Simulated Annealing algorithms: an overview (2002)
Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem (1994)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem (1997)
Repoussis, P.P., Tarantilis, C.D., Ioannou, G.: An Evolutionary Algorithm for the Open Vehicle Routing Problem with Time Windows (2009)
Zhang, L., Yao, M., Zheng, N.: Optimization and improvement of Genetic Algorithms solving Traveling Salesman Problem (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carballedo, R., Osaba, E., Fernández, P., Perallos, A. (2011). A New Evolutionary Hybrid Algorithm to Solve Demand Responsive Transportation Problems. In: Abraham, A., Corchado, J.M., González, S.R., De Paz Santana, J.F. (eds) International Symposium on Distributed Computing and Artificial Intelligence. Advances in Intelligent and Soft Computing, vol 91. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19934-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-19934-9_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19933-2
Online ISBN: 978-3-642-19934-9
eBook Packages: EngineeringEngineering (R0)