• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.63-82
• /
• 2007

In this paper, we propose an adaptive hybrid genetic algorithm (ahGA) approach for effectively solving multistage-based scheduling problems in flexible manufacturing system (FMS) environment. The proposed ahGA uses a neighborhood search technique for local search and an adaptive scheme for regulation of GA parameters in order to improve the solution of FMS scheduling problem and to enhance the performance of genetic search process, respectively. In numerical experiment, we present two types of multistage-based scheduling problems to compare the performances of the proposed ahGA with conventional competing algorithms. Experimental results show that the proposed ahGA outperforms the conventional algorithms.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.6
• /
• pp.128-136
• /
• 1995

The problem addressed in this paper is that of the on-line computational burden of time-optimal control laws for quick, strongly nonlinear systems like revolute robots. It will be demonstrated that a large amount of off-line computation can be substituted for most of the on-line burden in cases of time optimization with constrained inputs if differential point-to- point specifications can be relaxed to cell-to-cell transitions. These cells result from a coarse discretization of likely swaths of state space into a set of nonuniform, contiguous volumes of relatively simple shapes. The cell boundaries approximate stream surfaces of the phase fluid and surfaces of equal transit times. Once the cells have been designed, the bang- bang schedules for the inputs are determined for all likely starting cells and terminating cells. The scheduling process is completed by treating all cells into which the trajectories might unex- pectedly stray as additional starting cells. Then an efficient-to-compute control law can be based on the resulting table of optimal strategies.

• Journal of Information Processing Systems
• /
• v.9 no.2
• /
• pp.301-314
• /
• 2013

In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network.