InTech - Open Access Publisher

Design of an Efficient Genetic Algorithm to Solve the Industrial Car Sequencing Problem A. Zinflou, C. Gagné and M. Gravel

Bookmark and Share

    Tweet

     

How to Reference

To reference this article in your paper, please copy and paste the following text:

How to Link

To place a link on your website or a blog, please copy and paste the following HTML code:

Related Articles

• Tackling the Industrial Car Sequencing Problem Using GISMOO Algorithm
• Using Simulated Annealing Algorithm to Solve the Optimal Control Problem
• A CMPSO Algorithm Based Approach to Solve the Multi-plant Supply Chain Problem
• Sequential and Simultaneous Algorithms to Solve the Collision-Free Trajectory Planning Problem fo...
• An Efficient Quasi-Human Heuristic Algorithm for Solving the Rectangle-Packing Problem
• Immune-Genetic Algorithm for Traveling Salesman Problem
• A Hybrid Genetic Algorithm for the Re-Entrant Flow-Shop Scheduling Problem
• A Multi-World Genetic Algorithm to Optimize Delivery Problem with Interactive-Time
• The Method of Solving for Traveling Salesman Problem Using Genetic Algorithm with Immune Adjustme...
• Solving the Probabilistic Travelling Salesman Problem Based on Genetic Algorithm with Queen Selec...
• Heuristic Algorithms for Solving Bounded Diameter Minimum Spanning Tree Problem and Its Applicati...
• A Metaheuristic Approach to Solve the Alternative Subgraphs Assembly Line Balancing Problem