Scheduling manufacturing systems
Computers in Industry
A heuristic for the pickup and delivery traveling salesman problem
Computers and Operations Research
Network Models and Optimization: Multiobjective Genetic Algorithm Approach
Network Models and Optimization: Multiobjective Genetic Algorithm Approach
A steady-state genetic algorithm for multi-product supply chain network design
Computers and Industrial Engineering
Computers and Industrial Engineering
Hybrid genetic algorithm with adaptive local search scheme
Computers and Industrial Engineering
Genetic algorithm approach for precedence-constrained sequencing problems
Journal of Intelligent Manufacturing
Hi-index | 0.00 |
The objective of precedence-constrained sequencing problem (PCSP) is to locate the optimal sequence with the shortest traveling time among all feasible sequences. Various methods for effectively solving the PCSP have been suggested. This paper proposes a new concept of hybrid genetic algorithm (HGA) with adaptive local search scheme in order that the PCSP should be effectively solved. By the use of the adaptive local search scheme, the local search is automatically adapted into the loop of genetic algorithm. Two types of the PCSP are presented and analyzed to compare the efficiency among the proposed HGA approach and other competing conventional approaches. Finally, it is proved that the proposed HGA approach outperforms the other competing conventional approaches.