A study on the use of heuristics to solve a bilevel programming problem

• DOI: 10.1111/itor.12153
• Publication Date: 2015-01-30T21:05:04Z
• Authors: Jaqueline S. Angelo; Helio J. C. Barbosa
• Keywords: Bilevel optimization; Heuristics

Abstract The bilevel programming problem is characterized as an optimization that has another in its constraints. leader the upper level and follower lower are hierarchically related where leader's decisions affect both follower's payoff function allowable actions, vice versa. One difficulty arises solving problems unless a solution optimal for problem, it cannot be feasible overall problem. This suggests approximate methods could not used they do guarantee actually found. However, from practical point of view near‐optimal solutions often acceptable, especially when too costly to exactly solved thus rendering use exact impractical. In this paper, we study impact using method discussing how on can objective values. considers production‐distribution planning by two intelligent heuristics related: ant colony differential evolution solve