12 research outputs found

    State Feedback H

    Get PDF
    A new state feedback H∞ control scheme is presented used in the boiler-turbine power units based on an improved particle swarm optimizing algorithm. Firstly, the nonlinear system is transformed into a linear time-varying system; then the H∞ control problem is transformed into the solution of a Riccati equation. The control effect of H∞ controller depends on the selection of matrix P, so an improved particle swarm optimizing (PSO) algorithm by introducing differential evolution algorithm is used to solve the Riccati equation. The main purpose is that mutation and crossover are introduced for a new population, and the population diversity is improved. It is beneficial to eliminate stagnation caused by premature convergence, and the algorithm convergence rate is improved. Finally, the real-time optimizing of the controller parameters is realized. Theoretical analysis and simulation results show that a state feedback H∞ controller can be obtained, which can ensure asymptotic stability of the system, and the double objectives of stabilizing system and suppressing the disturbance are got. The system can work well over a large range working point

    Systematic Literature Review Of Particle Swarm Optimization Implementation For Time-Dependent Vehicle Routing Problem

    Get PDF
    Time-dependent VRP (TDVRP) is one of the three VRP variants that have not been widely explored in research in the field of operational research, while Particle Swarm Optimization (PSO) is an optimization algorithm in the field of operational research that uses many variables in its application. There is much research conducted about TDVRP, but few of them discuss PSO's implementation. This article presented as a literature review which aimed to find a research gap about implementation of PSO to resolve TDVRP cases. The research was conducted in five stages. The first stage, a review protocol defined in the form of research questions and methods to perform the review. The second stage is references searching. The third stage is screening the search result. The fourth stage is extracting data from references based on research questions. The fifth stage is reporting the study literature results. The results obtained from the screening process were 37 eligible reference articles, from 172 search results articles. The results of extraction and analysis of 37 reference articles show that research on TDVRP discusses the duration of travel time between 2 locations. The route optimization parameter is determined from the cost of the trip, including the total distance traveled, the total travel time, the number of routes, and the number used vehicles. The datasets that are used in research consist of 2 types, real-world datasets and simulation datasets. Solomon Benchmark is a simulation dataset that is widely used in the case of TDVRP. Research on PSO in the TDVRP case is dominated by the discussion of modifications to determine random values of PSO variables

    Study of capacitated vehicle routing problem based on particle swarm optimization

    Get PDF
    Vehicle Routing Problem (VRP) is one of the common problems that happen in human life. There are many applications of VRP such as garbage disposal, mail delivery, school bus routing, airline schedule and many more. The main objective of VRP is to minimize the distance of the route starting from a depot, serves all of customers demand, and return back to depot. VRP is one of the optimization problems that belong to NP- hard (Non-deterministic Polynomial-time hard) problem and difficult to solve. VRP has also becomes one of the important topic to discuss and analyze. There are many types of VRP; this research is focusing on capacitated VRP (CVRP). CVRP is defined as the problem of determining optimal routes to be used by vehicles starting from one or more depots to serve all customers’ demand, observing some constraints. Particle Swarm Optimization (PSO) method will be used to solve the VRP problems because there are lots of advantages of PSO. PSO is a population based stochastic optimization technique, inspired by social behavior of bird flocking or fish schooling. The experiment has been done to test this algorithm. Three variants of PSO have been used which are PSO with inertia weight, PSO without inertia weight, and PSO with constriction factor. The results show that the PSO with inertia weight strategy which include PSO with inertia weight and PSO with constriction factor have the best total distance. It can be concluded that PSO with inertia weight strategies have better performance because they take less iteration to arrive at the optimum value. The second comparison also showed that small range of inertia weight has the best total distance

    An adaptive evolutionary algorithm for bi-level multi-objective VRPs with real-time traffic conditions

    Get PDF
    The file attached to this record is the author's final peer reviewed version.The research of vehicle routing problem (VRP) is significant for people traveling and logistics distribution. Recently, in order to alleviate global warming, the VRP based on electric vehicles has attracted much attention from researchers. In this paper, a bi-level routing problem model based on electric vehicles is presented, which can simulate the actual logistics distribution process. The classic backpropagation neural network is used to predict the road conditions for applying the method in real life. We also propose a local search algorithm based on a dynamic constrained multi-objective optimization framework. In this algorithm, 26 local search operators are designed and selected adaptively to optimize initial solutions. We also make a comparison between our algorithm and 3 modified algorithms. Experimental results indicate that our algorithm can attain an excellent solution that can satisfy the constraints of the VRP with real-time traffic conditions and be more competitive than the other 3 modified algorithms

    Application of particle swarm optimisation with backward calculation to solve a fuzzy multi-objective supply chain master planning model

    Full text link
    Traditionally, supply chain planning problems consider variables with uncertainty associated with uncontrolled factors. These factors have been normally modelled by complex methodologies where the seeking solution process often presents high scale of difficulty. This work presents the fuzzy set theory as a tool to model uncertainty in supply chain planning problems and proposes the particle swarm optimisation (PSO) metaheuristics technique combined with a backward calculation as a solution method. The aim of this combination is to present a simple effective method to model uncertainty, while good quality solutions are obtained with metaheuristics due to its capacity to find them with satisfactory computational performance in complex problems, in a relatively short time period.This research is partly supported by the Spanish Ministry of Economy and Competitiveness projects 'Methods and models for operations planning and order management in supply chains characterised by uncertainty in production due to the lack of product uniformity' (PLANGES-FHP) (Ref. DPI2011-23597) and 'Operations design and Management of Global Supply Chains' (GLOBOP) (Ref. DPI2012-38061-C02-01); by the project funded by the Polytechnic University of Valencia entitled 'Quantitative Models for the Design of Socially Responsible Supply Chains under Uncertainty Conditions. Application of Solution Strategies based on Hybrid Metaheuristics' (PAID-06-12); and by the Ministry of Science, Technology and Telecommunications, government of Costa Rica (MICITT), through the incentive program of the National Council for Scientific and Technological Research (CONICIT) (contract No FI-132-2011).Grillo Espinoza, H.; Peidro Payá, D.; Alemany Díaz, MDM.; Mula, J. (2015). Application of particle swarm optimisation with backward calculation to solve a fuzzy multi-objective supply chain master planning model. International Journal of Bio-Inspired Computation. 7(3):157-169. https://doi.org/10.1504/IJBIC.2015.069557S1571697

    Energy management in plug-in hybrid electric vehicles: recent progress and a connected vehicles perspective

    Get PDF
    Plug-in hybrid electric vehicles (PHEVs) offer an immediate solution for emissions reduction and fuel displacement within the current infrastructure. Targeting PHEV powertrain optimization, a plethora of energy management strategies (EMSs) have been proposed. Although these algorithms present various levels of complexity and accuracy, they find a limitation in terms of availability of future trip information, which generally prevents exploitation of the full PHEV potential in real-life cycles. This paper presents a comprehensive analysis of EMS evolution toward blended mode (BM) and optimal control, providing a thorough survey of the latest progress in optimization-based algorithms. This is performed in the context of connected vehicles and highlights certain contributions that intelligent transportation systems (ITSs), traffic information, and cloud computing can provide to enhance PHEV energy management. The study is culminated with an analysis of future trends in terms of optimization algorithm development, optimization criteria, PHEV integration in the smart grid, and vehicles as part of the fleet

    Integrated Supply Chain Network Design: Location, Transportation, Routing and Inventory Decisions

    Get PDF
    abstract: In this dissertation, an innovative framework for designing a multi-product integrated supply chain network is proposed. Multiple products are shipped from production facilities to retailers through a network of Distribution Centers (DCs). Each retailer has an independent, random demand for multiple products. The particular problem considered in this study also involves mixed-product transshipments between DCs with multiple truck size selection and routing delivery to retailers. Optimally solving such an integrated problem is in general not easy due to its combinatorial nature, especially when transshipments and routing are involved. In order to find out a good solution effectively, a two-phase solution methodology is derived: Phase I solves an integer programming model which includes all the constraints in the original model except that the routings are simplified to direct shipments by using estimated routing cost parameters. Then Phase II model solves the lower level inventory routing problem for each opened DC and its assigned retailers. The accuracy of the estimated routing cost and the effectiveness of the two-phase solution methodology are evaluated, the computational performance is found to be promising. The problem is able to be heuristically solved within a reasonable time frame for a broad range of problem sizes (one hour for the instance of 200 retailers). In addition, a model is generated for a similar network design problem considering direct shipment and consolidation within the same product set opportunities. A genetic algorithm and a specific problem heuristic are designed, tested and compared on several realistic scenarios.Dissertation/ThesisPh.D. Industrial Engineering 201
    corecore