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

DOI10.1111/ITOR.12153zbMATH Open1338.90380OpenAlexW2071082401MaRDI QIDQ2806437FDOQ2806437

Authors Jaqueline S. Angelo, Helio J. C. Barbosa 

Publication date 18 May 2016

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12153

zbMATH Keywords

differential evolutionbilevel optimizationant-colony optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30)

Recommendations

• Solving bilevel programming problems with multicriteria optimization techniques
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A method for solving bilevel linear programming problems
• scientific article; zbMATH DE number 817607
• Bilevel programming: a survey
• scientific article; zbMATH DE number 35514
• A bilevel bottleneck programming problem
• An algorithm for the mixed-integer nonlinear bilevel programming problem
• scientific article; zbMATH DE number 1559437

Cites Work

• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• A bi-level programming model and solution algorithm for the location of logistics distribution centers
• A bilevel model of taxation and its application to optimal highway pricing
• A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
• Bilevel linear programming
• Bilevel model for production-distribution planning solved by using ant colony optimization
• Branch-and-bound algorithm for a competitive facility location problem
• Computational Difficulties of Bilevel Linear Programming
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Mathematical Programs with Optimization Problems in the Constraints
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Solution of a truss topology bilevel programming problem by means of an inexact restoration method
• Solving dual problems using a coevolutionary optimization algorithm

Cited In (13)

• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
• Robust bi-level optimization of relief logistics operations
• Metaheuristics for bilevel optimization: a comprehensive review
• An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach
• A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand
• Coordinating harvest planning and scheduling in an agricultural supply chain through a stochastic bilevel programming
• Focus programming: a bi‐level programming approach to static stochastic optimization problems
• A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information
• Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Approximate bilevel optimization with population-based evolutionary algorithms
• Bilevel `defender-attacker' model with multiple attack scenarios
• New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm

Uses Software

• Genocop

This page was built for publication: A study on the use of heuristics to solve a bilevel programming problem

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