We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated vehicle routing problem (CVRP), the multi-depot vehicle routing problem (MDVRP), the site-dependent vehicle routing problem (SDVRP) and the open vehicle routing problem (OVRP). All problemvariants are transformed int...

We propose a metaheuristic algorithm for the multi-resource generalizedassignment problem (MRGAP). MRGAP is a generalization of the generalized assignmentproblem, which is one of the representative combinatorial optimization problems knownto be NP-hard. The algorithm features a very large-scale neighborhood search, which is amechanism of conducting the search with complex and po...

We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various application contexts such as logistics and transportation, timetabling, and resource allocation for cloud computing. We introduce O(1) evaluation proce...

Neighborhood search algorithms are a wide class of improvement algorithms where at each iteration an improving solution is found by searching the “neighborhood” of the current solution. This paper discusses neighborhood search algorithms where the size of the neighborhood is “very large” with respect to the size of the input data. For large problem instances, it is impractical to search these n...