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ę "multi-objective" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 101
Tytuł:
A fuzzy approach to multi-objective mixed integer linear programming model for multi-echelon closed-loop supply chain with multi-product multi-time-period
Autorzy:
Akin Bas, Sema
Ahlatcioglu Ozkok, Beyza
Powiązania:
https://bibliotekanauki.pl/articles/406583.pdf
Data publikacji:
2020
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
closed-loop supply chain management
multi-objective optimization
fuzzy mixed-integerlinear programming
inventory decision
Opis:
By the green point of view, supply chain management (SCM), which contains supplier and location selection, production, distribution, and inventory decisions, is an important subject being examined in recent years by both practitioners and academicians. In this paper, the closed-loop supply chain (CLSC) network that can be mutually agreed by meeting at the level of common satisfaction of conflicting objectives is designed. We construct a multi-objective mixed-integer linear programming (MOMILP) model that allows decision-makers to more effectively manage firms’ closed-loop green supply chain (SC). An ecological perspective is brought by carrying out the recycling, remanufacturing and destruction to SCM in our proposed model. Maximize the rating of the regions in which they are located, minimize total cost and carbon footprint are considered as the objectives of the model. By constructing our model, the focus of customer satisfaction is met, as well as the production, location of facilities and order allocation are decided, and we also carry out the inventory control of warehouses. In our multi-product multi-component multi-time-period model, the solution is obtained with a fuzzy approach by using the min operator of Zimmermann. To illustrate the model, we provide a practical case study, and an optimal result containing a preferable level of satisfaction to the decision-maker is obtained.
Źródło:
Operations Research and Decisions; 2020, 30, 1; 25-46
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A hybridization of machine learning and NSGA-II for multi-objective optimization of surface roughness and cutting force in AISI 4340 alloy steel turning
Autorzy:
Nguyen, Anh-Tu
Nguyen, Van-Hai
Le, Tien-Thinh
Nguyen, Nhu-Tung
Powiązania:
https://bibliotekanauki.pl/articles/2200263.pdf
Data publikacji:
2023
Wydawca:
Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
Tematy:
multi-objective optimisation
machine learning
AISI 4340
NSGA-II
ANN
Opis:
This work focuses on optimizing process parameters in turning AISI 4340 alloy steel. A hybridization of Machine Learning (ML) algorithms and a Non-Dominated Sorting Genetic Algorithm (NSGA-II) is applied to find the Pareto solution. The objective functions are a simultaneous minimum of average surface roughness (Ra) and cutting force under the cutting parameter constraints of cutting speed, feed rate, depth of cut, and tool nose radius in a range of 50–375 m/min, 0.02–0.25 mm/rev, 0.1–1.5 mm, and 0.4–0.8 mm, respectively. The present study uses five ML models – namely SVR, CAT, RFR, GBR, and ANN – to predict Ra and cutting force. Results indicate that ANN offers the best predictive performance in respect of all accuracy metrics: root-mean-squared-error (RMSE), mean-absolute-error (MAE), and coefficient of determination (R2). In addition, a hybridization of NSGA-II and ANN is implemented to find the optimal solutions for machining parameters, which lie on the Pareto front. The results of this multi-objective optimization indicate that Ra lies in a range between 1.032 and 1.048 μm, and cutting force was found to range between 7.981 and 8.277 kgf for the five selected Pareto solutions. In the set of non-dominated keys, none of the individual solutions is superior to any of the others, so it is the manufacturer's decision which dataset to select. Results summarize the value range in the Pareto solutions generated by NSGA-II: cutting speeds between 72.92 and 75.11 m/min, a feed rate of 0.02 mm/rev, a depth of cut between 0.62 and 0.79 mm, and a tool nose radius of 0.4 mm, are recommended. Following that, experimental validations were finally conducted to verify the optimization procedure.
Źródło:
Journal of Machine Engineering; 2023, 23, 1; 133--153
1895-7595
2391-8071
Pojawia się w:
Journal of Machine Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A New Mathematical Model for Multisession Exams-Building Assignment
Autorzy:
Ergul, Z.
Kamisli Ozturk, Z.
Powiązania:
https://bibliotekanauki.pl/articles/1031701.pdf
Data publikacji:
2017-09
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
Educational timetabling
Examination-building assignment
Multi objective nonlinear optimization
Mixed Integer Programming
Opis:
The educational timetabling problem has been extensively investigated in timetabling literature. However, the problem of assigning exams to examination buildings has not been studied intensively by researchers. We were inspired by Open and Distance Education System exams of Anadolu University. Anadolu University Open and Distance Education System, which is used by approximately two millions of students and has more than two millions of graduates, is a well-known institution in Turkey. In this study, we propose a multi-objective mathematical model for multisession exam-building assignment problem. Objective functions of this model are to minimize the distance between consecutive session buildings for a given student, to maximize the number of occupants of buildings in every session and to minimize the variety of booklets for building in every session. Mathematical model has been found inadequate because students-examination building assignment in the Anadolu University Open Education system is a large size real life problem. Starting from this point of view, an order-based multi-objective heuristic algorithm is developed to solve this problem. The solutions obtained by the proposed algorithm are compared with the solution obtained by the mathematical modelling and the current state of the existing system.
Źródło:
Acta Physica Polonica A; 2017, 132, 3; 1207-1210
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new method of decision making in multi-objective optimal placement and sizing of distributed generators in the smart grid
Autorzy:
Khoshayand, Hossein Ali
Wattanapongsakorn, Naruemon
Mahdavian, Mehdi
Ganji, Ehsan
Powiązania:
https://bibliotekanauki.pl/articles/2202555.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
backward-forward load distribution
fuzzy logic
iterative search algorithm
multi-objective optimization
shortest distance from the origin
weighted sum
Opis:
One of the most important aims of the sizing and allocation of distributed generators (DGs) in power systems is to achieve the highest feasible efficiency and performance by using the least number of DGs. Considering the use of two DGs in comparison to a single DG significantly increases the degree of freedom in designing the power system. In this paper, the optimal placement and sizing of two DGs in the standard IEEE 33-bus network have been investigated with three objective functions which are the reduction of network losses, the improvement of voltage profiles, and cost reduction. In this way, by using the backward-forward load distribution, the load distribution is performed on the 33-bus network with the power summation method to obtain the total system losses and the average bus voltage. Then, using the iterative search algorithm and considering problem constraints, placement and sizing are done for two DGs to obtain all the possible answers and next, among these answers three answers are extracted as the best answers through three methods of fuzzy logic, the weighted sum, and the shortest distance from the origin. Also, using the multi-objective non-dominated sorting genetic algorithm II (NSGA-II) and setting the algorithm parameters, thirty-six Pareto fronts are obtained and from each Pareto front, with the help of three methods of fuzzy logic, weighted sum, and the shortest distance from the origin, three answers are extracted as the best answers. Finally, the answer which shows the least difference among the responses of the iterative search algorithm is selected as the best answer. The simulation results verify the performance and efficiency of the proposed method.
Źródło:
Archives of Electrical Engineering; 2023, 72, 1; 253--271
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new multi-objective optimization algorithm based on differential evolution and neighborhood exploring evolution strategy
Autorzy:
Lobato, F. S.
Steffen, Jr, V.
Powiązania:
https://bibliotekanauki.pl/articles/91590.pdf
Data publikacji:
2011
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
multi-objective optimization
differential evolution
neighborhood exploring
evolution strategy
sorting strategy
Opis:
In this paper a new optimization algorithm based on Differential Evolution, non-dominated sorting strategy and neighborhood exploration strategy for guaranteeing convergence and diversity through the generation of neighborhoods of different sizes to potential candidates in the population is presented. The performance of the algorithm proposed is validated by using standard test functions and metrics commonly adopted in the specialized literature. The sensitivity analysis of some relevant parameters of the algorithm is performed and compared with the classical DE algorithm without the strategy of neighborhood exploration and with other state-of-the-art evolutionary algorithms.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2011, 1, 4; 259-267
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A novel hybrid cuckoo search algorithm for optimization of a line-start PM synchronous motor
Autorzy:
Knypiński, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/2204509.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hybrid cuckoo search algorithm
heuristic algorithms
multi-objective optimization
permanent magnet synchronous motor
PMSM
algorytm kukułki hybrydowy
algorytm Cuckoo
algorytm heurystyczny
optymalizacja wielocelowa
silnik synchroniczny z magnesem trwałym
Opis:
The paper presents a novel hybrid cuckoo search (CS) algorithm for the optimization of the line-start permanent magnet synchronous motor (LSPMSM). The hybrid optimization algorithm developed is a merger of the heuristic algorithm with the deterministic Hooke–Jeeves method. The hybrid optimization procedure developed was tested on analytical benchmark functions and the results were compared with the classical cuckoo search algorithm, genetic algorithm, particle swarm algorithm and bat algorithm. The optimization script containing a hybrid algorithm was developed in Delphi Tiburón. The results presented show that the modified method is characterized by better accuracy. The optimization procedure developed is related to a mathematical model of the LSPMSM. The multi-objective compromise function was applied as an optimality criterion. Selected results were presented and discussed.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 1; art. no. e144586
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A novel multi-objective discrete particle swarm optimization with elitist perturbation for reconfiguration of ship power system
Autorzy:
Zhang, L.
Sun, J.
Guo, C.
Powiązania:
https://bibliotekanauki.pl/articles/260215.pdf
Data publikacji:
2017
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
shipboard power system
reconfiguration
multi-objective
discrete PSO
elitist perturbation
Opis:
A novel multi-objective discrete particle swarm optimization with elitist perturbation strategy (EPSMODPSO) is proposed and applied to solve the reconfiguration problem of shipboard power system(SPS). The new algorithm uses the velocity to decide each particle to move one step toward positive or negative direction to update the position. An elitist perturbation strategy is proposed to improve the local search ability of the algorithm. Reconfiguration model of SPS is established with multiple objectives, and an inherent homogeneity index is adopted as the auxiliary estimating index. Test results of examples show that the proposed EPSMODPSO performs excellent in terms of diversity and convergence of the obtained Pareto optimal front. It is competent to solve network reconfiguration of shipboard power system and other multi-objective discrete optimization problems.
Źródło:
Polish Maritime Research; 2017, S 3; 79-85
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Survey on multi-objective based parameter optimization for deep learning
Autorzy:
Chakraborty, Mrittika
Pal, Wreetbhas
Bandyopadhyay, Sanghamitra
Maulik, Ujjwal
Powiązania:
https://bibliotekanauki.pl/articles/27312917.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
deep learning
multi-objective optimization
parameter optimization
neural networks
Opis:
Deep learning models form one of the most powerful machine learning models for the extraction of important features. Most of the designs of deep neural models, i.e., the initialization of parameters, are still manually tuned. Hence, obtaining a model with high performance is exceedingly time-consuming and occasionally impossible. Optimizing the parameters of the deep networks, therefore, requires improved optimization algorithms with high convergence rates. The single objective-based optimization methods generally used are mostly time-consuming and do not guarantee optimum performance in all cases. Mathematical optimization problems containing multiple objective functions that must be optimized simultaneously fall under the category of multi-objective optimization sometimes referred to as Pareto optimization. Multi-objective optimization problems form one of the alternatives yet useful options for parameter optimization. However, this domain is a bit less explored. In this survey, we focus on exploring the effectiveness of multi-objective optimization strategies for parameter optimization in conjunction with deep neural networks. The case studies used in this study focus on how the two methods are combined to provide valuable insights into the generation of predictions and analysis in multiple applications.
Źródło:
Computer Science; 2023, 24 (3); 327--359
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adaptive robust PID sliding control of a liquid level system based on multi-objective genetic algorithm optimization
Autorzy:
Mahmoodabadi, M. J.
Taherkhorsandi, M.
Talebipour, M.
Powiązania:
https://bibliotekanauki.pl/articles/206697.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
sliding mode control
PID control
adaptive control
genetic algorithm
multi-objective optimization
liquid level system
Opis:
Adaptive robust PID sliding mode control optimized by means of multi-objective genetic algorithm is presented in this paper to control a three-tank liquid level system with external disturbances. While PID constitutes a reliable and stable controller, when compared to sliding mode control (SMC); robustness and tracking performance of SMC are higher than those of the PID control. To use the unique features of both controllers, optimal sliding mode control is executed in terms of a supervisory controller to enhance the performance of optimal adaptive PID control and to provide the necessary control inputs. After the design of the control law, control coefficients of all four involved controllers are optimized by using the multi-objective genetic algorithm so as to minimize errors and the input of the controller. Simulations illustrate that the adaptive robust PID sliding controller based on multi-objective genetic algorithm optimization provides a superior response in comparison to the results obtained separately by PID control, sliding mode control, and adaptive PID control, respectively.
Źródło:
Control and Cybernetics; 2017, 46, 3; 227-246
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An algorithm for quadratically constrained multi-objective quadratic fractional programming with pentagonal fuzzy numbers
Autorzy:
Goyal, Vandana
Rani, Namrata
Gupta, Deepak
Powiązania:
https://bibliotekanauki.pl/articles/2175831.pdf
Data publikacji:
2022
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
multi-objective quadratic fractional programming model
MOQFPM
pentagonal fuzzy number
PFN
mean method of α-cut
parametric approach
ε-constraint method
Opis:
This study proposes a methodology to obtain an efficient solution for a programming model which is multi-objective quadratic fractional with pentagonal fuzzy numbers as coefficients in all the objective functions and constraints. The proposed approach consists of three stages. In the first stage, defuzzification of the coefficients is carried out using the mean method of α-cut. Then, in the second stage, a crisp multi-objective quadratic fractional programming model (MOQFP) is constructed to obtain a non-fractional model based on an iterative parametric approach. In the final stage, this multi- -objective non-fractional model is transformed to obtain a model with a single objective by applying the ε-constraint method. This final model is then solved to get desired solution. Also, an algorithm and flowchart expressing the methodology are given to present a clear picture of the approach. Finally, a numerical example illustrating the complete approach is given.
Źródło:
Operations Research and Decisions; 2022, 32, 1; 49--71
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of entropy method for estimating factor weights in mining-method selection for development of novel mining-method selection system
Autorzy:
Manjate, Pansilvania Andre Manjate
Saadat, Mahdi
Toriya, Hisatoshi
Inagaki, Fumiaki
Kawamura, Youhei
Powiązania:
https://bibliotekanauki.pl/articles/2073905.pdf
Data publikacji:
2021
Wydawca:
Główny Instytut Górnictwa
Tematy:
mine planning
decision-making
multi-criteria
feature selection
objective weight
planowanie kopalni
podejmowanie decyzji
wielokryterialność
wybór cech
Opis:
Mining-method selection (MMS) is one of the most critical and complex decision making processes in mine planning. Therefore, it has been a subject of several studies for many years culminating with the development of different systems. However, there is still more to be done to improve and/or create more efficient systems and deal with the complexity caused by many influencing factors. This study introduces the application of the entropy method for feature selection, i.e., select the most critical factors in MMS. The entropy method is applied to assess the relative importance of the factors influencing MMS by estimating their objective weights to then select the most critical. Based on the results, ore strength, host-rock strength, thickness, shape, dip, ore uniformity, mining costs, and dilution were identified as the most critical factors. This study adopts the entropy method in the data preparation step (i.e., feature selection) for developing a novel-MMS system that employs recommendation system technologies. The most critical factors will be used as main variables to create the dataset to serve as a basis for developing the model for the novel-MMS system. This study is a key step to optimize the performance of the model.
Źródło:
Journal of Sustainable Mining; 2021, 20, 4; 296--308
2300-1364
2300-3960
Pojawia się w:
Journal of Sustainable Mining
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of goal programming in the textile apparel industry to resolve production planning problems : a meta-goal programming technique using weights
Autorzy:
Malik, Zahid Amin
Kumar, Rakesh
Pathak, Govind
Roy, Haridas
Powiązania:
https://bibliotekanauki.pl/articles/2175839.pdf
Data publikacji:
2022
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
meta-goal programming
weighted goal programming
multi-objective decision making
asset allocation
textile sector
sensitivity analysis
Opis:
In the present business environment, rapidly developing technology and the competitive world market pose challenges to the available assets of industries. Hence, industries need to allocate and use available assets at the optimum level. Thus, industrialists must create a good decision plan to guide their performance in the production sector. As a result, the present study applies the Meta-Goal Programming technique to attain several objectives simultaneously in the textile production sector. The importance of this study lies in pursuing different objectives simultaneously, which has been almost ignored till now. The production scheduling problem in a textile firm is used to illustrate the practicability and mathematical validity of the suggested approach. Analysis of the results obtained demonstrates that the solution met all three meta-goals with some original goals being met partially. An analysis of the sensitivity of the approach to the weights of the preferences was conducted.
Źródło:
Operations Research and Decisions; 2022, 32, 2; 74--88
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Applying optimization techniques on cold-formed C-channel section under bending
Autorzy:
El-Lafy, Heba F.
Elgendi, Elbadr O.
Morsy, Alaa M.
Powiązania:
https://bibliotekanauki.pl/articles/27312402.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
kształtownik zimnogięty
optymalizacja
algorytm genetyczny
cold-formed sections
single optimization
multi-objective optimization
genetic algorithms
effective width method
C-channel beams
Opis:
There are no standard dimensions or shapes for cold-formed sections (CFS), making it difficult for a designer to choose the optimal section dimensions in order to obtain the most cost-effective section. A great number of researchers have utilized various optimization strategies in order to obtain the optimal section dimensions. Multi-objective optimization of CFS C-channel beams using a non-dominated sorting genetic algorithm II was performed using a Microsoft Excel macro to determine the optimal cross-section dimensions. The beam was optimized according to its flexural capacity and cross-sectional area. The flexural capacity was computed utilizing the effective width method (EWM) in accordance with the Egyptian code. The constraints were selected so that the optimal dimensions derived from optimization would be production and construction-friendly. A Pareto optimal solution was obtained for 91 sections. The Pareto curve demonstrates that the solution possesses both diversity and convergence in the objective space. The solution demonstrates that there is no optimal solution between 1 and 1.5 millimeters in thickness. The solutions were validated by conducting a comprehensive parametric analysis of the change in section dimensions and the corresponding local buckling capacity. In addition, performing a single-objective optimization based on section flexural capacity at various thicknesses The parametric analysis and single optimization indicate that increasing the dimensions of the elements, excluding the lip depth, will increase the section’s carrying capacity. However, this increase will depend on the coil’s wall thickness. The increase is more rapid in thicker coils than in thinner ones.
Źródło:
International Journal of Applied Mechanics and Engineering; 2022, 27, 4; 52--65
1734-4492
2353-9003
Pojawia się w:
International Journal of Applied Mechanics and Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bi-objective routing in a dynamic network: An application to maritime logistics
Autorzy:
Maskooki, Alaleh
Nikulin, Yury
Powiązania:
https://bibliotekanauki.pl/articles/2050033.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
travelling salesman
time dependent network
multi-objective optimization
integer programming
Opis:
A bi-objectiveMILP model for optimal routing in a dynamic network with moving targets (nodes) is developed, where all targets are not necessarily visited. Hence, our problem extends the moving target travelling salesman problem. The two objectives aim at finding the sequence of targets visited in a given time horizon by minimizing the total travel distance and maximizing the number of targets visited. Due to a huge number of binary variables, such a problem often becomes intractable in the real life cases. To reduce the computational burden, we introduce a measure of traffic density, based on which we propose a time horizon splitting heuristics. In a real-world case study of greenhouse gas emissions control, using Automatic Identification System data related to the locations of ships navigating in the Gulf of Finland, we evaluate the performance of the proposed method. Different splitting scenarios are analysed numerically. Even in the cases of a moderate scale, the results show that near-efficient values for the two objectives can be obtained by our splitting approach with a drastic decrease in computational time compared to the exact MILP method. A linear value function is introduced to compare the Pareto solutions obtained by different splitting scenarios. Given our results, we expect that the present study is valuable in logistic applications, specifically maritime management services and autonomous navigation.
Źródło:
Control and Cybernetics; 2020, 49, 2; 211--232
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Carpooling Scheme Selection for Taxi Carpooling Passengers: a Multi-Objective Model and Optimisation Algorithm
Autorzy:
Xiao, Q.
He, R.-C.
Powiązania:
https://bibliotekanauki.pl/articles/223987.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
traffic engineering
taxi carpooling
multi-objective optimisation
information entropy
inżynieria ruchu
system carpooling
wspólne dojazdy
infrastruktura transportowa
optymalizacja
Opis:
Carpooling has been long deemed a promising approach to better utilizing existing transportation infrastructure, the carpooling system can alleviate the problems of traffic congestion and environmental pollution effectively in big cities. However, algorithmic and technical barriers inhibit the development of taxi carpooling, and it is still not the preferred mode of commute. In order to improve carpooling efficiency in urban, a taxi carpooling scheme based on multi-objective model and optimisation algorithm is presented. In this paper, urban traffic road network nodes were constructed from the perspective of passenger carpooling. A multi-objective taxi carpooling scheme selection model was built based on an analysis of the main influences of carpooling schemes on passengers. This model aimed to minimise get-on-and-get-off distance, carpooling waiting time and arriving at the destination. Furthermore, a two-phase algorithm was used to solve this model. A rapid searching algorithm for feasible routes was established, and the weight vector was assigned by introducing information entropy to obtain satisfying routes. The algorithm is applied to the urban road, the Simulation experimental result indicates that the optimisation method presented in this study is effective in taxi carpooling passengers.
Źródło:
Archives of Transport; 2017, 42, 2; 85-92
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 101

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