Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication Year
- Publication
- Publication Type
Articles 1 - 12 of 12
Full-Text Articles in Physical Sciences and Mathematics
Hybrid Tabu Search Algorithm For Unrelated Parallel Machine Scheduling In Semiconductor Fabs With Setup Times, Job Release, And Expired Times, Changyu Chen, Madhi Fathi, Marzieh Khakifirooz, Kan Wu
Hybrid Tabu Search Algorithm For Unrelated Parallel Machine Scheduling In Semiconductor Fabs With Setup Times, Job Release, And Expired Times, Changyu Chen, Madhi Fathi, Marzieh Khakifirooz, Kan Wu
Research Collection School Of Computing and Information Systems
This research is motivated by a scheduling problem arising in the ion implantation process of wafer fabrication. The ion implementation scheduling problem is modeled as an unrelated parallel machine scheduling (UPMS) problem with sequence-dependent setup times that are subject to job release time and expiration time of allowing a job to be processed on a specific machine, defined as: R|rj,eij,STsd|Cmax. The objective is first to maximize the number of processed jobs, then minimize the maximum completion time (makespan), and finally minimize the maximum completion times of the non-bottleneck machines. A mixed-integer programming (MIP) model is proposed as a solution approach …
Parameter Identification Of Induction Motor Based On Tabu-Chaotic Firefly Algorithm, Xiaoyang Xu, Wang Yan, Zhicheng Ji
Parameter Identification Of Induction Motor Based On Tabu-Chaotic Firefly Algorithm, Xiaoyang Xu, Wang Yan, Zhicheng Ji
Journal of System Simulation
Abstract: In order to overcome the defects of traditional induction motor parameter identification methods such as identifying less parameters simultaneously and Low identification accuracy. A multi-parameters identification method based on Tabu-chaotic Firefly Algorithm was proposed. The proposed method can simultaneously identify the stator resistance, stator inductance, rotor time constant and mutual inductance without prior knowledge about the parameters. For the sake of improving the identification accuracy, the formula of attractiveness in original Firefly Algorithm was adjusted, furthermore chaos theory and the idea of Tabu Search was integrated into the algorithm. Simulatied experimental results demonstrate that compared to the other …
A Metaheuristic Based On The Tabu Search For Hardware-Software Partitioning, Mehdi Jemai, Sonia Dimassi, Bouraoui Ouni, Abdellatif Mtibaa
A Metaheuristic Based On The Tabu Search For Hardware-Software Partitioning, Mehdi Jemai, Sonia Dimassi, Bouraoui Ouni, Abdellatif Mtibaa
Turkish Journal of Electrical Engineering and Computer Sciences
Several metaheuristics have become increasingly interesting in solving combinatorial problems. In this paper, we present an algorithm involving a metaheuristic based on tabu search and binary search trees to address the problem of hardware-software partitioning. Metaheuristics do not guarantee an optimum solution, but they can produce acceptable solutions in a reasonable time. Our proposed algorithm seeks to find the efficient hardware-software partitioning that minimizes the logic area of a system on a programmable chip under the condition of time constraints. Our goal is to have a better trade-off between the logic area of the application and its execution time. Finally, …
Designing And Comparing Multiple Portfolios Of Parameter Configurations For Online Algorithm Selection, Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir
Designing And Comparing Multiple Portfolios Of Parameter Configurations For Online Algorithm Selection, Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir
Research Collection School Of Computing and Information Systems
Algorithm portfolios seek to determine an effective set of algorithms that can be used within an algorithm selection framework to solve problems. A limited number of these portfolio studies focus on generating different versions of a target algorithm using different parameter configurations. In this paper, we employ a Design of Experiments (DOE) approach to determine a promising range of values for each parameter of an algorithm. These ranges are further processed to determine a portfolio of parameter configurations, which would be used within two online Algorithm Selection approaches for solving different instances of a given combinatorial optimization problem effectively. We …
Designing A Portfolio Of Parameter Configurations For Online Algorithm Selection, Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir
Designing A Portfolio Of Parameter Configurations For Online Algorithm Selection, Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir
Research Collection School Of Computing and Information Systems
Algorithm portfolios seek to determine an effective set of algorithms that can be used within an algorithm selection framework to solve problems. A limited number of these portfolio studies focus on generating different versions of a target algorithm using different parameter configurations. In this paper, we employ a Design of Experiments (DOE) approach to determine a promising range of values for each parameter of an algorithm. These ranges are further processed to determine a portfolio of parameter configurations, which would be used within two online Algorithm Selection approaches for solving different instances of a given combinatorial optimization problem effectively. We …
Simulated Annealing Algorithm-Based Elman Network For Dynamic System Identification, Adem Kalinli
Simulated Annealing Algorithm-Based Elman Network For Dynamic System Identification, Adem Kalinli
Turkish Journal of Electrical Engineering and Computer Sciences
One of the well-known recurrent neural networks is the Elman network. Recently, it has been used in applications of system identification. The network has feedforward and feedback connections. It can be trained essentially as a feedforward network by means of the basic backpropagation algorithm, but its feedback connections have to be kept constant. For training success, it is important to select the correct values for the feedback connections. However, finding these values manually can be a lengthy trial-and-error process. This paper investigates the use of the simulated annealing (SA) algorithm to obtain the weight values of both the feedforward and …
A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem
A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem
Engineering Management & Systems Engineering Faculty Publications
In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequence- and machine- dependent setup times to minimize the schedules makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm uses two phases of perturbation schemes: the intra-machine perturbation, which optimizes the sequence of jobs on the machines, and the inter-machine perturbation, which balances the assignment of the jobs to the machines. We compare the proposed algorithm to an existing one that addressed the …
A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan
A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan
Research Collection School Of Computing and Information Systems
Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well- designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that …
Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim
Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim
Research Collection School Of Computing and Information Systems
This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.
Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang
Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang
Research Collection School Of Computing and Information Systems
In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon' s benchmark test cases for VRPTW. Experimental results show that our approach yields very …
Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang
Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang
Research Collection School Of Computing and Information Systems
In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon's benchmark test cases for VRPTW. Experimental results show that our approach yields very good …
A Simple Formula Obtained Using Tabu Search Algorithm For The Radiation Efficiency Of A Resonant Rectangular Microstrip Antenna, Dervi̇ş Karaboğa, Keri̇m Güney
A Simple Formula Obtained Using Tabu Search Algorithm For The Radiation Efficiency Of A Resonant Rectangular Microstrip Antenna, Dervi̇ş Karaboğa, Keri̇m Güney
Turkish Journal of Electrical Engineering and Computer Sciences
A new simple formula for the radiation efficiency of a resonant rectangular microstrip patch antenna is presented. The formula is obtained by using a tabu search algorithm, which is a quite new optimization technique based on the principles of intelligent problem solving. The formula is valid for substrates with relative permittivities between 1 and 12.8 and for the complete range of thicknesses normally used. The results obtained by using this new simple formula are in conformity with those reported elsewhere. The formula can also be used in the calculation of the radiation efficiency of dipoles.