A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
From MaRDI portal
Publication:1013410
DOI10.1016/j.cor.2008.09.004zbMath1158.90415OpenAlexW2156051492WikidataQ56212225 ScholiaQ56212225MaRDI QIDQ1013410
Publication date: 17 April 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/11334/1/Lewis%2C_R_General_Purpose_Hill_Climbing.pdf
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Towards objective measures of algorithm performance across instance space ⋮ A grouping genetic algorithm with controlled gene transmission for the bin packing problem ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ An investigation into two bin packing problems with ordering and orientation implications ⋮ A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ Grouping evolution strategies: an effective approach for grouping problems ⋮ On the application of graph colouring techniques in round-robin sports scheduling ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach ⋮ A 3/2-approximation for big two-bar charts packing ⋮ Two-bar charts packing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- Recent advances on two-dimensional bin packing problems
- Lower bounds and reduction procedures for the bin packing problem
- Graph coloring with adaptive evolutionary algorithms
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- A robust simulated annealing based examination timetabling system.
- A variable neighborhood search for graph coloring.
- Applications of evolutionary computing. EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002. Proceedings
- Variants of simulated annealing for the examination timetabling problem
- Hybrid evolutionary algorithms for graph coloring
- An improved ant colony optimisation heuristic for graph colouring
- Neighborhood portfolio approach for local search applied to timetabling problems
- Heuristic solution of open bin packing problems
- On method overfitting
- Using an Incomplete Version of Dynamic Backtracking for Graph Colouring
- Almost all k-colorable graphs are easy to color
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- A graph coloring algorithm for large scheduling problems
- New methods to color the vertices of a graph
- Ants can colour graphs
- A Column Generation Approach for Graph Coloring
- Ant colony optimization and local search for bin packing and cutting stock problems
- Chromatic Scheduling and the Chromatic Number Problem
- 25 pretty graph colouring problems
- A study of permutation operators for minimum span frequency assignment using an order based representation
