A GENETIC ALGORITHM FOR THE ECONOMIC MANPOWER SHIFT PLANNING PROBLEM

2014 ◽  
Vol 45 (5) ◽  
pp. 439-464 ◽  
Author(s):  
A. C. Nearchou ◽  
I. C. Giannikos ◽  
A. G. Lagodimos
Author(s):  
Xin-Sheng Ge ◽  
Li-Qun Chen

The motion planning problem of a nonholonomic multibody system is investigated. Nonholonomicity arises in many mechanical systems subject to nonintegrable velocity constraints or nonintegrable conservation laws. When the total angular momentum is zero, the control problem of system can be converted to the motion planning problem for a driftless control system. In this paper, we propose an optimal control approach for nonholonomic motion planning. The genetic algorithm is used to optimize the performance of motion planning to connect the initial and final configurations and to generate a feasible trajectory for a nonholonomic system. The feasible trajectory and its control inputs are searched through a genetic algorithm. The effectiveness of the genetic algorithm is demonstrated by numerical simulation.


2011 ◽  
Vol 127 ◽  
pp. 360-367 ◽  
Author(s):  
Xiao Dong Kang ◽  
Gang Huang ◽  
Xian Li Cao ◽  
Xiang Zhou

This paper takes the five –link concrete pump boom as the research object, and transforms its trajectory planning issue into a multi-object optimization problem. Using intelligent hill climbing algorithm and genetic algorithm, and integrating them closely to ensure real-time online planning for the pump truck effectively, and make the planned motion trajectory for the boom is global optimized under particular constrained conditions. Simulation and performance comparison experiments show that this hybrid algorithm is practical and effective, which offers a new approach for the trajectory planning problem of concrete pump truck.


2021 ◽  
Vol 12 (1) ◽  
pp. 388
Author(s):  
Dany H. Huanca ◽  
Luis A. Gallego ◽  
Jesús M. López-Lezama

This paper presents a modeling and solution approach to the static and multistage transmission network expansion planning problem considering series capacitive compensation and active power losses. The transmission network expansion planning is formulated as a mixed integer nonlinear programming problem and solved through a highly efficient genetic algorithm. Furthermore, the Villasana Garver’s constructive heuristic algorithm is implemented to render the configurations of the genetic algorithm feasible. The installation of series capacitive compensation devices is carried out with the aim of modifying the reactance of the original circuit. The linearization of active power losses is done through piecewise linear functions. The proposed model was implemented in C++ language programming. To show the applicability and effectiveness of the proposed methodology several tests are performed on the 6-bus Garver system, the IEEE 24-bus test system, and the South Brazilian 46-bus test system, presenting costs reductions in their multi-stage expansion planning of 7.4%, 4.65% and 1.74%, respectively.


2013 ◽  
Vol 365-366 ◽  
pp. 194-198 ◽  
Author(s):  
Mei Ni Guo

mprove the existing genetic algorithm, make the vehicle path planning problem solving can be higher quality and faster solution. The mathematic model for study of VRP with genetic algorithms was established. An improved genetic algorithm was proposed, which consist of a new method of initial population and partheno genetic algorithm revolution operation.Exploited Computer Aided Platform and Validated VRP by simulation software. Compared this improved genetic algorithm with the existing genetic algorithm and approximation algorithms through an example, convergence rate Much faster and the Optimal results from 117.0km Reduced to 107.8km,proved that this article improved genetic algorithm can be faster to reach an optimal solution. The results showed that the improved GA can keep the variety of cross and accelerate the search speed.


Robotica ◽  
1998 ◽  
Vol 16 (5) ◽  
pp. 575-588 ◽  
Author(s):  
Andreas C. Nearchou

A genetic algorithm for the path planning problem of a mobile robot which is moving and picking up loads on its way is presented. Assuming a findpath problem in a graph, the proposed algorithm determines a near-optimal path solution using a bit-string encoding of selected graph vertices. Several simulation results of specific task-oriented variants of the basic path planning problem using the proposed genetic algorithm are provided. The results obtained are compared with ones yielded by hill-climbing and simulated annealing techniques, showing a higher or at least equally well performance for the genetic algorithm.


2021 ◽  
Vol 14 (1) ◽  
pp. 55
Author(s):  
Eduardo Guzmán Ortiz ◽  
Beatriz Andres ◽  
Francisco Fraile ◽  
Raul Poler ◽  
Ángel Ortiz Bas

Purpose: The purpose of this paper is to describe the implementation of a Fleet Management System (FMS) that plans and controls the execution of logistics tasks by a set of mobile robots in a real-world hospital environment. The FMS is developed upon an architecture that hosts a routing engine, a task scheduler, an Endorse Broker, a controller and a backend Application Programming Interface (API). The routing engine handles the geo-referenced data and the calculation of routes; the task scheduler implements algorithms to solve the task allocation problem and the trolley loading problem using Integer Linear Programming (ILP) model and a Genetic Algorithm (GA) depending on the problem size. The Endorse Broker provides a messaging system to exchange information with the robotic fleet, while the controller implements the control rules to ensure the execution of the work plan. Finally, the Backend API exposes some FMS to external systems.Design/methodology/approach: The first part of the paper, focuses on the dynamic path planning problem of a set of mobile robots in indoor spaces such as hospitals, laboratories and shopping centres. A review of algorithms developed in the literature, to address dynamic path planning, is carried out; and an analysis of the applications of such algorithms in mobile robots that operate in real in-door spaces is performed. The second part of the paper focuses on the description of the FMS, which consists of five integrated tools to support the multi-robot dynamic path planning and the fleet management.Findings: The literature review, carried out in the context of path planning problem of multiple mobile robots in in-door spaces, has posed great challenges due to the environment characteristics in which robots move. The developed FMS for mobile robots in healthcare environments has resulted on a tool that enables to: (i) interpret of geo-referenced data; (ii) calculate and recalculate dynamic path plans and task execution plans, through the implementation of advanced algorithms that take into account dynamic events; (iii) track the tasks execution; (iv) fleet traffic control; and (v)  to communicate with one another external systems.Practical implications: The proposed FMS has been developed under the scope of ENDORSE project that seeks to develop safe, efficient, and integrated indoor robotic fleets for logistic applications in healthcare and commercial spaces. Moreover, a computational analysis is performed using a virtual hospital floor-plant.Originality/value: This work proposes a novel FMS, which consists of integrated tools to support the mobile multi-robot dynamic path planning in a real-world hospital environment. These tools include: a routing engine that handles the geo-referenced data and the calculation of routes. A task scheduler that includes a mathematical model to solve the path planning problem, when a low number of robots is considered. In order to solve large size problems, a genetic algorithm is also implemented to compute the dynamic path planning with less computational effort. An Endorse broker to exchanges information between the robotic fleet and the FMS in a secure way. A backend API that provides interface to manage the master data of the FMS, to calculate an optimal assignment of a set of tasks to a group of robots to be executed on a specific date and time, and to add a new task to be executed in the current shift. Finally, a controller to ensures that the robots execute the tasks that have been assigned by the task scheduler.


2018 ◽  
Vol 8 (11) ◽  
pp. 2253 ◽  
Author(s):  
Yang Xue

In many areas, such as mobile robots, video games and driverless vehicles, path planning has always attracted researchers’ attention. In the field of mobile robotics, the path planning problem is to plan one or more viable paths to the target location from the starting position within a given obstacle space. Evolutionary algorithms can effectively solve this problem. The non-dominated sorting genetic algorithm (NSGA-II) is currently recognized as one of the evolutionary algorithms with robust optimization capabilities and has solved various optimization problems. In this paper, NSGA-II is adopted to solve multi-objective path planning problems. Three objectives are introduced. Besides the usual selection, crossover and mutation operators, some practical operators are applied. Moreover, the parameters involved in the algorithm are studied. Additionally, another evolutionary algorithm and quality metrics are employed for examination. Comparison results demonstrate that non-dominated solutions obtained by the algorithm have good characteristics. Subsequently, the path corresponding to the knee point of non-dominated solutions is shown. The path is shorter, safer and smoother. This path can be adopted in the later decision-making process. Finally, the above research shows that the revised algorithm can effectively solve the multi-objective path planning problem in static environments.


Sign in / Sign up

Export Citation Format

Share Document