Introduction
The method presented in this chapter has its origin in adaptive meshing, using planar honeycomb structures as a tool to dimension radio-cellular network according to mobile traffic (Créput et al. 2000, 2005; Créput and Koukam 2006). Here, the approach has been transferred and generalized to a terrestrial transportation context. The transport mesh is a geometric structure, in the plane, that adapts and modifies its shape according to traffic demands. By separating the transportation network from the underlying demands, the approach theoretically allows to deal with noisy or incomplete data as well as with fluctuating demand. Furthermore, continuous visual feedback during simulations is naturally allowed.
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
Arora, S.: Polynomial-time Approximation Schemes for Euclidean TSP and other Geometric Problems. Journal of the ACM 45(5), 753–782 (1998)
Balas, E.: The prize collecting traveling salesman problem. Networks 19, 621–636 (1989)
Boese, K.D., Kahng, A.B., Muddu, S.: Adaptive Multi-Start Technique for Combinatorial Global Optimization. Journal of Operations Research Letters 16, 101–113 (1994)
Bräysy, O., Dullaert, W., Gendreau, M.: Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows. Journal of Heuristics 10(6), 587–611 (2004)
Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., et al. (eds.) Combinatorial Optimization, pp. 315–338. Wiley, Chichester (1979)
Cochrane, E.M., Beasley, J.E.: The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem. Neural Networks 16, 1499–1525 (2003)
Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52, 928–936 (2001)
Cordeau, J.F., et al.: New Heuristics for the Vehicle Routing Problem. In: Langevin, A., Riopel, D. (eds.) Logistics Systems: Design and Optimization, pp. 279–297. Springer, New York (2005)
Créput, J.C., Koukam, A.: Local search study of honeycomb clustering problem for cellular planning. International Journal of Mobile Network Design and Innovation 1(2), 153–160 (2006)
Créput, J.C., Koukam, A.: Interactive Meshing for the Design and Optimization of Bus Transportation Networks. Journal of Transportation Engineering, ASCE (in press, 2007a)
Créput, J.C., Koukam, A.: Transport Clustering and Routing as a Visual Meshing Process. Journal of Information and Optimization Sciences, Taru Publications (in press, 2007b)
Créput, J.C., Koukam, A., Hajjam, A.: Self-Organizing Maps in Evolutionary Approach for the Vehicle Routing Problem with Time Windows. International Journal of Computer Science and Network Security 7(1), 103–110 (2007)
Créput, J.C., Lissajoux, T., Koukam, A.: A Connexionnist Approach to the Hexagonal Mesh Generation. In: 16th IMACS World Congress, Lausanne (2000)
Créput, J.C., et al.: Automatic Mesh Generation for Mobile Network Dimensioning using Evolutionary Approach. IEEE Transactions on Evolutionary Computation 9(1), 18–30 (2005)
Ergun, Ö., Orlin, J.B., Steele-Feldman, A.: Creating very large scale neighborhoods out of smaller ones by compounding moves: a study on the vehicle routing problem. MIT Sloan Working Paper No. 4393-02, USA (2003)
Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63–76. McGraw-Hill, UK (1999)
Ghaziri, H.: Supervision in the Self-Organizing Feature Map: Application to the Vehicle Routing Problem. In: Osman, I.H., Kelly, J.P. (eds.) Meta-Heuristics: Theory & Applications, pp. 651–660. Kluwer, Boston (1996)
Golden, B.L., et al.: Metaheuristics in vehicle routing. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics, pp. 33–56. Kluwer, Boston (1998)
Gomes, L.C.T., Von Zuben, F.J.A.: Vehicle Routing Based on Self-Organization with and without Fuzzy Inference. In: Proc. of the IEEE International Conference on Fuzzy Systems, vol. 2, pp. 1310–1315 (2002)
Hayari, N., Créput, J.C., Koukam, A.: A Neural Evolutionary Algorithm for Geometric Median Cycle Problem. In: European Simulation and Modeling Conference, ESM 2005, EUROSIS, Porto, Portugal (2005)
Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 126, 106–130 (2000)
Kohonen, T.: Self-Organization Maps and associative memory, 3rd edn. Springer, Berlin (2001)
Labbé, M., Laporte, G.: Maximizing user convenience and postal service efficiency in post box location. Belgian Journal of Operations Research, Statistics and Computer Science 26, 21–35 (1986)
Labbé, M., et al.: The Ring Star Problem: Polyhedral Analysis and Exact Algorithm. Networks 43, 177–189 (2004)
Labbé, M., Rodríguez Martín, I., Salazar González, J.J.: Locating Median Cycles in Networks. European Journal of Operational Research 160, 457–470 (2005)
Matsuyama, Y.: Self-organization via competition, cooperation and categorization applied to extended vehicle routing problems. In: Proc. of the International Joint Conference on Neural Networks, Seatle, WA, pp. 385–390 (1991)
Mester, D., Bräysy, O.: Active Guided Evolution Strategies for Large Scale Vehicle Routing Problems with Time Windows. Computers & Operations Research 32, 1593–1614 (2005)
Min, H., Jayaraman, V., Srivastava, R.: Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research 108, 1–15 (1998)
Modares, A., Somhom, S., Enkawa, T.: A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems. International Transactions in Operational Research 6, 591–606 (1999)
Moscato, P.: Memetic Algorithms: A Short Introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, McGraw-Hill, New York (1999)
Mühlenbein, H.: Evolution in Time and Space – The Parallel Genetic Algorithm. In: Rawlins, G. (ed.) Foundations of Genetic Algorithms, Morgan Kaufmann, Los Altos, CA (1991)
Reinelt, G.: TSPLIB-A traveling salesman problem library. ORSA Journal on Computing 3, 376–384 (1991)
Renaud, J., Boctor, F., Laporte, G.: Efficient heuristics for median cycle problems. Journal of the Operational Research Society 55, 179–186 (2004)
Schumann, M., Retzko, R.: Self-organizing maps for vehicle routing problems minimizing an explicit cost function. In: Proc. of the International Conference on Artificial Neural Networks, Paris, pp. 401–406 (1995)
Schwardt, M., Dethloff, J.: Solving a continuous location-routing problem by use of a self-organizing map. Int J. Physical Distribution & Logistics Management 35(6), 390–408 (2005)
Solomon, M.M.: Algorithms for the vehicle routing, and scheduling problems with time window constrains. Operations Research 35, 254–264 (1987)
Taillard, E.D., et al.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation science 31, 170–186 (1997)
Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing 15, 333–348 (2003)
Vakhutinsky, A.I., Golden, B.L.: Solving vehicle routing problems using elastic net. In: IEEE International Conference on Neural Network, pp. 4535–4540 (1994)
Volgenant, T., Jonker, R.: On some generalizations of the traveling salesman problem. Journal of the Operational Research Society 38, 1073–1079 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Créput, JC., Koukam, A. (2008). Self-organization in Evolution for the Solving of Distributed Terrestrial Transportation Problems. In: Prasad, B. (eds) Soft Computing Applications in Industry. Studies in Fuzziness and Soft Computing, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77465-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-77465-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77464-8
Online ISBN: 978-3-540-77465-5
eBook Packages: EngineeringEngineering (R0)