Evolutionary approach for obtaining the hub and spoke structure in the logistic network

• Autorzy: Mażbic-Kulma B. , Stańczak J. , Owsiński J. W. , Sęp K.
• Języki publikacji: EN

Abstrakty

EN

In order to describe transportation system, as a routine a connection graph would be used. Vertices of the graph can be train stations, bus stop, airports etc. The edges show direct connections between vertices. A direct application of such graph can be difficult and computational problems can occur while one would try to organize or optimize such a transportation system. Therefore, a method of aggregation of such graph was introduced, using the general kernel and shell structure and a hub and spoke transformation method of the source graph. These structures allow to concentrate and order the transport of goods/persons among vertices and enable to reduce the number of analyzed vertices as well as edges of the graph. In the presented paper we continue our work on kernel and shell and its instance hub and spoke methods of connection graph transformation. In this paper we develop model of the transportation system using the hub and spoke method with predetermined, minimum and indirectly described numbers of hub nodes. To obtain the desired structures, several versions of specialized evolutionary algorithm (EA) were developed and applied.

Słowa kluczowe

EN

kernel and shell; hub and spoke; logistic network; evolutionary algorithm

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Total Logistic Management
• Rocznik: 2011
• Tom: no. 4
• Strony: 89--105
• Opis fizyczny: Bibliogr. 30 poz., rys., tab.

Twórcy

autor

Mażbic-Kulma B.

• Systems Research Institute Polish Academy of Science, 01-447 Warsaw, 6 Newelska Street, Poland

autor

Stańczak J.

• Systems Research Institute Polish Academy of Science, 01-447 Warsaw, 6 Newelska Street, Poland

autor

Owsiński J. W.

• Systems Research Institute Polish Academy of Science, 01-447 Warsaw, 6 Newelska Street, Poland

autor

Sęp K.

• Systems Research Institute Polish Academy of Science, 01-447 Warsaw, 6 Newelska Street, Poland

Bibliografia

• [1] Ambroziak T., (2000) O pewnych aspektach modelowania systemów transportowych, (eng.:On some aspects of modeling transportation systems), Prace Naukowe Transport z. 44, OW PW Warszawa
• [2] Chen, Z.-Q., Wang, R.-L. and Okazaki, K., (2008) An Efficient Genetic Algorithm Based Approach for the Minimum Graph Bisection Problem, IJCSNS International Journal of Computer Science and Network Security, Vol. 8 No.6, pp 118–124
• [3] Cichosz P., (2000) Systemy uczące sie (in Polish), (eng.: Self-learning systems) WNT, Warszawa
• [4] Coyle J.J., Bardi E.J, Novack R.A., (1994) Transportation, Fourth Edition, New York: West Publishing Company, pp. 402
• [5] Fechner I., Najlepsze praktyki w logistyce, LOGISTICS 2006
• [6] Horner, M. and M.E. O’Kelly, (2001) Embedding economy of scale concepts for hub network design. Journal of Transport Geography, 9 (4), pp. 255–265
• [7] Jacyna M. (2001) Modelowanie wielokryterialne w zastosowaniu do oceny systemów transportowych, (eng.: Multi-criteria modeling applied to transportation systems valuation), Prace Naukowe Transport, z. 47, OWPW, Warszawa.
• [8] O’Kelly M.E (1987) A quadratic integer program for the location of interacting hub facilities, European Journal of Operational Research 32, pp. 392–404
• [9] O’Kelly M.E. and Bryan D., (2002) Interfacility interaction in models of hubs and spoke networks. Journal of Regional Science, 42 (1), pp. 145–165
• [10] Krawczyk S., Koordynacja procesów w sieciach logistycznych, Wybrane zagadnienia logistyki stosowanej Kraków 2006
• [11] Mażbic-Kulma B., Piasecki S., Geneza i organizacja sieci centrów logistycznych,Wybrane zagadnienia logistyki stosowanej Kraków 2004
• [12] Mażbic-Kulma B., Pogorzelec A., Komorowska E., (2005) Lokalizacja obiektów. Wybrane modele, algorytmy i zastosowania, Badania Systemowe IBS PAN tom 39
• [13] Mażbic-Kulma B., Sęp K., (2005) Problem wyboru węzłów tranzytowych w sieci lotniczej, (eng.: The problem of selection transit nodes in an airline network), Logistic Systems Theory And Practice OWPW, pp. 341–348
• [14] Mażbic- Kulma B, Potrzebowski H., Stańczak J., Sęp K., (2008) Evolutionary approach to solve hub-and-spoke problem using _-cliques, Evolutionary Computation and Global Optimization, Prace naukowe PW, Warszawa
• [15] Mażbic- Kulma B, Potrzebowski H., Stańczak J., Sęp K., (2009) Evolutionary approach to find kernel and shell structure of a connection graph, Total Logistic Management AGH, Cracow, pp. 37–50
• [16] McCulley C., Bloebaum C. A., (1996) Genetic tool for optimal design sequencing in complex engineering systems, Structural Optimization, Vol. 12, No. 2–3
• [17] Min H. and Gou Z., (2004) The location of hub-seaports in the global supply chain network using a cooperative competition strategy. Integrated supply management, Vol 1 No.1, pp. 51–63
• [18] Michalewicz Z., (1996) Genetic Algorithms + Data Structures = Evolution Programs, Springer Verlag, Berlin Heidelberg
• [19] Owsiński J.W., (1990) On a new naturally indexed quick clustering method with a global objective function, Applied Stochastic Models and Data Analysis,Vol. 6
• [20] Piasecki S. (1973) Optymalizacja systemów przewozowych, (eng.:Optymization of freight systems), WKiŁ,Warszawa
• [21] Potrzebowski H., Stańczak J., Sęp K., (2005) Evolutionary method in grouping of units, Proceedings of the 4th International Conference on Recognition Systems CORES’05, Springer-Verlag, Berlin-Heidelberg.
• [22] Potrzebowski H., Stańczak J., Sęp K., (2006) Evolutionary Algorithm to Find Graph Covering Subsets Using alfa-Cliques, Evolutionary Computation and Global Optimization, Prace naukowe PW,Warszawa, pp. 351–358
• [23] Potrzebowski H., Stańczak J., Sęp K., (2006) Heurystyczne i ewolucyjne metody znajdowania pokrycia grafu, korzystające z pojęcia alfa-kliki i innych ograniczeń (eng.: Heuristic and evolutionary methods of solving graph vertex cover problem using alpha-cliques and other constraints) (in Polish), Badania operacyjne i systemowe 2006, Metody i techniki, Akademicka Oficyna Wydawnicza EXIT,Warszawa
• [24] Potrzebowski H., Stańczak J., Sęp K.,(2007) Separable decomposition of graph using alphacliques, in: Kurzyński. M., Puchała E., Woźniak M, Żołnierek A. (Eds.): Computer recognition systems 2, in: Advances in soft computing Springer-Verlag, Berlin-Heidelberg, pp. 386–393
• [25] Potrzebowski H., Stańczak J., Sęp K., (2008) Evolutionary approach to solve hub-andspoke problem using _-cliques, Evolutionary Computation and Global Optimization, Prace naukowe PW,Warszawa, pp. 121–130.
• [26] Stańczak J., (2003) Biologically inspired methods for control of evolutionary algorithms, Control and Cybernetics, 32(2), pp. 411–433
• [27] Talbi E.-G. and Bessiere P., (1991) A parallel genetic algorithm for the graph partitioning problem, Proceeedings of the 5th International conference on Supercomputing, ACM, New York, pp. 312–320
• [28] Wilson R.J., (1996) Introduction to graph theory, AddisonWesley, Longman
• [29] http://people.hofstra.edu/geotrans/eng/ch3en/conc3en/hubspokederegulation.html
• [30] http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm