This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the literature show that the results obtained by GVNS consistently outperform the best heuristics from the literat...

To operate a cross-dock successfully, an efficient assignment of trucks to docks is one the key decisions. In this paper, we are interested in problem, where number exceeds docks. The objective minimize cost transferring goods within while avoiding delivery penalties. This problem being NP-hard, use Variable Neighborhood Search metaheurisitc (VNS) solve it approximately. More specifically, cond...