Ants can colour graphs
From MaRDI portal
Publication:4367017
Recommendations
Cited in
(37)- A new ant colony optimization algorithm for the lower bound of sum coloring problem
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- ROUTING IN OPTICAL MULTISTAGE NETWORKS WITH LIMITED CROSSTALK USING ANT COLONY OPTIMIZATION
- Ant colony optimization for the cell assignment problem in PCS networks
- Graph based twin cost matrices for unbalanced assignment problem with improved ant colony algorithm
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- New approaches to evaporation in ant colony optimization algorithms
- scientific article; zbMATH DE number 1706198 (Why is no real title available?)
- Ant colony optimization theory: a survey
- A framework for the description of evolutionary algorithms
- An ant-based algorithm for coloring graphs
- A survey of search methodologies and automated system development for examination timetabling
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- Ant colony optimization for the traveling purchaser problem
- Combinatorial optimization in system configuration design
- scientific article; zbMATH DE number 1784918 (Why is no real title available?)
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- Graph colouring approaches for a satellite range scheduling problem
- Optimization by ant algorithms: possible roles for an individual ant
- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
- An improved ant colony optimisation heuristic for graph colouring
- Time dependent vehicle routing problem with a multi ant colony system
- Ant local search and its efficient adaptation to graph colouring
- Ant colony optimization for continuous domains
- USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Improving the extraction and expansion method for large graph coloring
- Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions
- Optimization of the keyboard arrangement problem using an ant colony algorithm.
- ACS-TS: Train scheduling using ant colony system
- Evolutionary computational technique in automatic generation control of multi-area power systems with nonlinearity and energy storage unit
- Experience-based ant coloring (EAC). A new ant-like graph-coloring algorithm
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- A modified ant colony system for solving the travelling salesman problem with time windows
- An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions
- An ant colony system for permutation flow-shop sequencing
- Informed reactive tabu search for graph coloring
This page was built for publication: Ants can colour graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367017)
