Computational Experiments on Metaheuristic Techniques for Combinatorial Problems

Simple item page
dc.contributor.authorKommadath, Remya
dc.date.accessioned2025-03-11T05:32:18Z
dc.date.available2025-03-11T05:32:18Z
dc.date.issued2024
dc.descriptionSupervisor: Kotecha, Prakash
dc.description.abstractThis thesis investigates the application of metaheuristic techniques in addressing single and multi-objective combinatorial optimization problems, focusing on the essential role of efficient solution strategies. Firstly, this thesis underscores the importance of meticulously designed solution frameworks through an in-depth analysis of three specific combinatorial optimization problems: production planning of a petrochemical industry, scheduling jobs on dissimilar parallel machines, and optimization of a compression-absorption cascaded refrigeration system. The thesis also addresses the limitations of metaheuristic techniques in solving computationally expensive problems by proposing variants that leverage parallel computing architectures. Additionally, this work emphasizes the necessity of precise implementations of metaheuristic techniques to ensure optimal effectiveness in their application.
dc.identifier.otherROLL NO.146107042
dc.identifier.urihttps://gyan.iitg.ac.in/handle/123456789/2819
dc.language.isoen
dc.relation.ispartofseriesTH-3507
dc.titleComputational Experiments on Metaheuristic Techniques for Combinatorial Problems
dc.typeThesis
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
Abstract-TH-3507_146107042.pdf
Size:
115.62 KB
Format:
Adobe Portable Document Format
Description:
ABSTRACT
Download
No Thumbnail Available
Name:
TH-3507_146107042.pdf
Size:
17.51 MB
Format:
Adobe Portable Document Format
Description:
THESIS
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download
Collections
PhD Theses (Chemical Engineering)