Deadlock-free scheduling method using genetic algorithm and timed S/sup 3/PR nets

2004 ◽  
Author(s):  
Zhonghua Huang ◽  
Zhiming Wu
Keyword(s):  
Genetic Algorithm ◽  
Scheduling Method

scholarly journals A Building-Block-Based Genetic Algorithm for Solving the Robots Allocation Problem in a Robotic Mobile Fulfilment System

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Jingtian Zhang ◽  
Fuxing Yang ◽  
Xun Weng
Keyword(s):  
Genetic Algorithm ◽  
Dynamic Scheduling ◽  
Building Blocks ◽  
Allocation Problem ◽  
Accurate Analysis ◽  
Allocation Problems ◽  
Scheduling Method ◽  
Project Scheduling Problem ◽  
Block Based ◽  
Better Than

Robotic mobile fulfilment system (RMFS) is an efficient and flexible order picking system where robots ship the movable shelves with items to the picking stations. This innovative parts-to-picker system, known as Kiva system, is especially suited for e-commerce fulfilment centres and has been widely used in practice. However, there are lots of resource allocation problems in RMFS. The robots allocation problem of deciding which robot will be allocated to a delivery task has a significant impact on the productivity of the whole system. We model this problem as a resource-constrained project scheduling problem with transfer times (RCPSPTT) based on the accurate analysis of driving and delivering behaviour of robots. A dedicated serial schedule generation scheme and a genetic algorithm using building-blocks-based crossover (BBX) operator are proposed to solve this problem. The designed algorithm can be combined into a dynamic scheduling structure or used as the basis of calculation for other allocation problems. Experiment instances are generated based on the characteristics of RMFS, and the computation results show that the proposed algorithm outperforms the traditional rule-based scheduling method. The BBX operator is rapid and efficient which performs better than several classic and competitive crossover operators.

Research of Flexible Dynamic Scheduling Problem Based on Genetic Algorithm

2009 ◽  
Vol 16-19 ◽  
pp. 743-747
Author(s):  
Yu Wu ◽  
Xin Cun Zhuang ◽  
Cong Xin Li
Keyword(s):  
Genetic Algorithm ◽  
Flexible Manufacturing ◽  
Manufacturing Systems ◽  
Dynamic Scheduling ◽  
Scheduling Problem ◽  
Static Scheduling ◽  
Coding Method ◽  
Scheduling Method ◽  
Distribution Principle ◽  
Working Procedure

Solve the flexible dynamic scheduling problem by using “dynamic management & static scheduling” method. Aim at the property of flexible Manufacturing systems, the dynamic scheduling methods are analyzed and a coding method based on working procedure is improved in this paper. Thus it can be efficiently solve the problem of multiple working routes selection under the active distribution principle. On the other hand, the self-adaptive gene is provided and the parameters of the genetic algorithm are defined. In such a solution, the scheduling is confirmed to be simple and efficient.

Optimizing the Operation Sequence of Chip Shooter Machine Based on the Particle Swarm Optimization Algorithm

2012 ◽  
Vol 220-223 ◽  
pp. 1271-1276
Author(s):  
Wan Lei Liang ◽  
Xiao Dan Guan
Keyword(s):  
Genetic Algorithm ◽  
Pso Algorithm ◽  
Experimental Result ◽  
Coding System ◽  
Simulation Test ◽  
Before And After ◽  
Key Factor ◽  
Genetic Algorithm Method ◽  
Scheduling Method ◽  
The Cost

The mounting process is the key factor of the placement efficiency, it is also important for the improvement of the efficiency of whole production line and decrease of the cost. This paper analyzed the mounting process of the Chip Shooter machine, applied the PSO algorithm, constructed the corresponding coding system, proposed the corresponding particle update mechanism, introduced the partially matched crossover idea of the genetic algorithm into the PSO algorithm, and designed the new re-scheduling method of feeder position assignment to optimize the position assignment of feeders and the pickup and placement sequence of components, thus improved the placement efficiency. After comparing the results before and after the simulation test for selected 8 pieces of PCB, the average efficiency of this algorithm is 7.09% higher than genetic algorithm method that is based on sort encoding. The experimental result shows that, this algorithm is more efficiency on the improvement placement efficiency and decrease of the placement time for the chip shooter machine.

An optimization model for workgroup-based repetitive scheduling

2006 ◽  
Vol 33 (9) ◽  
pp. 1172-1194 ◽  
Author(s):  
Rong-yau Huang ◽  
Kuo-Shun Sun
Keyword(s):  
Genetic Algorithm ◽  
Optimization Model ◽  
Construction Projects ◽  
Optimal Solution ◽  
Planning And Scheduling ◽  
Construction Scheduling ◽  
Chromosome Representation ◽  
Scheduling Method ◽  
Model Formation ◽  
System Project

Most construction repetitive scheduling methods developed so far have been based on the premise that a repetitive project is comprised of many identical production units. Recently, Huang and Sun (2005) developed a workgroup-based repetitive scheduling method that takes the view that a repetitive construction project consists of repetitive activities of workgroups. Instead of repetitive production units, workgroups with repetitive or similar activities in a repetitive project are identified and employed in the planning and scheduling. The workgroup-based approach adds more flexibility to the planning and scheduling of repetitive construction projects and enhances the effectiveness of repetitive scheduling. This work builds on previous research and develops an optimization model for workgroup-based repetitive scheduling. A genetic algorithm (GA) is employed in model formation for finding the optimal or near-optimal solution. A chromosome representation, as well as specification of other parameters for GA analysis, is described in the paper. Two sample case studies, one simple and one sewer system project, are used for model validation and demonstration. Results and findings are reported.Key words: construction scheduling, repetitive project, workgroup, optimization, genetic algorithm.

scholarly journals A new model for logistic and transportation of fashion goods in the presence of stochastic market demands considering restricted retailers capacity

2019 ◽  
Author(s):  
Aidin Delgoshaei ◽  
Hengameh Norozi ◽  
Abolfazl Mirzazadeh ◽  
Maryam Farhadi ◽  
Golnaz Hooshmand Pakdel ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Case Studies ◽  
Programming Model ◽  
Real Data ◽  
Objective Functions ◽  
Mathematical Programming Model ◽  
Multi Objective ◽  
Scheduling Method ◽  
Stochastic Market

In today’s world, using fashion goods is a vital of human. In this research, we focused on developing a scheduling method for distributing and selling fashion goods in a multi-market/multi-retailer supply chain while the product demands in markets are stochastic. For this purpose, a new multi-objective mathematical programming model is developed where maximizing the profit of selling fashion goods and minimizing delivering time and customer’s dissatisfaction are considered as objective functions. In continue due to the complexity of the problem, a number of metaheuristics are compared and a hybrid of Non-dominated Sorting Genetic Algorithm II (NSGAII) and simulated annealing is selected for solving the case studies. Then, in order to find the best values for input parameters of the algorithm, a Taguchi method is applied. In continue, a number of case studies are selected from literature review and solved by the algorithm. The outcomes are analyzed and it is found that using multi-objective models can find more realistic solutions. Then, the model is applied for a case study with real data from industry and outcomes showed that the proposed algorithm can be successfully applied in practice.

scholarly journals Collaborative Optimization of Car-flow Organization for Freight Trains Based on Adjacent Technical Stations

2021 ◽  
Vol 33 (1) ◽  
pp. 117-128
Author(s):  
Yijing Yang ◽  
Xu Wu ◽  
Haonan Li
Keyword(s):  
Genetic Algorithm ◽  
Dwell Time ◽  
Search Algorithm ◽  
Hybrid Genetic Algorithm ◽  
Average Dwell Time ◽  
Collaborative Optimization ◽  
Utilization Rate ◽  
Organization Problem ◽  
Scheduling Method ◽  
Taboo Search Algorithm

This paper proposes a collaborative optimization model of car-flow organization for freight trains based on adjacent technical stations to minimize the average dwell time of train cars in a yard. To solve the car-flow organization problems, a priority-based hump sequence, which depends on the cars available in two adjacent technical stations, is adopted. Furthermore, a meta-heuristic algorithm based on the genetic algorithm and the taboo search algorithm is adopted to solve the model, and the introduction of the active scheduling method improves the efficiency of the algorithm. Finally, the model is applied to the car-flow organization problem of two adjacent technical stations, and the results are compared with those from a single technical station without collaboration. The results demonstrate that collaborative car-flow organization between technical stations significantly reduces the average dwell time at the stations, thereby improving the utilization rate of railroad equipment. In addition, the results indicate that the hybrid genetic algorithm can rapidly determine the train hump and marshalling schemes.

Sign in / Sign up

Export Citation Format

Share Document