• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • 3
  • Tagged with
  • 6
  • 6
  • 6
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A comparative study of metaheuristic algorithms for the fertilizer optimization problem

Dai, Chen 31 August 2006
Hard combinatorial optimization (CO) problems pose challenges to traditional algorithmic solutions. The search space usually contains a large number of local optimal points and the computational cost to reach a global optimum may be too high for practical use. In this work, we conduct a comparative study of several state-of-the-art metaheuristic algorithms for hard CO problems solving. Our study is motivated by an industrial application called the Fertilizer Blends Optimization. We focus our study on a number of local search metaheuristics and analyze their performance in terms of both runtime efficiency and solution quality. We show that local search granularity (move step size) and the downhill move probability are two major factors that affect algorithm performance, and we demonstrate how experimental tuning work can be applied to obtain good performance of the algorithms. <p>Our empirical result suggests that the well-known Simulated Annealing (SA) algorithm showed the best performance on the fertilizer problem. The simple Iterated Improvement Algorithm (IIA) also performed surprisingly well by combining strict uphill move and random neighborhood selection. A novel approach, called Delivery Network Model (DNM) algorithm, was also shown to be competitive, but it has the disadvantage of being very sensitive to local search granularity. The constructive local search method (GRASP), which combines heuristic space sampling and local search, outperformed IIA without a construction phase; however, the improvement in performance is limited and generally speaking, local search performance is not sensitive to initial search positions in our studied fertilizer problem.
2

A comparative study of metaheuristic algorithms for the fertilizer optimization problem

Dai, Chen 31 August 2006 (has links)
Hard combinatorial optimization (CO) problems pose challenges to traditional algorithmic solutions. The search space usually contains a large number of local optimal points and the computational cost to reach a global optimum may be too high for practical use. In this work, we conduct a comparative study of several state-of-the-art metaheuristic algorithms for hard CO problems solving. Our study is motivated by an industrial application called the Fertilizer Blends Optimization. We focus our study on a number of local search metaheuristics and analyze their performance in terms of both runtime efficiency and solution quality. We show that local search granularity (move step size) and the downhill move probability are two major factors that affect algorithm performance, and we demonstrate how experimental tuning work can be applied to obtain good performance of the algorithms. <p>Our empirical result suggests that the well-known Simulated Annealing (SA) algorithm showed the best performance on the fertilizer problem. The simple Iterated Improvement Algorithm (IIA) also performed surprisingly well by combining strict uphill move and random neighborhood selection. A novel approach, called Delivery Network Model (DNM) algorithm, was also shown to be competitive, but it has the disadvantage of being very sensitive to local search granularity. The constructive local search method (GRASP), which combines heuristic space sampling and local search, outperformed IIA without a construction phase; however, the improvement in performance is limited and generally speaking, local search performance is not sensitive to initial search positions in our studied fertilizer problem.
3

Planejamento de trajetórias livres de colisão : um estudo considerando restrições cinemáticas e dinâmicas de um manipulador pneumático por meio de algoritmos metaheurísticos

Izquierdo, Rafael Crespo January 2017 (has links)
presente trabalho consolida um estudo para o planejamento de trajetória livre de colisão para um robô pneumático com 5 graus de liberdade aplicando três algoritmos metaheurísticos: algoritmos metaheurísticos por vagalumes, algoritmos metaheurísticos por enxames de partículas e algoritmos genéticos. No que se refere à aplicação de algoritmos metaheurísticos ao estudo de planejamento de trajetória de robôs manipuladores na presença de obstáculos, existem diferentes tipos de técnicas para evitar colisões que consideram os efeitos cinemáticos e dinâmicos na obtenção de trajetórias com o menor tempo, torque, etc. Neste estudo, são propostas contribuições à aplicação dessas técnicas especificamente a robôs manipuladores pneumáticos, sobretudo, no que diz respeito às características específicas dos servoposicionadores pneumáticos, como, por exemplo, a modelagem do atrito desses sistemas, o cálculo da massa equivalente, etc. A metodologia utilizada é definida em duas etapas. A primeira delas consiste na obtenção de pontos intermediários, adquiridos considerando a menor distância entre os mesmos e o ponto final, gerados considerando a presença de obstáculos (cilindros, cubos e esferas) Esses obstáculos são mapeados em regiões de colisão, que constituem restrições para o problema de otimização. A segunda etapa baseia-se no estudo do planejamento de trajetórias: aplicam-se b-splines de 5º e 7º grau na interpolação dos pontos intermediários, com vistas à obtenção de trajetórias que considerem, de um lado, a menor força dos atuadores associada à dinâmica do manipulador em estudo e, de outro, restrições cinemáticas e dinâmicas, determinadas por meio das características operacionais dos servoposicionadores pneumáticos. Os resultados mostram que a metodologia proposta é adequada para tarefas de manipulação de peças na presença de obstáculos, uma vez que os pontos intermediários situam-se fora da região de colisão nos três casos aqui apresentados. Além disso, quanto à segunda etapa, observou-se que as trajetórias de 5º e 7º grau apresentaram resultados similares, de maneira que os erros obtidos poderiam ser melhorados analisando aspectos associados ao controlador do robô em estudo. / The thesis presents a study for collision-free trajectory planning for a pneumatic robot with 5 degrees of freedom applying three metaheuristic algorithms: firefly metaheuristic algorithm, particle swarm optimization and genetic algorithms. As regards the application of metaheuristic algorithms to the study of the trajectory planning of manipulating robots in the presence of obstacles, there are different types of techniques to avoid collisions that consider the kinematic and dynamic effects, obtaining trajectories with the optimal time, torque, etc. In this study, contributions are made to the application of these techniques specifically to pneumatic manipulator robots, particularly with regard to the specific characteristics of pneumatic servo-actuators, such as friction modeling of these systems, calculation of equivalent mass, etc. The methodology used is defined in two steps. The first one consists of obtaining intermediate points, acquired considering the smallest distance between the intermediate points and the final point, generated considering the presence of obstacles (cylinders, cubes and spheres) These obstacles are mapped in collision regions, which are constraints to the optimization problem. The second step is based on the study of the trajectory planning: 5th and 7th degree b-splines are applied in the interpolation of the intermediate points, in order to obtain trajectories that consider the smallest actuator force associated to the dynamics of the manipulator and the kinematic and dynamic constraints, determined by the operational characteristics of pneumatic servo-positioners. The results show that the proposed methodology is suitable for tasks of manipulating parts in the presence of obstacles because the intermediate points are outside the collision region in the three cases presented here. In addition, it was observed that the trajectories of 5th and 7th degree presented similar results, so that the errors obtained could be improved by analyzing aspects associated to the controller of the robot.
4

Planejamento de trajetórias livres de colisão : um estudo considerando restrições cinemáticas e dinâmicas de um manipulador pneumático por meio de algoritmos metaheurísticos

Izquierdo, Rafael Crespo January 2017 (has links)
presente trabalho consolida um estudo para o planejamento de trajetória livre de colisão para um robô pneumático com 5 graus de liberdade aplicando três algoritmos metaheurísticos: algoritmos metaheurísticos por vagalumes, algoritmos metaheurísticos por enxames de partículas e algoritmos genéticos. No que se refere à aplicação de algoritmos metaheurísticos ao estudo de planejamento de trajetória de robôs manipuladores na presença de obstáculos, existem diferentes tipos de técnicas para evitar colisões que consideram os efeitos cinemáticos e dinâmicos na obtenção de trajetórias com o menor tempo, torque, etc. Neste estudo, são propostas contribuições à aplicação dessas técnicas especificamente a robôs manipuladores pneumáticos, sobretudo, no que diz respeito às características específicas dos servoposicionadores pneumáticos, como, por exemplo, a modelagem do atrito desses sistemas, o cálculo da massa equivalente, etc. A metodologia utilizada é definida em duas etapas. A primeira delas consiste na obtenção de pontos intermediários, adquiridos considerando a menor distância entre os mesmos e o ponto final, gerados considerando a presença de obstáculos (cilindros, cubos e esferas) Esses obstáculos são mapeados em regiões de colisão, que constituem restrições para o problema de otimização. A segunda etapa baseia-se no estudo do planejamento de trajetórias: aplicam-se b-splines de 5º e 7º grau na interpolação dos pontos intermediários, com vistas à obtenção de trajetórias que considerem, de um lado, a menor força dos atuadores associada à dinâmica do manipulador em estudo e, de outro, restrições cinemáticas e dinâmicas, determinadas por meio das características operacionais dos servoposicionadores pneumáticos. Os resultados mostram que a metodologia proposta é adequada para tarefas de manipulação de peças na presença de obstáculos, uma vez que os pontos intermediários situam-se fora da região de colisão nos três casos aqui apresentados. Além disso, quanto à segunda etapa, observou-se que as trajetórias de 5º e 7º grau apresentaram resultados similares, de maneira que os erros obtidos poderiam ser melhorados analisando aspectos associados ao controlador do robô em estudo. / The thesis presents a study for collision-free trajectory planning for a pneumatic robot with 5 degrees of freedom applying three metaheuristic algorithms: firefly metaheuristic algorithm, particle swarm optimization and genetic algorithms. As regards the application of metaheuristic algorithms to the study of the trajectory planning of manipulating robots in the presence of obstacles, there are different types of techniques to avoid collisions that consider the kinematic and dynamic effects, obtaining trajectories with the optimal time, torque, etc. In this study, contributions are made to the application of these techniques specifically to pneumatic manipulator robots, particularly with regard to the specific characteristics of pneumatic servo-actuators, such as friction modeling of these systems, calculation of equivalent mass, etc. The methodology used is defined in two steps. The first one consists of obtaining intermediate points, acquired considering the smallest distance between the intermediate points and the final point, generated considering the presence of obstacles (cylinders, cubes and spheres) These obstacles are mapped in collision regions, which are constraints to the optimization problem. The second step is based on the study of the trajectory planning: 5th and 7th degree b-splines are applied in the interpolation of the intermediate points, in order to obtain trajectories that consider the smallest actuator force associated to the dynamics of the manipulator and the kinematic and dynamic constraints, determined by the operational characteristics of pneumatic servo-positioners. The results show that the proposed methodology is suitable for tasks of manipulating parts in the presence of obstacles because the intermediate points are outside the collision region in the three cases presented here. In addition, it was observed that the trajectories of 5th and 7th degree presented similar results, so that the errors obtained could be improved by analyzing aspects associated to the controller of the robot.
5

Planejamento de trajetórias livres de colisão : um estudo considerando restrições cinemáticas e dinâmicas de um manipulador pneumático por meio de algoritmos metaheurísticos

Izquierdo, Rafael Crespo January 2017 (has links)
presente trabalho consolida um estudo para o planejamento de trajetória livre de colisão para um robô pneumático com 5 graus de liberdade aplicando três algoritmos metaheurísticos: algoritmos metaheurísticos por vagalumes, algoritmos metaheurísticos por enxames de partículas e algoritmos genéticos. No que se refere à aplicação de algoritmos metaheurísticos ao estudo de planejamento de trajetória de robôs manipuladores na presença de obstáculos, existem diferentes tipos de técnicas para evitar colisões que consideram os efeitos cinemáticos e dinâmicos na obtenção de trajetórias com o menor tempo, torque, etc. Neste estudo, são propostas contribuições à aplicação dessas técnicas especificamente a robôs manipuladores pneumáticos, sobretudo, no que diz respeito às características específicas dos servoposicionadores pneumáticos, como, por exemplo, a modelagem do atrito desses sistemas, o cálculo da massa equivalente, etc. A metodologia utilizada é definida em duas etapas. A primeira delas consiste na obtenção de pontos intermediários, adquiridos considerando a menor distância entre os mesmos e o ponto final, gerados considerando a presença de obstáculos (cilindros, cubos e esferas) Esses obstáculos são mapeados em regiões de colisão, que constituem restrições para o problema de otimização. A segunda etapa baseia-se no estudo do planejamento de trajetórias: aplicam-se b-splines de 5º e 7º grau na interpolação dos pontos intermediários, com vistas à obtenção de trajetórias que considerem, de um lado, a menor força dos atuadores associada à dinâmica do manipulador em estudo e, de outro, restrições cinemáticas e dinâmicas, determinadas por meio das características operacionais dos servoposicionadores pneumáticos. Os resultados mostram que a metodologia proposta é adequada para tarefas de manipulação de peças na presença de obstáculos, uma vez que os pontos intermediários situam-se fora da região de colisão nos três casos aqui apresentados. Além disso, quanto à segunda etapa, observou-se que as trajetórias de 5º e 7º grau apresentaram resultados similares, de maneira que os erros obtidos poderiam ser melhorados analisando aspectos associados ao controlador do robô em estudo. / The thesis presents a study for collision-free trajectory planning for a pneumatic robot with 5 degrees of freedom applying three metaheuristic algorithms: firefly metaheuristic algorithm, particle swarm optimization and genetic algorithms. As regards the application of metaheuristic algorithms to the study of the trajectory planning of manipulating robots in the presence of obstacles, there are different types of techniques to avoid collisions that consider the kinematic and dynamic effects, obtaining trajectories with the optimal time, torque, etc. In this study, contributions are made to the application of these techniques specifically to pneumatic manipulator robots, particularly with regard to the specific characteristics of pneumatic servo-actuators, such as friction modeling of these systems, calculation of equivalent mass, etc. The methodology used is defined in two steps. The first one consists of obtaining intermediate points, acquired considering the smallest distance between the intermediate points and the final point, generated considering the presence of obstacles (cylinders, cubes and spheres) These obstacles are mapped in collision regions, which are constraints to the optimization problem. The second step is based on the study of the trajectory planning: 5th and 7th degree b-splines are applied in the interpolation of the intermediate points, in order to obtain trajectories that consider the smallest actuator force associated to the dynamics of the manipulator and the kinematic and dynamic constraints, determined by the operational characteristics of pneumatic servo-positioners. The results show that the proposed methodology is suitable for tasks of manipulating parts in the presence of obstacles because the intermediate points are outside the collision region in the three cases presented here. In addition, it was observed that the trajectories of 5th and 7th degree presented similar results, so that the errors obtained could be improved by analyzing aspects associated to the controller of the robot.
6

Using a multi-objective cuckoo search algorithm to solve the urban transit routing problem / Användningen av en multi-objektiv cuckoo search algoritm för att optimera kollektivtrafiknät

Ekelöf, Linus January 2021 (has links)
The design of public transportation networks includes the problem of finding efficient transit routes. This problem is called the Urban Transit Routing Problem (UTRP) and it is a highly complex combinatorial optimization problem. Solving the UTRP and finding more efficient transit routes may lead to large cost savings as well as shorter average travel times for the passengers. The most common approach to solving it, in the literature, is with the usage of a metaheuristic algorithm. The purpose of this thesis is to solve the UTRP with such an algorithm, and to make the algorithm efficient. To this end, the multi-objective Discrete Cuckoo Search (MODCS) algorithm is introduced and it solves the UTRP with respect to both passenger and operator objectives. Two network instances are solved for: the common benchmark network of Mandl's network, and the Södertälje bus network. For Mandl's network, the results were compared to other algorithms in the literature. The results showed great performance of the MODCS algorithm with respect to the passenger objective, and not as good with respect to the operator objective. The computation times of the MODCS were higher than those of the other algorithms. For the Södertälje bus network, the MODCS algorithm found route sets with significantly better objective values than those of a previous master thesis algorithm. Furthermore, the average computation times of the MODCS algorithm were much less than those of the previous master thesis algorithm. / Att designa kollektivtrafiknät inkluderar problemet av att hitta effektiva kollektivtrafiklinjer. Detta problem kallas för Urban Transit Routing Problem (UTRP) och det är ett mycket komplext kombinatoriskt optimeringsproblem. Att lösa UTRP och hitta effektivare kollektivtrafiklinjer kan leda till stora besparingar samt lägre genomsnittliga restider för passagerare. Den vanligaste metoden för att lösa problemet, inom litteraturen, är med en metaheuristisk algoritm. Syftet med detta examensarbete är att lösa UTRP med en sådan algoritm samt att göra algoritmen effektiv. Den multiobjektiva diskreta Cuckoo Search (MODCS) algoritmen blev introducerad för att uppnå syftet, och den löste UTRP med avseende på både passagerar- och operatörintressen. Två olika nätverk har lösts: Mandls nätverk som är det vanligaste att jämföra med, och Södertäljes bussnätverk. Resultaten för Mandls nätverk blev jämförda med resultaten av andra algoritmer i litteraturen. MODCS algoritmen hittade linjenät med mycket bra värden för passagerarintresset, men inte lika bra för operatörintresset. Beräkningstiden för MODCS var högre än för de andra algoritmerna. För Södertäljes bussnätverk så hittade MODCS algoritmen linjenät som hade mycket bättre objektiva värden än en algoritm från ett tidigare examensarbete. De genomsnittliga beräkningstiderna var dessutom mycket lägre för MODCS än för algoritmen från det tidigare examensarbetet.

Page generated in 0.0886 seconds