Abstract
Genetic algorithms have become increasingly important for researchers in resolving difficult problems because they can provide feasible solutions in limited time. Using genetic algorithms to solve a problem involves first defining a representation that describes the problem states. Most previous studies have adopted one-dimensional representation. Some real problems are, however, naturally suitable to two-dimensional representation. Therefore, a two-dimensional encoding representation is designed and the traditional genetic algorithm is modified to fit the representation. Particularly, appropriate two-dimensional crossover and mutation operations are proposed to generate candidate chromosomes in the next generations. A two-dimensional repairing mechanism is also developed to adjust infeasible chromosomes to feasible ones. Finally, the proposed approach is used to solve the scheduling problem of assigning aircrafts to a time table in an airline company for demonstrating the effectiveness of the proposed genetic algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
