The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization – Part II: Exploiting Reaction and Resistance
Abstract
Recent metaheuristics for mixed integer programming have included proposals for introducing inequalities and target objectives to guide this search. These guidance approaches are useful in intensification and diversification strategies related to fixing subsets of variables at particular values. The authors’ preceding Part I study demonstrated how to improve such approaches by new inequalities that dominate those previously proposed. In Part II, the authors review the fundamental concepts underlying weighted pseudo cuts for generating guiding inequalities, including the use of target objective strategies. Building on these foundations, this paper develops a more advanced approach for generating the target objective based on exploiting the mutually reinforcing notions of reaction and resistance. The authors demonstrate how to produce new inequalities by “mining” reference sets of elite solutions to extract characteristics these solutions exhibit in common. Additionally, a model embedded memory is integrated to provide a range of recency and frequency memory structures for achieving goals associated with short term and long term solution strategies. Finally, supplementary linear programming models that exploit the new inequalities for intensification and diversification are proposed.
Related Content
|
Pawan Kumar, Mukul Bhatnagar, Sanjay Taneja.
© 2024.
26 pages.
|
|
Kapil Kumar Aggarwal, Atul Sharma, Rumit Kaur, Girish Lakhera.
© 2024.
19 pages.
|
|
Mohammad Kashif, Puneet Kumar, Sachin Ghai, Satish Kumar.
© 2024.
15 pages.
|
|
Manjit Kour.
© 2024.
13 pages.
|
|
Sanjay Taneja, Reepu.
© 2024.
19 pages.
|
|
Jaspreet Kaur, Ercan Ozen.
© 2024.
28 pages.
|
|
Hayet Kaddachi, Naceur Benzina.
© 2024.
25 pages.
|
|
|