heuristic finds optimal solutions for all test problems that can be solved exactly by a branch-and-cut algorithm, while running … exactly, the tabu search algorithm outperforms the best local search heuristic currently available. The performance gap …

Sequential meta-heuristic implementations for the irregular stock-cutting problem have highlighted a number of common …

The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the vehicle routing problem with …

This paper presents a tabu-search heuristic for the capacitated lot-sizing problem (CLSP) with set-up carryover. This …-search heuristic consists of five basic move types---three for the sequencing decisions and two for the lot-sizing decisions. We allow … dynamic tabu list, adaptive memory, and self-adjusting penalties, to strengthen our heuristic. We also propose a lower …

indicate that the algorithm may be a good alternative to the best heuristic algorithms for the VRP. …

special challenges for the optimization methods; an heuristic sequential network assignment was developed for certified …

describes a branch and bound algorithm which in many cases is faster than the well-known Hoffmann heuristic technique to which … achieve rapid solutions. It is combined with the Hoffmann heuristic to develop an even more effective system for solving SALB …