Facets of the three-index assignment polytope
Discrete Applied Mathematics
An algorithm for the three-index assignment problem
Operations Research
Modern heuristic techniques for combinatorial problems
The delivery man problem and cumulative matroids
Operations Research
Three-dimensional axial assignment problems with decomposable cost coefficients
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
The k-cardinality assignment problem
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
New bounds for optimum traffic assignment in satellite communication
Computers and Operations Research
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Local search algorithms for the k-cardinality tree problem
Discrete Applied Mathematics
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Comparing Metaheuristic Algorithms for Sonet Network Design Problems
Journal of Heuristics
A tabu search algorithm for the routing and capacity assignment problem in computer networks
Computers and Operations Research
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
Computers and Operations Research
Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications
Transportation Science
| Hi-index | 0.00 |
The Cumulative Assignment Problem is an NP-complete problemobtained by substituting the linear objective function of the classic LinearAssignment Problem, with a non-linear cumulative function. In this paper wepresent a first attempt to solve the Cumulative Assignment Problem withmetaheuristic techniques. In particular we consider two standard techniques,namely the Simulated Annealing and the Multi-Start methods, and we describe theeXploring Tabu Search: a new structured Tabu Search algorithm which uses an iterative multi-level approach to improve the search. The new method is analyzed through extensive computational experiments and proves to be more effective thanthe standard methods.