Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
From MaRDI portal
Publication:932221
DOI10.1016/j.ejor.2007.04.037zbMath1157.90357MaRDI QIDQ932221
Publication date: 10 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.04.037
90C59: Approximation methods and heuristics in mathematical programming
90B20: Traffic problems in operations research
Related Items
CP with ACO, Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions, The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem, USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ant colony system with communication strategies
- On the complexity of the car sequencing problem.
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
- Two local search approaches for solving real-life car sequencing problems
- A comparative study of ant colony optimization and reactive search for graph matching problems
- An improved ant system algorithm for the vehicle routing problem
- Multi colony ant algorithms
- A study of ACO capabilities for solving the maximum clique problem
- Ant colonies for the quadratic assignment problem
- Review and comparison of three methods for the solution of the car sequencing problem
- Evolutionary Computation in Combinatorial Optimization
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
