Improving Benders decomposition using a genetic algorithm
From MaRDI portal
Publication:1042103
DOI10.1016/j.ejor.2008.10.033zbMath1176.90428OpenAlexW1985028263MaRDI QIDQ1042103
C. A. Poojari, John E. Beasley
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.10.033
Related Items
Boosting an exact logic-based Benders decomposition approach by variable neighborhood search, Decomposition based hybrid metaheuristics, Pre-positioning disaster response facilities at safe locations: an evaluation of deterministic and stochastic modeling approaches, Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach, Decomposition-based algorithms for the crew scheduling and routing problem in road restoration, Multiple allocation tree of hubs location problem for non-complete networks, Set covering heuristics in a benders decomposition for railway timetabling, Accelerating Benders decomposition: multiple cuts via multiple solutions, An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation, An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions, Solution of preemptive multi-objective network design problems applying Benders decomposition method, The Benders Dual Decomposition Method, Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, The Benders decomposition algorithm: a literature review, Scheduling medical residents' training at university hospitals, Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
Uses Software
Cites Work
- Unnamed Item
- Large-scale mixed integer programming: Benders-type heuristics
- Partitioning procedures for solving mixed-variables programming problems
- An efficient constraint handling method for genetic algorithms
- Genetic algorithm based technique for solving chance constrained problems
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Constraint handling in genetic algorithms: the set partitioning problem
- The feasibility pump
- Accelerating Benders Decomposition by Local Branching
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
- Search Methodologies
- Feature Article—Genetic Algorithms for the Operations Researcher
