Solution of the cumulative assignment problem with a well-structured tabu search method

DOI10.1023/A:1009647225748zbMath0938.90047OpenAlexW1576274444MaRDI QIDQ1806772

Andrea Lodi, Francesco Maffioli, Mauro Dell'Amico

Publication date: 8 November 1999

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009647225748

zbMATH Keywords

metaheuristicstabu searchlinear assignmentcumulative functions

Mathematics Subject Classification ID

Search theory (90B40) Discrete location and assignment (90B80)

Related Items

Hybrid Metaheuristics: An Introduction, A branch-and-cut method for the obnoxious \(p\)-median problem, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Local search algorithms for the \(k\)-cardinality tree problem., Comparing metaheuristic algorithms for SONET network design problems, Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care