Wyniki wyszukiwania - BazTech

1

Identifying the potential of unmanned aerial vehicle routing for emergency blood distribution

Dewmini Janani, Fernando W. Madushan, Nielsen Izabela Iwa, Bocewicz Grzegorz, Thibbotuwawa Amila, Banaszak Zbigniew

Applied Computer Science

|

2023

|

Vol. 19, no 4

68--87

EN

This study is focusing on identifying the potential of Unmanned Aerial Vehicle (UAV) routing for blood distribution in emergency requests in Sri Lanka compared to existing transportation modes. Capacitated Unmanned Aerial Vehicle Routing Problem was used as the methodology to find the optimal distribution plan between blood banks directing emergency requests. The developed UAV routing model was tested for different instances to compare the results. Finally, the proposed distribution process via UAVs was compared with the current distribution process for the objective function set up in the model and other Key Performance Indicators (KPIs) including energy consumption savings and operational cost savings. The average percentage reduction in distribution time, reduction in energy consumption costs and reduction in operating costs per day using UAVs was 58.57%, 96.35% and 61.20% respectively for the instances tested using the model, highlighting the potential of UAVs. Therefore, the deficiencies in Sri Lanka's present blood delivery system can be addressed using UAVs' potential for time, cost, and energy savings. The ability to save time through the deployment of UAVs to the fleet during emergency situations plays a crucial role in preventing the loss of human lives.

2

Model doboru pojazdów do zadań w transporcie drogowym z wykorzystaniem aplikacji log-hub i solver

Jóźwiak Arkadiusz, Malczewska Ewa, Jachimowski Roland

Systemy Logistyczne Wojsk

|

2021

|

Vol. 55, no. 2

193--212

PL

Na podstawie dostępnej literatury, charakterystyki zadań transportowych realizowanych w sieciach transportowych i podziale środków transportowych ze względu na realizowane zadania został opracowany model doboru pojazdów do zadań w transporcie drogowym z wykorzystaniem aplikacji log-hub i solver bazując na arkuszu kalkulacyjnym Excel. Model składa się z kilku elementów: arkusza do obliczania odległości i czasu przejazdu na podstawie kodów pocztowych lub nazw miejscowości, bazy dostępnych pojazdów, które mogą mieć 10 różnych ładowności, 3 sieci dla których można dobrać pojazdy ze względu na minimalizacje kosztów oraz arkusza wspomagającego podejmowanie decyzji dotyczących doboru pojazdów do zadań. Model uwzględnia różnice w czasie jazdy różnymi pojazdami na tej samej trasie (czas jazdy dla samochodu osobowego i ciągnika siodłowego) oraz różny czas rozładunku dla pojazdów o różnej ładowności. Przedmiotem analizy jest przewóz paletowych jednostek ładunkowych, niewymagających zapewnienia specjalnych warunków przejazdu. Model opiera się na pojazdach o nadwoziu uniwersalnym. Analizie podlegały 3 sieci. Z analizy wynika, że sieć 1 jest czysto teoretyczną siecią z perspektywy przewoźnika i transportu ładunków. Koszty w niej są o połowę niższe niż w przypadku sieci 2. Sieć 3 służy do dobrania pojazdów dla kilku lokalizacji, przy założeniu, że wszystkie wyruszają z tej samej miejscowości. Na podstawie opracowanego i zweryfikowanego modelu wywnioskowano, iż podczas analizy kosztów powinno się brać pod uwagę realny, a nie abstrakcyjny układ sieci (zazwyczaj pojazdy muszą dojechać do miejsca załadunku i po wykonaniu zadania dojechać z miejsca rozładunku do innego punktu, co generuje koszty i wpływa na wydłużenie czasu przejazdu). Należy unikać zadań, które odbywają się na krótkich odcinkach i wymagają długich dojazdów (generuje to największe koszty). Pojazdy o mniejszej ładowności szybciej realizują zadania, dlatego sprawdzą się bardziej do transportu ładunków, które wymagają minimalizacji czasu przejazdu lub dużej dynamiki dostaw.

EN

Based on the available literature, the characteristics of transport tasks carried out in transport networks and the division of means of transport due to the tasks performed, a model of vehicle selection for road transport tasks was developed using the log-hub and solver applications based on the Excel spreadsheet. The model consists of several elements: a sheet for calculating the distance and travel time based on postal codes or city names, a database of available vehicles that may have 10 different load capacities, 3 networks for which vehicles can be selected due to cost minimization, and a sheet supporting the taking decisions regarding the selection of vehicles for the tasks. The model takes into account the differences in driving times for different vehicles on the same route (driving time for a passenger car and a tractor unit) and different unloading times for vehicles with different load capacities. The subject of the analysis is the transport of pallet loading units that do not require special transport conditions. The model is based on vehicles with a universal body. 3 networks were analyzed. The analysis shows that network 1 is a purely theoretical network from the perspective of the carrier and freight transport. It costs half that of network 2. Network 3 is used to select vehicles for several locations, assuming that they all depart from the same town. On the basis of the developed and verified model, it was concluded that during the cost analysis one should take into account the real, not abstract network layout (usually vehicles must reach the place of loading and after completing the task, go from the place of unloading to another point, which generates costs and travel time extension). You should avoid tasks that take place over short distances and require long journeys (this is the most costly). Vehicles with a lower load capacity perform tasks faster, therefore they are more suitable for the transport of loads that require minimization of travel time or high dynamics of deliveries.

3

A logistic optimization for the vehicle routing problem through a case study in the food industry

Akpinar Muhammet Enes

LogForum

|

2021

|

Vol. 17, no. 3

387--397

EN

Background: In this study, the food delivery problem faced by a food company is discussed. There are seven different regions where the company serves food and a certain number of customers in each region. The time of requesting food for each customer varies according to the shift situation. This type of problem is referred to as a vehicle routing problem with time windows in the literature and the main aim of the study is to minimize the total travel distance of the vehicles. The second aim is to determine which vehicle will follow which route in the region by using the least amount of vehicle according to the desired mealtime. Methods: In this study, genetic algorithm methodology is used for the solution of the problem. Metaheuristic algorithms are used for problems that contain multiple combinations and cannot be solved in a reasonable time. Thus in this study, a solution to this problem in a reasonable time is obtained by using the genetic algorithm method. The advantage of this method is to find the most appropriate solution by trying possible solutions with a certain number of populations. Results: Different population sizes are considered in the study. 1000 iterations are made for each population. According to the genetic algorithm results, the best result is obtained in the lowest population size. The total distance has been shortened by about 14% with this method. Besides, the number of vehicles in each region and which vehicle will serve to whom has also been determined. This study, which is a real-life application, has provided serious profitability to the food company even from this region alone. Besides, there have been improvements at different rates in each of the seven regions. Customers' ability to receive service at any time has maximized customer satisfaction and increased the ability to work in the long term. Conclusions: The method and results used in the study were positive for the food company. However, the metaheuristic algorithm used in this study does not guarantee an optimal result. Therefore, mathematical models or simulation models can be considered in terms of future studies. Besides, in addition to the time windows problem, the pickup problem can also be taken into account and different solution proposals can be developed.

4

Modeling a cost benefit transportation model to optimize the redistribution process: Evidence study from Sri Lanka

Jayarathna D. G. Nuwan Dhammika, Lanel G. H. J., Juman Z. A. M. S.

Journal of Sustainable Development of Transport and Logistics

|

2021

|

Vol. 6, No. 2

43--59

EN

This study is a case study based on Softlogic Retail (Pvt) Ltd, Sri Lanka, which is a famous consumer electronics company and market leader in Sri Lanka. This company’s outbound logistics have been considered in this research, and they are mainly forced into the redistribution process in Sri Lanka. Extra routing costs due to unreasonable consumption of additional distance have been noticed in the current redistribution process. Here, this problem is modeled as a variant of the vehicle routing problem with a heterogeneous vehicle fleet. Our objective is to minimize warehouse operation, administration, and transportation costs by imposing constraints on capacity and volume. The researchers propose new heuristic solutions to the problem. A proposed heuristic algorithm has been used to find the optimal path between clusters. The computational investigation highlights the cost savings that can be accrued by this new heuristic. The cost savings can be accrued at a rate of as much as 37.5 % compared to the company’s existing method.

5

Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study

Le Thi Diem Chau, Nguyen Duy Duc, Oláh Judit, Pakurár Miklós

Production Engineering Archives

|

2020

|

Vol. 26, Iss. 4

174--184

EN

This study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, our study also evaluates both the quality of solutions and the time to find optimal solutions to select the best suitable algorithm for the real problem mentioned above. A novel mathematical model is formulated by OR tools for Python. Compared to the current solution, our results reduced total costs by 18%, increased the proportion of orders completed by internal vehicles (84%), and the proportion of orders delivered on time (100%). Our study provides a mathematical model with time constraints and large job volumes for a complex distribution network in reality. The proposed mathematical model provides effective solutions for making decisions at logistics companies. Furthermore, our study emphasizes that simulated annealing is a more suitable algorithm than the two others for this vehicle routing problem.

6

Improving unloading time prediction for vehicle routing problem based on GPS data

Žunić Emir, Kuric Amar, Delalić Sead

Annals of Computer Science and Information Systems

|

2020

|

Vol. 22

45--49

EN

The problem of transport optimization is of great importance for the successful operation of distribution companies. To successfully find routes, it is necessary to provide accurate input data on orders, customer location, vehicle fleet, depots, and delivery restrictions. Most of the input data can be provided through the order creation process or the use of various online services. One of the most important inputs is an estimate of the unloading time of the goods for each customer. The number of customers that the vehicle serves during the day directly depends on the time of unloading. This estimate depends on the number of items, weight and volume of orders, but also on the specifics of customers, such as the proximity of parking or crowds at the unloading location. Customers repeat over time, and unloading time can be calculated from GPS data history. The paper describes the innovative application of machine learning techniques and delivery history obtained through a GPS vehicle tracking system for a more accurate estimate of unloading time. The application of techniques gave quality results and significantly improved the accuracy of unloading time data by 83.27% compared to previously used methods. The proposed method has been implemented for some of the largest distribution companies in Bosnia and Herzegovina.

7

Cluster-based approach for successful solving real-world vehicle routing problems

Žunić Emir, Đonko Dženana, Šupić Haris, Delalić Sead

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

619--626

EN

Vehicle routing problem as the generalization of the Travelling Salesman Problem (TSP) is one of the most studied optimization problems. Industry itself pays special attention to this problem, since transportation is one of the most crucial segments in supplying goods. This paper presents an innovative cluster-based approach for the successful solving of real-world vehicle routing problems that can involve extremely complex VRP problems with many customers needing to be served. The validation of the entire approach was based on the real data of a distribution company, with transport savings being in a range of 10-20 %. At the same time, the transportation routes are completely feasible, satisfying all the realistic constraints and conditions.

8

The Impact of perturbation mechanisms on the operation of the swap heuristic

Misztal Wojciech

Archiwum Motoryzacji

|

2019

|

Vol. 86, nr 4

27--39

EN

In this study, an attempt was made to assess the impact of the most popular perturbation movements (i.e. Multiple-Swap(2-2), Multiple-Shift(2-2) and Multiple-K-Shift(1)), as well as the number of their calls on the quality of solutions and the time in which Swap(2-1) heuristics returns them. For this purpose, the iterative local search algorithm (ILS) was triggered, in which Swap(2-1) heuristics has cooperated with a single perturbation mechanism. The number of perturbations was changed in the range from 1 to 30. Each time the time and the difference between the percentage improvement of the objective function value of the solution obtained utilizing the Swap(2-1) algorithm cooperating with the perturbation mechanism and this algorithm working alone was checked. Based on the results obtained, it was found that the overall level of improvement in the quality of the returned solution is similar when using all of the considered perturbation mechanisms (is in the range of 2.49% to 4.02%). It has been observed that increasing the number of initiated perturbations does not guarantee an improvement in the quality of the returned solution. Perturbation movements similar to the motion initiated by the local search algorithm do not significantly improve the solution (they only entail extending the duration of action). The structure of the study has the following form. The Introduction chapter provides information on the Vehicle Routing Problem. The chapter Research methods contain a description of ILS and Swap(2-1) approaches and perturbation mechanisms considered. The last two chapters include the results of tests and conclusions.

9

Innovative modular approach based on vehicle routing problem and ant colony optimization for order splitting in real warehouses

Žunić Emir, Delalić Sead, Tucaković Zlatan, Hodžić Kerim, Beširević Admir

Annals of Computer Science and Information Systems

|

2019

|

Vol. 20

125--129

EN

A crucial part to any warehouse workflow is the process of order picking. Orders can significantly vary in the number of items, mass, volume and the total path needed to collect all the items. Some orders can be picked by just one worker, while others are required to be split up and shrunk down, so that they can be assigned to multiple workers. This paper describes the complete process of optimal order splitting. The process consists of evaluating if a given order requires to be split, determining the number of orders it needs to be split into, assigning items for every worker and optimizing the order picking routes. The complete order splitting process can be used both with and without the logistic data (mass and volume), but having logistic data improves the accuracy. Final step of the algorithm is reduction to Vehicle Routing Problem where the total number of vehicles is known beforehand. The process described in this paper is implemented in some of the largest warehouses in Bosnia and Herzegovina.

10

Marszrutyzacja pojazdów dystrybucyjnych: metoda optymalizacji i ocena wpływu zastosowanego sposobu wyznaczania ścieżek w sieci transportowej

Szczepański Emilian

Systemy Logistyczne Wojsk

|

2018

|

Vol. 48, no. 1

300--312

PL

Celem artykułu jest prezentacja metody wyznaczania tras pojazdów dystrybucyjnych i ocena wpływu zastosowanego sposobu wyznaczania ścieżek między węzłami w sieci transportowej.Realizacja celu wymagała sformułowania modelu matematycznego odwzorowującego system dystrybucji ładunków i zadania optymalizacyjnego.Przedstawiono metodę optymalizacyjną opartą o algorytmy genetyczne i modyfikację algorytmu A-star do wyznaczania ścieżek.W artykule porównano wyznaczanie marszrut dla pojazdów dystrybucyjnych z punktu widzenia zastosowanego podejścia do wyznaczania ścieżek.

EN

The aim of the article is to present themethodfordetermining routes of distribution vehicles and to assess the impact of the method used to determine the pathbetween nodes in the transport network. The implementation of the goal required the formulation of a mathematical model of the cargo distribution system and the optimization task. An optimization method based on genetic algorithms as well as modification of A-star forpathfindingwere presented. The articles compare the vehicle routing problem solution from the point of view of the approach used to determine paths.

11

Decision support system in freight transport based on vehicle routing problem with quality criterion

Szczepański E., Jachimowski R., Żak J.

Archives of Transport System Telematics

|

2018

|

Vol. 11, iss. 3

49--56

EN

Deliveries planning in transport systems is a complicated task and require taking into account a wide range of factors. Enterprises wanting to propose solutions that meet the clients’ needs and be competitive on the market must prepare their offer based on decision support systems including factors characteristic for the real process. The aim of the article is to present a concept of a decision support system based on a multi-criteria vehicle routing problem in real conditions (Real-World VRP). Taking into account the latest trends in the optimization of the delivery plan, the model includes three criteria - the cost, time and success rate of the delivery plan as a criterion relating to the quality of the delivery plan. Among other assumptions, it should be pointed out that the heterogeneous structure of the rolling stock has been taken into account, the number of which is not limited, the vehicles return to the place of origin. The travel time of the connection and the time of loading operations are random variables. The limited driver’s work time and driving time were also applied. The effect of the work presented in the article is the concept of the decision support system in the freight transport, taking into account the quality criterion of the delivery plan.

12

Effective Solutions to the Transport Distribution of Material by the Mayer Method

Čejka Jiří, Stopka Ondrej

Advances in Science and Technology. Research Journal

|

2018

|

Vol. 12, no 4

177--183

EN

This paper deals with streamlining the collection (pick-up) and distribution (delivery) activities within the technology of wood industry. Through the optimization process implemented using the issue of the distribution task of linear programming, specifically the Mayer method, the particular solution in order to minimize the total costs in practice of utilized distribution routes is proposed. The first part of the paper presents the characteristics of the vehicle routing problem and describes methods of solving this issue. Subsequently, the main part of the paper outlines a particular case study in the context of the Mayer method application within the field of transport-technology solution of the material distribution.

13

Optimization of the position of the local distribution centre of the regional post logistics network

Droździel P., Wińska A., Madleňák R., Szumski P.

Transport Problems

|

2017

|

T. 12, z. 3

43--50

EN

The phenomenon of the present postal services is the fact that, customers expect the lowest price while maintaining the availability, security and on time delivery of mail items. We can find that, the costs associated with transport of the postal substrate is one of the most important factors affecting the total cost of the postal services. These transport costs depend on various factors such as the investment in vehicles purchase, operational costs of the postal vehicles (costs of maintenance, repairs, fuel costs of the vehicle, etc.) labour costs of the drivers and so on. For this reason, it is important to find such an operational - organizational solutions that can reduce the costs associated with the transportation of postal shipments, resulting in reducing the total cost of postal services. One option to do this is to minimize the length of postal transportation routes. This article presents the approach based on the application of graph theory to optimize existing connections of postal logistics network. Published results is oriented to revaluate existing position of local centre and find a location for the new local distribution centre potentially. New location of local distribution centre can to optimize (minimize) the total transport costs of the local postal transportation network in area of the Lublin Province.

14

Kształtowanie optymalnego systemu miejskiego transportu zbiorowego w miastach średniej wielkości na przykładzie Częstochowy

Banet K., Szarata A.

Transport Miejski i Regionalny

|

2017

|

nr 11

23--30

PL

Planowanie optymalnej siatki połączeń transportu publicznego wpisuje się w problem decyzyjny i optymalizacyjny zwany problemem marszrutyzacji. W artykule skupiono się na sieci transportu zbiorowego w Częstochowie i zaproponowano kilka wariantów modyfikacji jej istniejącego układu. W tym celu przeprowadzono analizy symulacyjne bazujące na modelu stanu istniejącego systemu transportowego Częstochowy. Na potrzeby analiz wzięto pod uwagę łącznie dziewięć kombinacji (wariantów), w ramach których założono trzy możliwości kształtowania układu (dostępności) linii miejskiej komunikacji zbiorowej oraz pięć możliwych układów częstotliwości ich kursowania. W każdym z wariantów przeprowadzono pełny rozkład modelu podróży, a poprzez szereg analiz symulacyjnych obserwowano wpływ zmian częstotliwości i dostępności linii miejskiego transportu zbiorowego na wyniki symulacji. Na podstawie kryteriów wyjściowych (liczba pasażerów, koszty funkcjonowania linii oraz średni czas podróży) dokonano porównania wariantów i wyboru wariantu rekomendowanego. W przypadku miasta średniej wielkości, jakim jest Częstochowa, optymalnym rozwiązaniem okazał się wariant pośredni – tj. zakładający średni stopień częstotliwości kursowania przy niepełnym stopniu zasięgu obsługi liniami miejskiego transportu zbiorowego.

EN

The article focuses on the optimal design problem of urban public transport network in middle-sized cities, presenting results of the sample case study in the Czestochowa city, Poland. Simulation analyses have been conducted on the transportation model of Czestochowa and included 9 possible variants (cases). The variants were formulated based on 2 the following criteria: spatial accessibility of urban public transport network (3 scenarios) and temporal service frequency (5 scenarios). Simulations were conducted for the full 4-step demand model, and allowed us to observe the influence of changes in accessibility and frequency assumptions on network performance. Comparison of variants was made based on 3 performance parameters: total number of passengers, operating service costs and average journey times. Based on these, the optimal variant was selected, which in case of the middle-sized city like Czestochowa turned out to be an intermediate solution in terms of both design criteria. The best results have been obtained for medium rates of service frequency and network accessibility.

15

System for vehicle routing problem algorithms analysis

Sztajerowski W., Ochelska-Mierzejewska J., Kucharski J.

Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska

|

2017

|

T. 7, nr 2

28--31

EN

Paper concerns the software system supporting the analysis of different cases of solving VRP by various algorithms. VRP has been characterised and application structure has been presented. Illustrative experimental results show the usefulness of the system.

PL

Artykuł przedstawia oprogramowanie wspomagające analizę różnych przypadków rozwiązywania planowania dostaw (ang. Vehicle Routing Problem, VRP) przez różne algorytmy. Zaprezentowano w artykule problem VRP oraz strukturę omawianego systemu. Pokazano również wyniki eksperymentów, które pokazują użyteczność systemu.

16

Multi-objective optimization of vehicle routing problem using evolutionary algorithm with memory

Podlaski K., Wiatrowski G.

Computer Science

|

2017

|

Vol. 18 (3)

269--286

EN

The idea of a new evolutionary algorithm with memory aspect included is proposed to find multiobjective optimized solution of vehicle routing problem with time windows. This algorithm uses population of agents that individually search for optimal solutions. The agent memory incorporates the process of learning from the experience of each individual agent as well as from the experience of the population. This algorithm uses crossover operation to define agents evolution. In the paper we choose as a base the Best Cost Route Crossover (BCRC) operator. This operator is well suited for VPRTW problems. However it does not treat both of parent symmetrically what is not natural for general evolutionary processes. The part of the paper is devoted to find an extension of the BCRC operator in order to improve inheritance of chromosomes from both of parents. Thus, the proposed evolutionary algorithm is implemented with use of two crossover operators: BCRC and its extended-modified version. We analyze the results obtained from both versions applied to Solomon’s and Gehring & Homberger instances. We conclude that the proposed method with modified version of BCRC operator gives statistically better results than those obtained using original BCRC. It seems that evolutionary algorithm with memory and modification of Best Cost Route Crossover Operator lead to very promising results when compared to the ones presented in the literature.

17

Vehicle routing problem as urban public transportoptimization tool

Borowska-Stefańska M., Wiśniewski S.

Computer Assisted Methods in Engineering and Science

|

2016

|

Vol. 23, no. 4

213--229

EN

This article presents possibilities of using one of network analysis tools for public transport optimization.The work focuses on presenting the transport system as a research polygon for analysis of its geographicalinformation system (GIS). The article covers both a cognitive and methodological application approach.The first is achieved on a wider scope through discussing research regarding public transport in the GISenvironment and in a narrower focus on the methodology where the vehicle routing problem (VRP) toolis referred to in detail. The city of Łódź, Poland and its system of night bus connections were used asa case study to illustrate how GIS solutions may be used to manage public transport. The simulationusing the VRP tool conducted on a large urban center meets the work’s methodological assumptions andmay present an indication for local transport managers of how the spatial information systems can boosttheir organizational operations.

18

Comparison of pareto efficiency and weighted objectives method to solve the multi-criteria vehicle routing problem using the artificial immune system

Mrówczyńska B.

Applied Computer Science

|

2016

|

Vol. 12, no 4

78--87

EN

The solutions to the multi-criteria vehicle routing problem, dependent on route length and travelling time of delivery van, are presented in the paper. This type of problem is known as a traveling salesman problem. The artificial immune system is used to solve it in this article. Since there are two variables – route length and travelling time – two methods are employed. They are: Weighted Objectives Method and Pareto Efficiency Method. The results of calculation are compared.

19

Solving a problem of establishing a connection between post offices in the area of a city

Grgurovic B, Strbac S., Milutinovic J., Popovic M.

Transport Problems

|

2015

|

T. 10, z. 1

17--22

EN

According to The General Plan of Post Network and in accordance with the criteria for opening branches of postal services for customers numerous postal offices which perform delivery services are located on the territory of every large city area. In case of using the system for combined decentralization one of the offices is assigned the role of the central deliverance post office. If the central office cannot be connected to some other unit directly, their connection is realized through one or more other units which are located in between them. Aside from the idea of the most economical management, the organization of postal offices is limited by some other actors, from the number of available vehicles, their capacity, to the question of the place and time of realizing a transaction. This paper provides information about how the money-saving algorithm for solving the problem of time interval routing can be used in a suitable way in these situations as well.

RU

Согласно Общему плану почтовой сети и в соответствии с критериями для открытия отделений связи, для оказания почтовых услуг клиентам на территории любого города, как правило, располагается несколько почтовых отделений, осуществляющих, в том числе, и операции доставки. В случае применения системы комбинированной децентрализации, одному из них присваивается роль центрального почтового отделения доставки (городского узла доставки). При отсутствии возможности прямого соединения центрального и любого другого пункта, их связь осуществляется через одно или несколько других отделений, находящихся на пути между ними. Наряду с идеей о высокоэффективном и экономичном для хозяйственной деятельности решении, Почту (как организацию) ограничивают и другие факторы, в т.ч. количество имеющихся в распоряжении транспортных средств, их вместимость, а также намеченные сроки выполнения определенных операций. В статье освещается применение в соответствующем порядке и в подобных ситуациях алгоритма экономики для решения вопроса применения транспорта, курсирующего по заранее разработанным маршрутам с указанием промежутков времени при доставке.

20

Multicriteria vehicle routing problem solved by artificial immune system

Mrówczyńska B.

Transport Problems

|

2015

|

T. 10, z. 3

141--152

EN

Vehicles route planning in large transportation companies, where drivers are workers, usually takes place on the basis of experience or intuition of the employees. Because of the cost and environmental protection, it is important to save fuel, thus planning routes in an optimal way. In this article an example of the problem is presented solving delivery vans route planning taking into account the distance and travel time within the constraints of vehicle capacities, restrictions on working time of drivers and having varying degrees of movement. An artificial immune system was used for the calculations.

PL

Planowanie tras samochodów dostawczych w dużych firmach transportowych, w których kierowcy są pracownikami najemnymi, najczęściej odbywa się na podstawie doświadczeń lub intuicji pracowników. Ze względu na koszty i na ochronę środowiska ważne jest oszczędzanie paliwa, a więc układanie tras w sposób optymalny. W artykule rozwiązano przykładowy problem planowania trasy samochodów dostawczych ze względu na długość drogi i czas przejazdu przy ograniczeniach ładowności pojazdów, ograniczeniach czasu pracy kierowców i przy uwzględnieniu zmiennego natężenia ruchu. W obliczeniach zastosowano sztuczny system immunologiczny.