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ę "Genetic algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    Tytuł:
    Heuristic algorithms applied to the problems of servicing actors in supply chains
    Autorzy:
    Izdebski, M.
    Jacyna-Gołda, I.
    Markowska, K.
    Murawski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/224087.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    supply chain
    genetic algorithm
    ant algorithm
    łańcuchy dostaw
    algorytm genetyczny
    algorytm mrówkowy
    Opis:
    The paper discusses main decision problems analysed in the subject matter of servicing actors operating in the supply chains, i.e. the vehicle routing problem, vehicles-to-task assignment problem and the problem of entities’ localization in the supply chain. The input data used to describe supply chains is given as well as the basic constraints and the criterion functions used in the development of mathematical models describing the supply chains. Servicing actors in supply chains is the complex decision making problem. Operators in the supply chains are constrained by: production capacity of the suppliers, the demand of the customers in particular working days, storage capacities of warehouses, handling capacities of warehouses, suppliers’ and warehouses’ time windows and other. The efficiency of supply chain is described by cost of transport between operators, costs of passing cargoes through warehouses and delivery time to the recipient. The heuristic algorithms, like genetic and ant algorithms are detailed and used to identify issues related to the operation of actors operating in the supply chains are described. These algorithms are used for solving localization problems in supply chains, vehicle routing problems, and assignment problems. The complexity of presented issues (TSP is known as NP-hard problem) limits the use of precise algorithms and implies the need to use heuristic algorithms. It should be noted that solutions generated by these algorithms for complex decision instances are sub-optimal solutions, but nonetheless it is accepted from the practical point of view.
    Źródło:
    Archives of Transport; 2017, 44, 4; 25-34
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Use of Heuristic Algorithms to Optimize the Transport Issues on the Example of Municipal Services Companies
    Autorzy:
    Izdebski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/223579.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    municipal services companies
    transport
    optimization
    genetic algorithm
    ant algorithm
    usługi komunalne
    optymalizacja
    algorytm genetyczny
    Opis:
    In this article the main optimization problems in the municipal services companies were presented. These problems concern the issue of vehicle routing. The mathematical models of these problems were described. The function of criterion and the conditions on designating the vehicle routing were defined. In this paper the hybrid algorithm solving the presented problems was proposed. The hybrid algorithm consists of two heuristic algorithms: the ant and the genetic algorithm. In this paper the stages of constructing of the hybrid algorithm were presented. A structure of the data processed by the algorithm, a function of adaptation, a selection of chromosomes, a crossover, a mutation and an inversion were characterized. A structure of the data was presented as string of natural numbers. In selection process the roulette method was used and in the crossover process the operator PMX was presented. This algorithm was verified in programming language C #. The process of verification was divided into two stages. In the first stage the best parameters of the hybrid algorithm were designated. In the second stage the algorithm was started with these parameters and the result was compared with the random search algorithm. The random search algorithm generates 2000 routes and the best result is compared with the hybrid algorithm.
    Źródło:
    Archives of Transport; 2014, 29, 1; 27-36
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The concept of genetic programming in organizing internal transport processes
    Autorzy:
    Lewczuk, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/223845.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    scheduling
    internal transport process
    optimization
    genetic algorithm
    transport wewnętrzny
    optymalizacja
    programowanie genetyczne
    Opis:
    The paper presents proposition of using genetic algorithm to support organization of internal transport processes in logistics facilities. The organization of internal transport can be done through solving optimization task of scheduling internal transport process with allocation of human resources and equipment to the tasks. Internal transport process was defined and discussed as an object of organization. Precise methods of solving proposed optimization task were unable to give useful solutions according to the computational complexity of the problem, so heuristic genetic algorithm was proposed. The possible structures of chromosome representing feasible solutions, methods of generating initial population, base genetic operators: selection and inheritance, crossover, mutation and fixing of individuals were described. The main implementation difficulties, computational experiments and the scope of application of the algorithm were discussed.
    Źródło:
    Archives of Transport; 2015, 34, 2; 61-74
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    TOD mode: study on land planning and land use optimization for urban rail transit station area
    Autorzy:
    Shen, Hongtian
    Ma, Guimin
    Powiązania:
    https://bibliotekanauki.pl/articles/27311800.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    rail transit
    development
    land planning
    genetic algorithm
    tranzyt kolejowy
    rozwój
    planowanie przestrzenne
    algorytm genetyczny
    Opis:
    The rational planning of land around rail transit stations in cities can effectively improve the convenience of transportation and economic development of cities. This paper briefly introduced the transit-oriented development (TOD) mode of urban planning. We constructed a hierarchical structure for evaluating the quality of land planning of urban rail transit stations through the analytic hierarchy process (AHP) method. The structure started from three large aspects, i.e., traffic volume, regional environmental quality, and regional economic efficiency, and every large aspect was divided into three small aspects. Then, an optimization model was established for land planning of rail transit stations. The land planning scheme was optimized by a genetic algorithm (GA). To enhance the optimization performance of the GA, it was improved by coevolution, i.e., plural populations iterated independently, and every population replaced the poor chromosomes in the other populations with its excellent chromosomes in the previous process. Finally, the Jinzhonghe street station in Hebei District, Tianjin city, was taken as a subject for analysis. The results suggested that the improved GA obtained a set of non-inferior Pareto solutions when solving a multi-objective optimization problem. The distribution of solutions in the set also indicated that any two objectives among traffic volume, environmental quality, and economic efficiency was improved at the cost of the remaining objectives. The land planning schemes optimized by the particle swarm optimization (PSO) algorithm, the traditional GA, and the improved GA, respectively, were superior than the initial scheme, and the optimized scheme of the improved GA was more in line with the characteristics of the TOD mode than the traditional one and the PSO algorithm, and the fitness value was also higher. In conclusion, the GA can be used to optimize the planning design of land in rail transit areas under the TOD mode, and the optimization performance of the GA can be improved by means of coevolution.
    Źródło:
    Archives of Transport; 2023, 66, 2; 33--43
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new simulation-optimization approach for the circulation facilities design at urban rail transit station
    Autorzy:
    Khattak, A.
    Jiang, Y.
    Zhu, J.
    Hu, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/223467.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    urban rail transit station
    facilities design
    genetic algorithm
    simulation optimisation
    stacja transportu miejskiego
    projektowanie obiektów
    algorytm genetyczny
    symulacja optymalizacji
    Opis:
    Width design of the urban rail transit stations circulation facilities is a vital issue. The existing width design approach failed in fully considering the essential factors such as fluctuation in passengers’ arrival process, fluctuation and state-dependence in passengers walking speed and the blocking when passengers’ demand exceeds the capacity of facilities. For this purpose, a PH-based simulation-optimization approach is proposed that fully considers the fluctuation, the state-dependence, Level of Service (LOS) and blocking effect. This novel approach provides automatic reconfiguration of the widths of circulation facilities by a concurrent implementation of a PH-based Discrete-Event Simulation (DES) model and the Genetic Algorithm (GA). The proposed PH-based simulation-optimization approach and the existing design approaches based on the exponential and deterministic models are applied to design the widths of circulation facilities. The results reveal that the circulation facilities designed by the proposed approach have larger widths. Similarly, increase in the SCV of arrival interval results in increasing the widths designed by the proposed approach increase while the widths of the other two approaches stay the same. The width designed of the proposed approach increase at faster rate than that of the other two approach when the passengers’ arrival rate increases.
    Źródło:
    Archives of Transport; 2017, 43, 3; 69-90
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Travel management optimization based on air pollution condition using Markov decision process and genetic algorithm (case study: Shiraz city)
    Autorzy:
    Bagheri, Mohammad
    Ghafourian, Hossein
    Kashefiolasl, Morteza
    Pour, Mohammad Taghi Sadati
    Rabbani, Mohammad
    Powiązania:
    https://bibliotekanauki.pl/articles/223520.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    air pollution
    dynamic optimization
    genetic algorithm
    Markov decision-making process
    zarządzanie transportem
    optymalizacja
    zanieczyszczenie powietrza
    algorytm genetyczny
    proces decyzyjny Markowa
    Opis:
    Currently, air pollution and energy consumption are the main issues in the transportation area in large urban cities. In these cities, most people choose their transportation mode according to corresponding utility including traveller's and trip’s characteristics. Also, there is no effective solution in terms of population growth, urban space, and transportation demands, so it is essential to optimize systematically travel demands in the real network of roads in urban areas, especially in congested areas. Travel Demand Management (TDM) is one of the well-known ways to solve these problems. TDM defined as a strategy that aims to maximize the efficiency of the urban transport system by granting certain privileges for public transportation modes, Enforcement on the private car traffic prohibition in specific places or times, increase in the cost of using certain facilities like parking in congested areas. Network pricing is one of the most effective methods of managing transportation demands for reducing traffic and controlling air pollution especially in the crowded parts of downtown. A little paper may exist that optimize urban transportations in busy parts of cities with combined Markov decision making processes with reward and evolutionary-based algorithms and simultaneously considering customers’ and trip’s characteristics. Therefore, we present a new network traffic management for urban cities that optimizes a multi-objective function that related to the expected value of the Markov decision system’s reward using the Genetic Algorithm. The planned Shiraz city is taken as a benchmark for evaluating the performance of the proposed approach. At first, an analysis is also performed on the impact of the toll levels on the variation of the user and operator cost components, respectively. After choosing suitable values for the network parameters, simulation of the Markov decision process and GA is dynamically performed, then the optimal decision for the Markov decision process in terms of total reward is obtained. The results illustrate that the proposed cordon pricing has significant improvement in performance for all seasons including spring, autumn, and winter.
    Źródło:
    Archives of Transport; 2020, 53, 1; 89-102
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Passenger’s routes planning in stochastic common-lines’ multi-modal transportation network through integrating Genetic Algorithm and Monte Carlo simulation
    Autorzy:
    Peng, Yong
    Mo, Zhiyao
    Liu, Song
    Powiązania:
    https://bibliotekanauki.pl/articles/1955092.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    stochastic networks
    multimodal transportation
    passengers’ route
    genetic algorithm
    Monte Carlo simulation
    sieci stochastyczne
    transport multimodalny
    algorytm genetyczny
    symulacja Monte Carlo
    Opis:
    In the urban transportation network, most passengers choose public transportation to travel. However, bad weather, accidents, traffic jams and other factors lead to uncertainty in transportation network. Besides, transport vehicles running on the same segments of routes and belonging to different modes or routes make the transportation network more complicated. In order to improve the efficiency of passenger’s travel, this paper aim to introducing an approach for optimizing passenger travel routes. This approach takes the travel cost and the number of transfers as constraints to finding the shortest total travel duration of passenger in urban transportation network. The running duration and dwell duration of the vehicles in the network are uncertain, and the vehicles are running according to the timetables. As transportation modes, bus, rail transit and walk are considered. In terms of methodological contribution, this paper combines Genetic Algorithm (GA) and Monte Carlo simulation to deal with optimization problem under stochastic conditions. This paper uses Monte Carlo simulation to simulate the running duration and dwell time of vehicles in different scenarios to deal with the uncertainty of the network. The shortest path of passenger’s travel is solved by GA. Two kinds of population management strategies including single population management strategy and multiple population management strategy are designed to guide the solution population evolving process. The two kinds of population management strategies of GA are tested in numerical example. The satisfactory convergence performance and efficiency of the model and algorithm is verified by the numerical example. The numerical example also demonstrated that the multiple population management strategy of GA can get better results in a shorter CPU time. At the same time, the influences of some significant variables on solution are performed. This paper is able to provide a scientific quantitative support to the path scheme selection under the influence of common-lines and timetables of different modes of transportation in stochastic urban multimodal transportation network.
    Źródło:
    Archives of Transport; 2021, 59, 3; 73-92
    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ł:
    Generalized route planning approach for hazardous materials transportation with equity consideration
    Autorzy:
    Chai, H.
    He, R.-C.
    Jia, X.-yan
    Ma, Ch.-x
    Dai, C.-jie
    Powiązania:
    https://bibliotekanauki.pl/articles/223759.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    hazardous materials transportation
    transportation
    route optimization
    risk equity
    multi-objective optimization
    NSGA-II algorithm
    genetic algorithm
    transport materiałów niebezpiecznych
    materiały niebezpieczne
    optymalizacja trasy
    kapitał własny
    optymalizacja wielokryterialna
    algorytm NSGA-II
    algorytm genetyczny
    Opis:
    Hazardous materials transportation should consider risk equity and transportation risk and cost. In the hazardous materials transportation process, we consider risk equity as an important condition in optimizing vehicle routing for the long-term transport of hazardous materials between single or multiple origin-destination pairs (O-D) to reduce the distribution difference of hazardous materials transportation risk over populated areas. First, a risk equity evaluation scheme is proposed to reflect the risk difference among the areas. The evaluation scheme uses standard deviation to measure the risk differences among populated areas. Second, a risk distribution equity model is proposed to decrease the risk difference among populated areas by adjusting the path frequency between O-D pairs for hazardous materials transportation. The model is converted into two sub models to facilitate decision-making, and an algorithm is provided for each sub model. Finally, we design a numerical example to verify the accuracy and rationality of the model and algorithm. The numerical example shows that the proposed model is essential and feasible for reducing the complexity and increasing the portability of the transportation process.
    Źródło:
    Archives of Transport; 2018, 46, 2; 33-46
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimizations of network layout and transport service frequencies in view of interests of transit line operators and utilizers
    Autorzy:
    Zhu, Xiaojing
    Feng, Xuesong
    Zhang, Lukai
    Hua, Weixin
    Powiązania:
    https://bibliotekanauki.pl/articles/223857.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    transit network layout design
    transportation service
    service optimization
    interests of transit line operators
    interests of utilizers
    simulated annealing algorithm
    genetic algorithm
    projekt układu sieci transportowej
    usługi transportowe
    optymalizacja usług
    interesy operatorów linii tranzytowych
    interes użytkowników
    algorytm genetyczny
    Opis:
    Layouts of bus networks in cities are always irrational currently, transport service frequencies also need to be optimized according to the real network layouts, operation conditions and travel experience of passengers, so it is essential to optimize bus transit network layouts and transport service frequencies systematically. Different stakeholders are involved in the optimization of urban bus transit network layouts like the government, operators and passengers, whose interests are always contradictory. In order to optimize transit network layout and service frequencies from the view point of operators and utilizers, this research constructs a multi-objective model and proposes a solution algorithm. The proposed multi-objective model is established from the perspective of operators with the goal of minimizing total operating costs for one day, and from the perspective of the utilizers to minimize the total travel time, respectively. Also with the application of electric bus in cities, buses in this research are electric buses all for green travel. Moreover, a solution algorithm is proposed in this research to solve the proposed multi-objective model with simulated annealing algorithm and genetic algorithm. Simulated annealing algorithm is used as the main framework of the solution algorithm from the perspective of operators to minimize operating costs, while genetic algorithm is used as the subroutine of simulated annealing algorithm to optimize total travel time. Verification of the proposed model and the solution algorithm is based on an intuitive network. The application results of a numerical experiment verified that the proposed optimization model and the solution algorithm are able to optimize the network layout and service frequencies at the same time.
    Źródło:
    Archives of Transport; 2019, 50, 2; 47-55
    0866-9546
    2300-8830
    Pojawia się w:
    Archives of Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-10 z 10

      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