Interactive Meshing for the Design and Optimization of Bus Transportation Networks
Publication: Journal of Transportation Engineering
Volume 133, Issue 9
Abstract
We propose an intelligent tool for terrestrial transportation design based on the underlying concept of adaptive meshing. Vehicle routes are deformable visual patterns which cover the geographic area adapting shapes to distributed demands or specific places. In this way the system allows dynamic interaction and continuous visual feedback for the designer constructing and evaluating a transportation bus network. To assist the designer, an optimization framework merging neural networks and evolutionary algorithms permits one to position services and create routes among them automatically. The transport system optimizer built on a geographic information system is illustrated by application to a real life case of clustering and routing for the transportation of the 780 employees of an enterprise.
Get full access to this article
View all available purchase options and get full access to this article.
References
Arora, S. (1998). “Polynomial Time Approximation Schemes for Euclidean k-medians and related problems.” ACM STOC’98.
Balas, E. (1989). “The prize collecting traveling salesman problem.” Networks, 19, 621–636.
Boese, K. D., Kahng, A. B., and Muddu, S. (1994). “Adaptive multi-start technique for combinatorial global optimization.” J. Operations Research Letters, 16, 101–113.
Christofides, N., Mingozzi, A., and Toth, P. (1979). “The vehicle routing problem.” Combinatorial optimization, Christofides, N. et al., eds., Wiley, New York, 315–338.
Cochrane, E. M., and Beasley, J. E. (2003). “The co-adaptive neural network approach to the Euclidean travelling salesman problem.” Neural Networks, 16, 1499–1525.
Créput, J. C., Koukam, A., Lissajoux, T., and Caminada, A. (2005). “Automatic mesh generation for mobile network dimensioning using evolutionary approach.” IEEE Trans. Evol. Comput., 9(1), 18–30.
Edelkamp, S., Jabbar, S., and Willhalm, T. (2005). “Geometric travel planning.” IEEE Trans. Intell. Transp. Syst., 6(1), 5–16.
Ghaziri, H. (1996). “Supervision in the self-organizing feature map: Application to the vehicle routing problem.” Meta-heuristics: Theory & applications, I. H. Osman and J. P. Kelly, eds., Kluwer, Boston, 651–660.
Hansen, P., Mladenovic, N., and Taillard, E. D. (1998). “Heuristic solution of the multisource Weber problem as a p-median problem.” Oper. Res. Lett., 22, 55–62.
Kohonen, T. (1982). “Clustering, taxonomy, and topological maps of patterns.” Proc., 6th Int. Conf. on Pattern Recognition.
Kohonen, T. (2001). Self-organization maps and associative memory, 3rd Ed., Springer, Berlin.
Kumar, P., Singh, V., and Reddy, D. (2005). “Advanced traveler information system for Hyderabad City.” IEEE Trans. Intell. Transp. Syst., 6(1), 26–37.
Labbé, M., and Laporte, G. (1986). “Maximizing user convenience and postal service efficiency in post box location.” Belgian J. Operations Research, Statistics, and Computer Science, 26, 21–35.
Labbé, M., Laporte, G., Rodríguez Martín, I., and Salazar González, J. J. (2004). “The ring star problem: Polyhedral analysis and exact algorithm.” Networks, 43, 177–189.
Labbé, M., Rodríguez Martín, I., and Salazar González, J. J. (2005). “Locating median cycles in networks.” Eur. J. Oper. Res., 160, 457–470.
Laporte, G., and Palekar, U. (2000). “Some applications of the clustered traveling salesman problem.” Les cahiers du GERAD, http://www.gerad.ca .
Love, R. F., and Morris, J. G. (1972). “Modelling intercity road distances by mathematical functions.” Oper. Res. Q., 23, 61–72.
Min, H., Jayaraman, V., and Srivastava, R. (1998). “Combined location-routing problems: A synthesis and future research directions.” Eur. J. Oper. Res., 108, 1–15.
Modares, A., Somhom, S., and Enkawa, T. (1999). “A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems.” Int. Trans. Oper. Res., 6, 591–606.
Moscato, P. (1999). “Memetic algorithms: A short introduction.” New ideas in optimization, D. Corne, M. Dorigo, and F. Glover, eds., McGraw-Hill, New York.
Renaud, J., Boctor, F., and Laporte, G. (2004). “Efficient heuristics for median cycle problems.” J. Operational Research Society, 55, 179–186.
Resende, M. G. C., and Ribeiro, C. C. (2002). “Greedy randomized adaptive search procedures.” State-of-the-art handbook in metaheuristics, F. Glover and G. Kochenberger, eds., Kluwer, Dordrecht, The Netherlands.
Smith, K. A. (1999). “Neural networks for combinatorial optimization: A review of more than a decade of research.” INFORMS J. Comput., 11(1), 15–34.
Solomon, M. M. (1987). “Algorithms for the vehicle routing, and scheduling problems with time window constrains.” Oper. Res., 35, 254–264.
Tobler, W. R. (1993). “Speculations on the geometry of geography, in three presentations on geographical analysis and modelling.” Technical Rep. No. 93-1, National Center for Geographic Information and Analysis (NCGIA), Univ. of California, Santa Barbara, Calif.
Volgenant, T., and Jonker, R. (1987). “On some generalizations of the traveling salesman problem.” J. Oper. Res. Soc., 38, 1073–1079.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 133 • Issue 9 • September 2007
Pages: 529 - 538
Copyright
© 2007 ASCE.
History
Received: Aug 1, 2006
Accepted: Mar 7, 2007
Published online: Sep 1, 2007
Published in print: Sep 2007
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.