Show simple item record

Układanie tras pojazdów w łańcuchu dostaw. Modele, metody, zastosowania

dc.contributor.authorJadczak, Radosław
dc.date.accessioned2023-10-19T05:54:47Z
dc.date.available2023-10-19T05:54:47Z
dc.date.issued2019
dc.identifier.citationJadczak R., Układanie tras pojazdów w łańcuchu dostaw. Modele, metody, zastosowania, WUŁ, Łódź 2019, https://doi.org/10.18778/8142-140-9pl_PL
dc.identifier.isbn978-83-8142-140-9
dc.identifier.urihttp://hdl.handle.net/11089/48103
dc.description.abstractWażnym wyzwaniem, przed jakim stoją decydenci zajmujący się planowaniem zaopatrzenia i dystrybucji w łańcuchach dostaw, jest obsługa transportowa. W publikacji dokonano próby zebrania oraz usystematyzowania wiedzy i doświadczeń z ostatnich kilkudziesięciu lat badań nad zagadnieniami z zakresu optymalizacji problemów transportowych. Omówiono metody rozwiązywania kwestii związanych z układaniem tras jednego i wielu pojazdów, a także zaprezentowano ich warianty.pl_PL
dc.language.isoplpl_PL
dc.publisherWydawnictwo Uniwersytetu Łódzkiegopl_PL
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Międzynarodowe*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjecttransport samochodowypl_PL
dc.subjectłańcuch dostawpl_PL
dc.subjectkanały dystrybucjipl_PL
dc.subjectzadania transportowepl_PL
dc.subjectkomiwojażerpl_PL
dc.subjectheurystykapl_PL
dc.titleUkładanie tras pojazdów w łańcuchu dostaw. Modele, metody, zastosowaniapl_PL
dc.typeBookpl_PL
dc.page.number292pl_PL
dc.contributor.authorAffiliationUniwersytet Łódzki, Wydział Ekonomiczno-Socjologiczny, Katedra Badań Operacyjnychpl_PL
dc.identifier.eisbn978-83-8142-141-6
dc.referencesArabas J. (2001), Wykłady z algorytmów ewolucyjnych, Wydawnictwa Naukowo-Techniczne, Warszawa.pl_PL
dc.referencesArchetti C., Hertz A., Speranza M. (2006), A tabu search algorithm fort he split delivery vehicle routing problem, „Transport Science”, Vol. 40, s. 64–73.pl_PL
dc.referencesAfifi S., Dang D.-C., Moukrim A. (2013), A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints, 7th International Conference, Learning and Intelligent Optimization (LION 7), Catania, Italy, s. 259–265.pl_PL
dc.referencesBalinski M., Quandt R. (1964), On an integer program for a delivery problem, „Operations Research”, Vol. 52, s. 723–738.pl_PL
dc.referencesBaran B., Schaerer M. (2003), A multiobjective ant system for vehicle routing problem with time windows, Proceedings of the 21st IASTED International Conference Applied Informatics, s. 97–102.pl_PL
dc.referencesBaraniecka A. (2004), ECR Efficient Consumer Response. Łańcuch dostaw zorientowany na klienta, Instytut Logistyki i Magazynowania, Poznań.pl_PL
dc.referencesBard J.F., Huang L., Dror M., Jaillet P. (1998), A branch and cut algorithm for the VRP with satellite facilities, „IIE Transactions”, Vol. 30, s. 821–834.pl_PL
dc.referencesBaker B.M., Ayechew M.A. (2003), A genetic algorithm for the vehicle routing problem, „Computers & Operations Research”, Vol. 30, s. 787–800.pl_PL
dc.referencesBasu S. (2012), Tabu search implementation on traveling salesman problem and its variations: A literature survey, „American Journal of Operations Research”, Vol. 2, s. 163–173.pl_PL
dc.referencesBeasley J.-E. (1983), Route-first cluster-second methods for vehicle routing, „OMEGA International Journal of Management Science”, Vol. 11, s. 403–408.pl_PL
dc.referencesBeasley J.-E., Tan C.C.R. (1984), A heuristic algorithm for the period vehicle routing problem, „OMEGA International Journal of Management Science”, Vol. 12, s. 497–504.pl_PL
dc.referencesBell J.E., McMullen P.R. (2004), Ant colony optimization techniques for the vehicle routing problem, „Advanced Engineering Informatics”, Vol. 18, s. 41–48.pl_PL
dc.referencesBeltrami E.L., Bodin L.D. (1974), Networks and vehicle routing for municipal waste pollution, „Networks”, Vol. 4, s. 65–94.pl_PL
dc.referencesBerbeglia G., Cordeau J.-F., Gribkovskaia I., Laporte G. (2007), Static pickup and delivery problems: A classification scheme and survey, „Top”, Vol. 15, s. 1–31.pl_PL
dc.referencesBertsimas D.J. (1992), A vehicle routing problem with stochastic demand, „Operation Research”, Vol. 40, s. 574–585.pl_PL
dc.referencesBlaik P. (2001), Logistyka, Polskie Wydawnictwo Ekonomiczne, Warszawa.pl_PL
dc.referencesBłażewicz J. (1986), Problemy optymalizacji kombinatorycznej – złożoność obliczeniowa, algorytmy aproksymacyjne, Polskie Wydawnictwo Ekonomiczne, Warszawa.pl_PL
dc.referencesBoryczka U. (2006), Algorytmy optymalizacji mrowiskowej, Wydawnictwo Uniwersytetu Śląskiego, Katowice.pl_PL
dc.referencesBozarth C., Handfield R.B. (2007), Wprowadzenie do zarządzania operacjami i łańcuchami dostaw, Wydawnictwo Helion, Gliwice.pl_PL
dc.referencesBramel J., Simchi-Levi D. (1995), A location based heuristic for general routing problems, „Operation Research”, Vol. 43, No. 4, s. 649–660.pl_PL
dc.referencesBranchini R.M., Armentano V.A., Loekketangen A. (2009), Adaptive granular local search heuristic for a dynamic vehicle routing problem, „Computers & Operations Research”, Vol. 36, s. 2955–2968.pl_PL
dc.referencesBullnheimer B., Hartl R.F., Strauss C. (1997), Applying the ANT system to the vehicle routing problem, [w:] S. Vos, S. Martello, I.H. Osman, C. Roucairol (red.), Meta-heuristics. Advances and trends in local search paradigms for optimization, Kluwer Academic Publishers, Boston, s. 285–296.pl_PL
dc.referencesBullnheimer B., Hartl R.F., Strauss C. (1999a), An improved ant system algorithm for the vehicle routing problem, „Annals of Operations Research”, Vol. 89, s. 319–328.pl_PL
dc.referencesBullnheimer B., Hartl R.F., Strauss C. (1999b), A new rank based version of the ant system – A computational study, „Central European Journal of Operations Research”, Vol. 7, s. 25–38.pl_PL
dc.referencesCałczyński A. (1979), Modele i metody ustalania tras przewozów towarowych, Instytut Handlu Wewnętrznego i Rynku, Warszawa.pl_PL
dc.referencesCałczyński A. (1992), Metody optymalizacji w obsłudze transportowej rynku, Państwowe Wydawnictwo Ekonomiczne, Warszawa.pl_PL
dc.referencesCałczyński A., Kędzierska-Stróż D., Orzechowska D., Śleszynski Z. (2000), Elementy badań operacyjnych w zarządzaniu, Wydawnictwo Politechniki Radomskiej, Radom.pl_PL
dc.referencesCarpaneto G., Toth P. (1980), Some new branching and bounding criteria for the asymmetric travelling salesman problem, „Management Science”, Vol. 26, s. 736–743.pl_PL
dc.referencesChatterjee S., Carrera C., Lynch L.A. (1996), Genetic algorithms and traveling salesman problems, „European Journal of Operational Research”, Vol. 93, s. 490–510.pl_PL
dc.referencesChen S., Golden B., Wasil E. (2007), The split delivery vehicle routing problem: Applications algorithms, test problems and computational results, „Networks”, Vol. 49, s. 318–329.pl_PL
dc.referencesChristiansen Ch.H., Lysgaard J. (2007), A branch and price algorithm for the capacitated vehicle routing problem with stochastic demands, „Operations Research Letters”, Vol. 35, s. 773–781.pl_PL
dc.referencesChristofides N. (1976), Worst case analysis of a new heuristic for the travelling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie Mellon University.pl_PL
dc.referencesChristofides N., Beasley J.-E. (1984), The period routing problem, „Networks”, Vol. 14, s. 237–256.pl_PL
dc.referencesChristofides N., Eilon S. (1972), Algorithms for large scale traveling salesman problems, „Operations Research Quarterly”, Vol. 23, s. 511–518.pl_PL
dc.referencesChristofi N., Mingozzi A., Toth P. (1979), The vehicle routing problem, [w:] N. Christofi A. Mingozzi, P. Toth, C. Sandi (red.), Combinatorial optimization, Wiley, Chichester, s. 431–448.pl_PL
dc.referencesChristofides N., Mingozzi A., Toth P. (1981), Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations, „Mathematical Programming”, Vol. 20, s. 255–282.pl_PL
dc.referencesChristopher M. (2000), Logistyka i zarządzanie łańcuchem dostaw, Polskie Centrum Doradztwa Logistycznego, Warszawa.pl_PL
dc.referencesClark G., Wright J.W. (1964), Scheduling of vehicles from a central depot to a number of delivery points, „Operations Research”, Vol. 12, s. 568–581.pl_PL
dc.referencesColorni A., Dorigo M., Maniezzo V. (1991), Distributed optimization by ant colonies, [w:] F.J. Varela, P. Bourgine (red.), Proceedings of European Conference Artificial Life (ECAL ’91), Elsevier Publishing, s. 134–142.pl_PL
dc.referencesColorni A., Dorigo M., Maniezzo V., Trubian M. (1994), Ant system for job-shop scheduling, „JORBEL Belgian Journal of Operations Research. Statistics and Computer Science”, Vol. 34, s. 39–53.pl_PL
dc.referencesContardo C., Martinelli R. (2014), A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, „Discrete Optimization”, Vol. 12, s. 129–146.pl_PL
dc.referencesCoyle J.J., Bardi E.J., Langley Jr. C.J. (2002), Zarządzanie logistyczne, Polskie Wydawnictwo Ekonomiczne, Warszawa.pl_PL
dc.referencesCrevier B., Cordeau J.-F., Laporte G. (2007), The multi-depot vehicle routing problem with inter-depot routes, „European Journal of Operational Research”, Vol. 176, s. 756–773.pl_PL
dc.referencesCytowski J. (1996), Algorytmy genetyczne. Podstawy i zastosowania, Akademicka Oficyna Wydawnicza PLJ, Warszawa.pl_PL
dc.referencesDantzig G.B., Fulkerson D.R., Johnson S.M. (1954), Solution of a large-scale traveling salesman problem, „Operations Research”, Vol. 2, s. 393–410.pl_PL
dc.referencesDantzig G.B., Ramser J.H. (1959), Truck dispatching problem, „Management Science”, Vol. 6, s. 80–91.pl_PL
dc.referencesDesaulniers G., Desrosiers J., Erdmann A., Solomon M.M., Soumis F. (2002), VRP with pickup and delivery, [w:] P. Toth, D. Vigo (red.), The vehicle routing problem, Society for Industrial and Applied Mathematics, Philadelphia.pl_PL
dc.referencesDesrochers M., Laporte G. (1991), Improvements and extensions of the Miller-Tucker-Zemlin subtour elimination constraints, „Operations Research Letters”, Vol. 10, s. 27–36.pl_PL
dc.referencesDesrochers M., Desrosiers J., Solomon M.M. (1992), A new optimization algorithm for the vehicle routing problem with time windows, „Operations Research”, Vol. 40, s. 342–354.pl_PL
dc.referencesDesrochers M., Lenstra J.K., Savelsbergh M.W.P., Soumis F. (1988), Vehicle routing with time windows: Optimization and approximation, [w:] B.L. Golden, A.A. Assad (red.), Vehicle routing. Method and studies, North-Holland, Amsterdam, s. 65–84.pl_PL
dc.referencesDoerner K., Gronalt M., Hartl R.F., Reimann M., Strauss Ch., Stummer M. (2002), Savings ants for the vehicle routing problem, [w:] S. Cagnosni (red.), EvoWorkshops02, Springer-Verlag, Berlin, s. 11–20.pl_PL
dc.referencesDorigo M., Gambardella L.M. (1997), Ant colony system: A cooperative learning approach to the traveling salesman problem, „IEEE Transactions on Evolutionary Computation”, Vol. 1, s. 53–66.pl_PL
dc.referencesDorigo M., Maniezzo V., Colorni A. (1996), Theantsystem: Optimization byacolony of cooperating agents, „IEEE Transactions on Systems, Man and Cybernetics”, Part B 26, s. 1–13.pl_PL
dc.referencesDror M., Laporte G., Trudeau P. (1994), Vehicle routing with split deliveries, „Discrete Applied Mathematics”, Vol. 50, s. 239–254.pl_PL
dc.referencesDumas Y., Desrosiers J., Soumis F. (1991), The pickup and delivery problem with time windows, „European Journal of Operational Research”, Vol. 54, s. 7–22.pl_PL
dc.referencesDuncan T. (1995), Experiments in the use of neighborhood search techniques for vehicle routing, Report AIAI-TR-176, University of Edinburgh, Edinburgh.pl_PL
dc.referencesEdmonds J., Johnson E.L. (1973), Matching, Euler tours and the Chinese postman, „Mathematical Programming”, Vol. 5, s. 88–124.pl_PL
dc.referencesFechner I. (2007), Zarządzanie łańcuchem dostaw, Wyższa Szkoła Logistyki, Poznań.pl_PL
dc.referencesFeillet D., Dejax P., Gendreau M. (2005), Traveling salesman problem with profits, „Transportation Science”, Vol. 39, s. 188–205.pl_PL
dc.referencesFertsch M. (red.) (2006), Słownik terminologii logistycznej, Instytut Logistyki i Magazynowania, Poznań.pl_PL
dc.referencesFiechter C.-N. (1994), A parallel tabu search algorithm for large traveling salesman problems, „Discrete Applied Mathematics”, Vol. 51, s. 243–267.pl_PL
dc.referencesFinkelsztejn J.J., Korbut A.A. (1974), Programowanie dyskretne, Państwowe Wydawnictwo Naukowe, Warszawa.pl_PL
dc.referencesFisher M., Jaikumar R. (1981), A generalized assignment heuristic for the vehicle routing, „Networks”, Vol. 11, s. 109–124.pl_PL
dc.referencesFord L.R., Fulkerson D.R. (1962), Flows in networks, Princeton University Press, Princeton–New York.pl_PL
dc.referencesFrancis P.M., Smilowitz K.R. (2006), Modeling techniques for periodic vehicle routing problems, „Transportation Research”, Part B 40, s. 872–884.pl_PL
dc.referencesFrancis P.M., Smilowitz K.R., Tzur M. (2006), The period vehicle routing problems, „Transportation Science”, Vol. 40, s. 439–454.pl_PL
dc.referencesGauvin Ch., Desaulniers G., Gendreau M. (2014), A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands, „Computers & Operations Research”, Vol. 50, s. 141–153.pl_PL
dc.referencesGeiger M.J. (2001), Genetic algorithms for multiple objective vehicle routing, Metaheuristic International Conference 2001 (MIC 2001), s. 348–353.pl_PL
dc.referencesGendreau M., Hertz A., Laporte G. (1992), New insertion and postoptimization procedures for the travelling salesman problem, „Operations Research”, Vol. 40, s. 1086–1094.pl_PL
dc.referencesGendreau M., Hertz A., Laporte G. (1994), A tabu search heuristic for the vehicle routing problem, „Management Science”, Vol. 40, s. 1276–1290.pl_PL
dc.referencesGendreau M., Laporte G., Seguin R. (1996), Stochastic vehicle routing, „European Journal of Operational Research”, Vol. 88, s. 3–12.pl_PL
dc.referencesGendreau M., Laporte G., Musaraganyi Ch., Taillard E.D. (1999), A tabu search heuristic for the heterogeneous fleet vehicle routing problem, „Computers & Operations Research”, Vol. 26, s. 1153–1173.pl_PL
dc.referencesGillett B.E., Miller L.R. (1974), A heuristic algorithm for the vehicle dispatch problem, „Operations Research”, Vol. 22, s. 340–349.pl_PL
dc.referencesGlover F. (1989), Tabu search – part I, „ORSA Journal on Computing”, Vol. 1, s. 190–206.pl_PL
dc.referencesGoldberg D.E. (2003), Algorytmy genetyczne i ich zastosowania, Wydawnictwa Naukowo-Techniczne, Warszawa.pl_PL
dc.referencesGolden B.L., Magnanti T.L., Nguyen H.Q. (1997), Implementing vehicle routing algorithms, „Networks”, Vol. 7, s. 113–148.pl_PL
dc.referencesGrefenstette J. (1987), Incorporating problem specific knowledge into genetic algorithms, [w:] L. Davis (red.), Genetic algorithms and simulated annealing, Morgan Kaufmann, San Francisco, s. 42–60.pl_PL
dc.referencesGrefenstette J., Gopal R., Rosmaita B., Van Gucht D. (1985), Genetic algorithms for the traveling salesman problem, Proceedings of the First International Conference on Genetic Algorithms and Their Applications, New Jersey, s. 160–165.pl_PL
dc.referencesGulczynski D., Golden B., Wasil E. (2011), The period vehicle routing problem with service choice, „Transportation Research”, Part E 47, s. 648–668.pl_PL
dc.referencesHanghaui A., Jung S. (2005), A dynamic vehicle routing problem with dependent travel times, „Computers & Operations Research”, Vol. 32, s. 2959–2986.pl_PL
dc.referencesHarmanani H., Azar D., Helal N., Keirouz W. (2011), A simulated annealing algorithm for the capacitated vehicle routing problem, 26th International Conference on Computers and Their Applications (CATA 2011), New Orleans, USA.pl_PL
dc.referencesHeld M., Karp R.M. (1971), The travelling salesman problem and minimum spanning trees: Part II, „Mathematical Programming”, Vol. 1, s. 6–25.pl_PL
dc.referencesHelsgaun K. (2000), An effective implementation of the Lin-Kernighan traveling salesman heuristic, „European Journal of Operational Research”, Vol. 126, s. 106–130.pl_PL
dc.referencesHelsgaun K. (2009), General k-opt submoves for the Lin-Kernighan TSP heuristic, „Mathematical Programming Computation”, Vol. 1, s. 119–163.pl_PL
dc.referencesHjorring C. (1995), The vehicle routing problems and local search metaheuristics, Ph.D., Department of Engineering Science, The University of Auckland, USA.pl_PL
dc.referencesHo W., Ho G.T.S., Ji P., Lau H.C.W. (2008), Ahybridgenetic algorithm formulti-depot vehicle routing problem, „Engineering Applications of Artificial Intelligence”, Vol. 21, s. 548–557.pl_PL
dc.referencesHong S.-Ch., Park Y.-B. (1999), A heuristic for bi-objective vehicle routing with time window constraints, „International Journal of Production Economics”, Vol. 62, s. 249–258.pl_PL
dc.referencesIgnasiak E. (red.) (1996), Badania operacyjne, Polskie Wydawnictwo Ekonomiczne, Warszawa.pl_PL
dc.referencesJacyna M. (2009), Wybrane zagadnienia modelowania systemów transportowych, Oficyna Wydawnicza Politechniki Warszawskiej, Warszawa.pl_PL
dc.referencesJadczak R. (2001), Zastosowanie zadań rozwózkowo-zwózkowych w transporcie mleczarskim, [w:] D. Kopańska-Bródka (red.), Metody i zastosowania badań operacyjnych, Prace Naukowe Akademii Ekonomicznej w Katowicach, Katowice.pl_PL
dc.referencesJadczak R. (2005), Rozwiązywanie zagadnień układania tras pojazdów z wykorzystaniem algorytmów ewolucyjnych, „Badania Operacyjne i Decyzje”, nr 3–4, s. 7–22.pl_PL
dc.referencesJadczak R. (2006), Zastosowanie algorytmów genetycznych w zadaniach CVRP, [w:] J.B. Gajda, R. Jadczak, Badania operacyjne. Przykłady zastosowań, Wydawnictwo Uniwersytetu Łódzkiego, Łódź, s. 89–106.pl_PL
dc.referencesJadczak R. (2010), Heurystyki i metaheurystyki w problemach VRP, Prace Naukowe Uniwersytetu Ekonomicznego we Wrocławiu Nr 108, Wrocław, s. 101–112.pl_PL
dc.referencesJadczak R. (2014), Traveling salesman problem: Approach to optimality, „Entrepreneurship and Human Resources in Management”, Vol. 15, s. 157–169.pl_PL
dc.referencesJadczak R. (2015), Wpływ elementów algorytmu ewolucyjnego na proces poszukiwania rozwiązania optymalnego, [w:] J.B. Gajda, R. Jadczak, Badania operacyjne w praktyce, Wydawnictwo Uniwersytetu Łódzkiego, Łódź, s. 123–134.pl_PL
dc.referencesJaszkiewicz A., Kominek P. (2003), Genetic local search with distance preserving recombination operator for a vehicle routing problem, „European Journal of Operational Research”, Vol. 151, s. 352–364.pl_PL
dc.referencesJozefowiez N., Semet F., Talbi E.-G. (2008), Multi-objective vehicle routing problems, „European Journal of Operational Research”, Vol. 189, s. 293–309.pl_PL
dc.referencesKarp R.M. (1979), A patching algorithm for the nonsymmetric traveling salesman problem, „SIAM Journal on Computing”, Vol. 8, s. 561–573.pl_PL
dc.referencesKhoshbakht M.Y., Sedighpour M. (2011), An optimization algorithm for the capacitated vehicle routing problem based on ant colony system, „Australian Journal of Basic and Applied Sciences”, Vol. 5, s. 2729–2737.pl_PL
dc.referencesKindervater G.A.P., Savelsbergh M.W.P. (1997), Vehicle routing: Handling edge exchanges, [w:] E.H.L. Aarts, J.K. Lenstra (red.), Local search in combinatorial optimization, Wiley, Chichester, s. 337–360.pl_PL
dc.referencesKirkpatrick S., Gelatt C.D., Vecchi M.P. (1983), Optimization by simulated annealing, „Science”, Vol. 220, s. 671–680.pl_PL
dc.referencesKoźlak A. (2010), Ekonomika transportu, Wydawnictwo Uniwersytetu Gdańskiego, Gdańsk.pl_PL
dc.referencesKrawczyk S. (1996), Metody ilościowe w logistyce (przedsiębiorstwa), Wydawnictwo C.H. Beck, Warszawa.pl_PL
dc.referencesKruskal J.B. (1956), On the shortest spanning subtree of a graph and the traveling salesman problem, „Proceedings of the American Mathematical Society”, Vol. 7, s. 48–50.pl_PL
dc.referencesKukuła K. (1996), Badania operacyjne w przykładach i zadaniach, Państwowe Wydawnictwo Naukowe, Warszawa.pl_PL
dc.referencesLaporte G., Louveaux F.V. (1998), Solving stochastic routing problems with the integer L-shaped method, [w:] T.G. Crainic, G. Laporte (red.), Fleet management and logistics, Centre for Research on Transportation, s. 159–167.pl_PL
dc.referencesLaporte G., Louveaux F.V., Mercure H. (1992), The vehicle routing problems with stochastic travel times, „Transportation Science”, Vol. 26, s. 161–170.pl_PL
dc.referencesLaporte G., Mercure H., Norbert Y. (1986), An exact algorithm for the asymmetrical capacitated vehicle routing problem, „Networks”, Vol. 16, s. 33–46.pl_PL
dc.referencesLaporte G., Norbert Y., Desrochers M. (1985), Optimal routing under capacity and distance restrictions, „Operations Research”, Vol. 33, s. 1050–1073.pl_PL
dc.referencesLaporte G., Norbert Y., Taillefer S. (1987), A branch-and-bound algorithm for asymmetrical distance-constrained vehicle routing problem, „Mathematical Modelling”, Vol. 9, No. 12, s. 857–868.pl_PL
dc.referencesLarrañaga P., Kuijpers C.M.H., Muraga R.H., Inza I., Dizdarevic S. (1999), Genetic algorithms for the traveling salesman problem: A review of representations and operators, „Artificial Intelligence Review”, Vol. 13, s. 129–170.pl_PL
dc.referencesLarsen A., Madsen O.B.G., Solomon M.M. (2004), The a priori dynamic traveling salesman problem with time windows, „Transportation Science”, Vol. 38, s. 459–472.pl_PL
dc.referencesLee T.-R., Ueng J.-H. (1999), A study of vehicle routing with load balancing, „International Journal of Physical Distribution & Logistics Management”, Vol. 29, s. 646–657.pl_PL
dc.referencesLenstra J.K., Rinnooy Kan A.H.G. (1975), Some simple applications of the traveling salesman problem, „Operations Research Quarterly”, Vol. 26, s. 717–734.pl_PL
dc.referencesLi Ch., Simchi-Levi D. (1990), Worst-case analysis of heuristics for multidepot capacitated vehicle routing problems, „ORSA Journal on Computing”, Vol. 2, No. 1, s. 64–73.pl_PL
dc.referencesLin S. (1965), Computer solutions of the traveling salesman problem, „Bell System Computer Journal”, Vol. 44, s. 2245–2269.pl_PL
dc.referencesLin S., Kernighan B.W. (1973), An effective heuristic algorithm for traveling-salesman problem, „Operations Research”, Vol. 21, No. 1, s. 498–516.pl_PL
dc.referencesLittle J.D.C., Murty K.G., Sweeney D.W., Karel C. (1963), An algorithm for the traveling salesman problem, „Operations Research”, Vol. 11, s. 863–1025.pl_PL
dc.referencesLouis S.J., Yin X., Yuan Z.Y. (1999), Multiple vehicle routing with time windows using genetic algorithms, Proceedings of the Congress of Evolutionary Computation (CEC-99), s. 1804–1808.pl_PL
dc.referencesLund K., Madsen O.B.G., Rygaard J.N. (1996), Vehicle routing problems with varying degrees of dynamism, Technical Report, IMM, The Department of Mathematical Modelling, Technical University of Denmark.pl_PL
dc.referencesŁupicka A. (2006), Sieci logistyczne. Teorie. Modele. Badania, Wydawnictwo Akademii Ekonomicznej w Poznaniu, Poznań.pl_PL
dc.referencesMachado P., Tavares J., Pereira F.B., Costa E. (2002), Vehicle routing problem: Doing it evolutionary way, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002).pl_PL
dc.referencesMak K.-T., Morton A.J. (1993), A modified Lin-Kernighan traveling-salesman heuristic, „Operations Research Letters”, Vol. 13, s. 127–132.pl_PL
dc.referencesMazzeo S., Loiseau I. (2004), An ant colony algorithm for the capacitated vehicle routing, „Electronic Notes in Discrete Mathematics”, Vol. 18, s. 181–186.pl_PL
dc.referencesMendyk E. (2009), Ekonomika transportu, Wyższa Szkoła Logistyki, Poznań.pl_PL
dc.referencesMichalewicz Z. (1999), Algorytmy genetyczne + struktury danych = programy ewolucyjne, Wydawnictwa Naukowo-Techniczne, Warszawa.pl_PL
dc.referencesMiller C.E., Tucker A.W., Zemlin R.A. (1960), Integer programming formulations and traveling salesman problems, „Journal of the Association for Computing Machinery”, Vol. 7, s. 326–329.pl_PL
dc.referencesMiller D.L., Pekny J.F. (1991), Exact solution of large asymmetric traveling salesman problems, „Science”, Vol. 251, s. 754–761.pl_PL
dc.referencesMiszczyńska D., Miszczyński M. (1997), Wybrane metody badań operacyjnych, Wyższa Szkoła Ekonomiczno-Humanistyczna w Skierniewicach, Skierniewice.pl_PL
dc.referencesMole R.H., Jameson S.R. (1976), A sequential route building algorithm employing a generalized savings criterion, „Operational Research Quarterly”, Vol. 27, s. 503–511.pl_PL
dc.referencesMontoya-Torres J.R., Franco J.L., Isaza S.N., Jiménez H.F., Padilla N.H. (2015), A literature review on the vehicle routing problem with multiple depots, „Computers & Industrial Engineering”, Vol. 79, s. 115–129.pl_PL
dc.referencesMourgaya M., Nauderbeck F. (2006), Column generation based heuristic for tactical planning in multi-period vehicle routing, „European Journal of Operational Research”, Vol. 183, s. 1028–1041.pl_PL
dc.referencesNorbert Y., Picard J.-C. (1996), An optimal algorithm for mixed Chinese postman problem, „Networks”, Vol. 27, s. 95–108.pl_PL
dc.referencesOr I. (1976), Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking, Northwestern University, Evanston.pl_PL
dc.referencesOsman I.H. (1993), Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, „Annals of Operations Research”, Vol. 41, s. 421–451.pl_PL
dc.referencesPaessens H. (1988), The savings for the vehicle routing problem, „European Journal of Operational Research”, Vol. 34, s. 336–344.pl_PL
dc.referencesPapamiditriou C.H. (2002), Złożoność obliczeniowa, Wydawnictwa Naukowo-Techniczne, Warszawa.pl_PL
dc.referencesPillac V., Gendreau M., Gueret Ch., Medaglia A.L. (2013), A review of dynamic vehicle routing problems, „European Journal of Operational Research”, Vol. 225, s. 1–11.pl_PL
dc.referencesPotvin J.-Y. (1996), Genetic algorithms for the traveling salesman problem, „Annals of Operations Research”, Vol. 63, s. 339–370.pl_PL
dc.referencesPrins Ch. (2004), A simple and effective evolutionary algorithm for the vehicle routing problem, „Computers & Operations Research”, Vol. 31, s. 1985–2002.pl_PL
dc.referencesPsafartis H.N. (1995), Dynamic vehicle routing: Status and prospects, „Annals of Operations Research”, Vol. 61, s. 143–164.pl_PL
dc.referencesRadzikowski W. (1997), Badania operacyjne w zarządzaniu przedsiębiorstwem, Toruńska Szkoła Zarządzania, Toruń.pl_PL
dc.referencesRenaud J., Boctor F.F., Laporte G. (1996), An improved petal heuristic for the vehicle routing problem, „Journal of Operational Research Society”, Vol. 47, s. 329–336.pl_PL
dc.referencesRibeiro R., Lourenço H.R. (2001), A multi-objective model for a multi-period distribution management problem, Proceedings of the First International Conference on Integrated Logistics, Singapore, s. 463–471.pl_PL
dc.referencesRiera-Ledesman J., Salazar-Gonzales J.J. (2005), The biobjective traveling purchaser problem, „European Journal of Operational Research”, Vol. 160, s. 599–613.pl_PL
dc.referencesRosenkrantz D.J., Stearns R.E., Lewis P.M. (1977), An analysis of several heuristics for the traveling salesman problem, „SIAM Journal on Computing”, Vol. 6, s. 563–581.pl_PL
dc.referencesRoss K.A., Wright C.R.B. (1996), Matematyka dyskretna, Państwowe Wydawnictwo Naukowe, Warszawa.pl_PL
dc.referencesRutkowski K. (red.) (2005), Logistyka dystrybucji. Specyfika. Tendencje rozwojowe. Dobre praktyki, Szkoła Główna Handlowa, Warszawa.pl_PL
dc.referencesRyan D.M., Hjorring C., Glover F. (1993), Extensions of the petal method for vehicle routing, „Journal of Operational Research Society”, Vol. 44, s. 289–296.pl_PL
dc.referencesRydzkowski W., Wojewódzka-Król K. (red.) (2009), Transport. Problemy transportu w rozszerzonej UE, Wydawnictwo Naukowe PWN, Warszawa.pl_PL
dc.referencesSavelsbergh M.W.P. (1985), Local search in routing problems with time windows, „Annals of Operations Research”, Vol. 4, s. 285–305.pl_PL
dc.referencesSavelsbergh M.W.P., Sol M. (1995), The general pickup and delivery problem, „Transportation Science”, Vol. 29, s. 17–29.pl_PL
dc.referencesSolich R. (1974), Pewne uogólnienia zadania komiwojażera, Prace Centrum Obliczeniowego PAN, Nr 141.pl_PL
dc.referencesStajniak M., Foltyński M., Hajdul M., Krupa A. (2008), Transport i spedycja, Instytut Logistyki i Magazynowania, Poznań.pl_PL
dc.referencesStützle T., Holger H.H. (2000), MAX-MIN ant system, „Future Generation Computer Systems”, Vol. 16, s. 889–914.pl_PL
dc.referencesSurekha P., Sumathi S. (2011), Solution to multi-depot vehicle routing problem using genetic algorithm, „World Applied Programming”, Vol. 1, No. 3, s. 118–131.pl_PL
dc.referencesSysło M.M. (1984), Optymalizacja kombinatoryczna, [w:] T. Kasprzak (red.), Optymalizacjadyskretna. Zastosowaniaekonomiczne, Państwowe Wydawnictwo Ekonomiczne, Warszawa.pl_PL
dc.referencesSysło M.M., Deo N., Kowalik J.S. (1995), Algorytmy optymalizacji dyskretnej, Wydawnictwo Naukowe PWN, Warszawa.pl_PL
dc.referencesSzałek B.Z. (1992), Logistyka: wstęp do problematyki, Wydawnictwo Naukowe Uniwersytetu Szczecińskiego, Szczecin.pl_PL
dc.referencesTaillard E.D. (1993), Parallel iterative search methods for vehicle routing problems, „Networks”, Vol. 23, s. 661–673.pl_PL
dc.referencesTarkowski J., Irestahl B., Lumsden K. (1995), Transport – logistyka. Towary, informacja, środki, Instytut Logistyki i Magazynowania, Poznań.pl_PL
dc.referencesTas D., Dellaert N., Woensel van T., Kok de T. (2013), Vehicle routing problem with stochastic travel times including soft time windows and service costs, „Computers & Operations Research”, Vol. 40, s. 214–224.pl_PL
dc.referencesTas D., Gendreau M., Dellaert N., Woensel van T., Kok de T. (2014), Vehicle routing with soft time windows and stochastic travel times: A column generation and branch and price solution approach, „European Journal of Operational Research”, Vol. 236, s. 789–799.pl_PL
dc.referencesThompson P.M., Psaraftis H.N. (1993), Cyclic transfer algorithms for multivehicle routing and scheduling problems, „Operations Research”, Vol. 41, s. 935–946.pl_PL
dc.referencesToth P., Vigo D. (2003), The granular tabu search and its application to the vehicle-routing problem, „INFORMS Journal on Computing”, Vol. 15, s. 333–346.pl_PL
dc.referencesTrojanowski K. (2005), Metaheurystyki praktycznie, Wydawnictwo Wyższej Szkoły Informatyki Stosowanej i Zarządzania, Warszawa.pl_PL
dc.referencesTrzaskalik T. (2003), Wprowadzenie do badań operacyjnych z komputerem, Polskie Wydawnictwo Ekonomiczne, Warszawa.pl_PL
dc.referencesVan Breedam A. (1994), An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related. Customer-related, and time-related constraints, praca doktorska, Uniwersytet w Antwerpii.pl_PL
dc.referencesVan Breedam A. (1995), Improvement heuristics for the vehicle routing problem based on simulated annealing, „European Journal of Operational Research”, Vol. 86, s. 480–490.pl_PL
dc.referencesVan Breedam A. (2001), Comparing descent heuristics and metaheuristics for the vehicle routing problem, „Computers & Operations Research”, Vol. 28, s. 289–315.pl_PL
dc.referencesWagner H. (1980), Badania operacyjne, Państwowe Wydawnictwo Ekonomiczne, Warszawa.pl_PL
dc.referencesWang J., Zhou Y., Wang Y., Zhang J., Chen C.L.P., Zheng Z. (2015), Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: Formulation, instances and algorithms, „IEEE Transactions on Cybernetics”, Vol. 46, No. 3, s. 582–594.pl_PL
dc.referencesWang Z., Geng X., Shao Z. (2009), An effective simulated annealing algorithm for solving the traveling salesman problem, „Journal of Computational and Theoretical Nanoscience”, Vol. 6, s. 1680–1686.pl_PL
dc.referencesWhitley D., Starkweather T., Fuquay D. (1989), Scheduling problems and traveling salesmen: The genetic edge recombination operator, Proceedings 3rd International Conference on Genetic Algorithms (ICGA ’89), George Mason University, Fairfax, s. 133–140.pl_PL
dc.referencesWhitley D., Starkweather T., Shaner D. (1991), The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination, [w:] L. Davis (red.), Handbook of genetic algorithms, Van Nostrand Reinhold, New York, s. 350–372.pl_PL
dc.referencesWierzchoń S.T. (2001), Sztuczne systemy immunologiczne. Teoria i zastosowania, Akademicka Oficyna Wydawnicza EXIT, Warszawa.pl_PL
dc.referencesXu J., Kelly J.P. (1998), A network flow-based tabu search heuristic for the vehicle routing problem, „Transportation Science”, Vol. 30, s. 379–393.pl_PL
dc.referencesYu B., Yang Z.-Z., Yao B. (2009), An improved ant colony optimization for vehicle routing problem, „European Journal of Operational Research”, Vol. 196, s. 171–176.pl_PL
dc.referencesZhang X., Wang J. (2012), Hybrid ant algorithm and applications for vehicle routing problem, 2012 International Conference on Solid State Devices and Materials Science, Physics Procedia 25, s. 1892–1899.pl_PL
dc.identifier.doi10.18778/8142-140-9


Files in this item

Thumbnail
Name:
license_rdf
Size:
805bytes
Format:
application/rdf+xml
View/Open
Thumbnail
Name:
Jadczak_Ukladanie tras--oa.pdf
Size:
7.968Mb
Format:
PDF
View/Open
Thumbnail
Name:
OKŁADKA_krzywe_DRUK.jpg
Size:
234.3Kb
Format:
JPEG image
View/Open

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Międzynarodowe
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 Międzynarodowe