Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "routing" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    Tytuł:
    New version of the BBS method and its usage for determining and scheduling vehicle routes
    Autorzy:
    Wolfenburg, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/224049.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    vehicle routing
    scheduling vehicle routes
    BBS method
    trasa pojazdu
    harmonogramowanie tras pojazdów
    metoda BBS
    Opis:
    The work presents a method of the vehicle routing and scheduling using the modified Branch and Bound Simulation method for vehicles simultaneously carrying loads from multiple orders. Limitations concerning vehicle loads and time windows in pickup and delivery points are taken into consideration. The developed algorithm appoints the shortest, the fastest and the cheapest routes with a certain known accuracy. A modification of the BBS method is described A sample of result using Google API is shown.
    Źródło:
    Archives of Transport; 2014, 31, 3; 83-91
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Benchmarking minimum passenger waiting time in online taxi dispatching with exact offline optimization methods
    Autorzy:
    Maciejewski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/952925.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    online taxi dispatching
    dynamic vehicle routing
    multi-agent simulation
    MATSim
    usługi taxi
    przydział taksówek on-line
    minimalizacja czasu oczekiwania
    symulacja usług
    Opis:
    This paper analyses the use of exact offline optimization methods for benchmarking online taxi dispatching strategies where the objective is to minimize the total passenger waiting time. First, a general framework for simulating dynamic transport services in MATSim (Multi-Agent Transport Simulation) is described. Next, the model of online taxi dispatching is defined, followed by a formulation of the offline problem as a mixed integer programming problem. Three benchmarks based on the offline problem are presented and compared to two simple heuristic strategies and a hypothetical simulation with teleportation of idle taxis. The benchmarks are evaluated and compared using the simulation scenario of taxi services in the city of Mielec. The obtained (approximate) lower and upper bounds for the minimum total passenger waiting time indicate directions for further research.
    Źródło:
    Archives of Transport; 2014, 30, 2; 67-75
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Vehicle routing problem with partly simultane-ous pickup and delivery for the cluster of small and medium enterprises
    Autorzy:
    He, P.
    Li, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/224095.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    transportation service
    pickup
    delivery
    small and medium enterprises
    usługi transportowe
    odbiór
    dostawa
    małe i średnie przedsiębiorstwa
    Opis:
    The transportation service for the cluster of small and medium enterprises (SMEs) is different with traditional vehicle routing problems. In the cluster of SMEs, parts of enterprises are pickup and delivery spots simultaneously, but some enterprises are partly pickup and delivery simultaneously. It is necessary to optimize this transportation service with an effective mathematics and algorithm to reduce transportation costs for manufacturers. However, traditional mathematics models and algorithms are not suitable to solve the vehicle routing problem partly simultaneous pickup and delivery (VRPPSD) because these items mainly focus on the vehicle routing problem with pickup and delivery simultaneously. In this paper, a mathematics operational model is proposed to analyze the transportation service of the cluster companies and to describe transportation processes. A hybrid algorithm which is composed by tabu search, genetic algorithm and local search is used to optimize the operational model. The crossover and mutation contained by genetic algorithm are used to generate neighborhood solutions for tabu search, and the local search is used to improve optimizing solutions. The data of a cluster of SMEs, investigating from Changzhou city, China, are employed to show the validity of our mathematical model and algorithm. The results indicate that our model and hybrid algorithm is effective to solve VRPPSD. In this paper, the satisfied solutions of VRPPSD are found by hybrid algorithm. At the same time, the results also show that carriers with optimal routs can service customers with more profits (increasing 5.6%). The potential saving of transport cost will increase profits of carriers in SMEs. Sensitivity analyses about adjusting service time and rate of new orders are lunched to analyze how these two factors influence the profits of the VRPPSPD in a dynamic case. A bottleneck that influences the profits is found, and there has a shorter service time which could increase gross profits, but not significantly.
    Źródło:
    Archives of Transport; 2018, 45, 1; 35-42
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Research on path optimization for multimodal transportation of hazardous materials under uncertain demand
    Autorzy:
    Han, Wei
    Chai, Huo
    Zhang, Jianpeng
    Li, Yuanping
    Powiązania:
    https://bibliotekanauki.pl/articles/27311810.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    hazardous materials
    multimodal transport
    routing optimization
    fuzzy random numbers
    NSGA-II
    materiały niebezpieczne
    transport multimodalny
    optymalizacja tras
    Opis:
    In the process of long-distance and large-volume transportation of hazardous materials (HAZMAT), multimodal transportation plays a crucial role with its unique advantages. In order to effectively reduce the transportation risk and improve the reliability of transportation, it is particularly important to choose a suitable transportation plan for multimodal transport of HAZMAT. In this paper, we study the transportation of HAZMAT in multimodal transport networks. Considering the fluctuation in demand for HAZMAT during the actual transportation process, it is difficult for decision makers to obtain the accurate demand for HAZMAT orders in advance, leading to uncertainty in the final transportation plan. Therefore, in this paper, the uncertain demand of HAZMAT is set as a triangular fuzzy random number, and a multi-objective mixed integer linear programming model is established with the objective of minimizing the total risk exposure population and the total cost in the transportation process of HAZMAT. In order to facilitate the solution of the model, we combined the fuzzy random expected value method with the fuzzy random chance constraint method based on credibility measures to reconstruct the uncertain model clearly and equivalently, and designed a non-dominated sorting genetic algorithm (NSGA-Ⅱ) to obtain the Pareto boundary of the multi-objective optimization problem. Finally, we conducted a numerical example experiment to verify the rationality of the model proposed in this paper. The experimental results indicate that uncertain demand can affect the path decision-making of multimodal transportation of HAZMAT. In addition, the confidence level of fuzzy random opportunity constraints will have an impact on the risk and economic objectives of optimizing the multimodal transportation path of HAZMAT. When the confidence level is higher than 0.7, it will lead to a significant increase in transportation risks and costs. Through sensitivity analysis, it can provide useful decision-making references for relevant departments to formulate HAZMAT transportation plans.
    Źródło:
    Archives of Transport; 2023, 67, 3; 91--104
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Resource-saving technologies of railway transportation of grain freights for export
    Autorzy:
    Kozachenko, D.
    Vernigora, R.
    Kuznetsov, V.
    Lahvinova, N.
    Rustamov, R.
    Papahov, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/223476.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    rail transportation
    grain export
    efficiency
    consignor routing
    concentration of loading
    cluster analysis
    transport kolejowy
    eksport zboża
    wydajność
    Opis:
    The research objective is to increase the efficiency of export railway transportation of grain freights in Ukraine by the introduction of consignor routing, a concentration of loading of grain on junction elevators and the organization of the movement of grain routes according to the schedule. According to the researchers in USA and EU, one of the effective directions for decreasing the expenses in a logistic chain of grain delivery to ports is consignor routing of railway transportation. Consignor routing of transportations of grain freights provides a concentration of their loading at junctions. The choice of junctions is proposed to be carried out on the basis of methods of the cluster analysis. For formation of regions for a concentration of grain loading the theory of sets and multicriteria optimization are used. As a result, on the basis of the modified simplex method are chosen 24 regions of possible concentration of grain loading that cover 70 stations on Ukrainian railways providing 7,5 million t consignor routing for grain in a year with minimal additional expenses. The assessment of the efficiency of railway transportation routing of grain freights is calculated with use of the developed simulation model. Researches showed that application of consignor routing allows to reduce a turn-round cycle for grain wagon in a logistic chain of deliveries up to 27%, and application of the schedule for consignor routes allows to reduce a turn-round cycle up to 62%, in comparison with transportation by car loading. Thus, as showed the calculations executed for one of the directions of grain transportation for export, the necessary operation park of grain-carrier wagons is reduced twice, thereby allowing to cut logistic expenses on a delivery of the Ukrainian grain through seaports to the world markets.
    Źródło:
    Archives of Transport; 2018, 45, 1; 63-74
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Genetic algorithms based approach for transhipment hub location in urban areas
    Autorzy:
    Szczepański, E.
    Jacyna-Gołda, I.
    Murawski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/224003.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    supply chain optimization
    genetic algorithm
    multi-level distribution system
    facilities location problem
    Vehicle Routing Problem - VRP
    optymalizacja
    łańcuch dostaw
    algorytm genetyczny
    dystrybucja wielopoziomowa
    lokalizacja obiektów
    Opis:
    Points of distribution, sales or service are important elements of the supply chain. These are the final elements which are responsible for proper functioning of the whole cargo distribution process. Proper location of these points in the transport network is essential to ensure the effectiveness and reliability of the supply chain. The location of these points is very important also from the consumers point of view. In this paper developed method of points location was present on the example of urban transport network. The developed approach is based on the Vehicle Routing Problem in the multistage distribution systems. The proposed method uses a genetic algorithm. Article also presents a mathematical model of delivery cost as a criterion function. The article presents an example calculations which illustrating the operation of the developed method.
    Źródło:
    Archives of Transport; 2014, 31, 3; 73-82
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Mathematical modelling and parameters calculations in multimodal freight terminal networks
    Autorzy:
    Palagin, Y.
    Mochalov, A.
    Timonin, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/224339.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    multimodal cargo operators
    transport-terminal networks
    optimal delivery routing
    terminal
    interterminal
    terminal cargo flows
    mathematical modelling
    algorithms
    software
    przewozy towarów
    sieci terminali
    dostawy optymalne
    modelowanie matematyczne
    Opis:
    There are presented the mathematical models, routing algorithms and calculation algorithms for cargo flows in transport-terminal road-air-railways networks of multimodal transport operators.
    Źródło:
    Archives of Transport; 2014, 30, 2; 77-87
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies