STAR Heuristic Method: A Novel Approach and Its Comparative Analysis with CI Algorithm to Solve CBAP in Healthcare

DOI10.1201/9781003329039-10MaRDI QIDQ6189040zbMATH OpenOpenAlexFDO

Authors Anand J. Kulkarni

Publication date 12 January 2024

Published in Combinatorial Optimization Under Uncertainty (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1201/9781003329039-10

zbMATH Keywords

Cyclic Bottleneck Assignment Problem, minimum intermediate column sum

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Tabu search and iterated local search for the cyclic bottleneck assignment problem
• Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems
• Comparison of tabu/2-opt heuristic and optimal tree search method for assignment problems
• Cyclic Surgery Scheduling using Variations of Cohort Intelligence
• A scenario-based robust optimization with a pessimistic approach for nurse rostering problem

Cited in

(1)

• Cyclic Surgery Scheduling using Variations of Cohort Intelligence

This page was built for publication: STAR Heuristic Method: A Novel Approach and Its Comparative Analysis with CI Algorithm to Solve CBAP in Healthcare

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6189040)