We propose local search algorithms for the vehicle routing problem with soft time window constraints. The time window constraint for each customer is treated as a penalty function, which is very… (More)
Number partitioning is a classical NP-hard combinatorial optimization problem, whose solution is challenging for both exact and approximative methods. This work presents a new algorithm for number… (More)
In this paper, we present a variant of local search, namely the Life Span Method (LSM), for generic combinatorial optimization problems. The LSM can be seen as a variation of tabu search introduced… (More)
The vehicle routing problem with time windows (VRPTW) is the problem to minimize the sum of the distances traveled by a fixed number of vehicles, which visit every customer exactly once under… (More)
Valve-point loading affects the input-output characteristics of generating units, bringing the fuel costs nonlinear and nonsmooth. This has been considered in the solution of load dispatch problems,… (More)
The shortest path problem is one of the most fundamental problems in computer science. Although several quasi linear time algorithms have been proposed, even an optimal algorithm does not terminate… (More)
This paper presents an algorithm for the scanchain optimization problem in multiple-scan design methodology. The proposed algorithm, which consists of four phases, first determines pairs of scan-in… (More)
The vehicle routing and facility location fields are well-developed areas in management science and operations research application. There is an increasing recognition that effective decision-making… (More)
This paper presents a mathematical programming formulation for lot sizing that is inspired from tire production practice. A mixed-integer programming based fix-and-relax heuristic approach is… (More)