The computational complexity of simultaneous diophantine approximation problems
SIAM Journal on Computing
The vehicle routing problem
Iterated Greedy Algorithms for a Real-World Cyclic Train Scheduling Problem
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Beam-ACO applied to assembly line balancing
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
| Hi-index | 0.00 |
A parametrized greedy heuristic (pgreedy) is a hybridization of a classical greedy construction heuristic with a parametrized scoring function and improving hit-and-run, a concept from the field of Global Optimization for automated parameter selection. In this article we introduce this new metaheuristic concept and apply it to a real-world planning problem: the integrated coordination of school starting times and public transport in rural areas.