Improving benders decomposition using a genetic algorithm-Reference-Cited by-同舟云学术

Improving benders decomposition using a genetic algorithm

Published:2009-11 Issue:1 Volume:199 Page:89-97
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Poojari C.A.,Beasley J.E.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference21 articles.

1. Improving the feasibility pump;Achterberg;Discrete Optimization,2007

2. A new adaptive penalty scheme for genetic algorithms;Barbosa;Information Sciences,2003

3. Population heuristics;Beasley,2002

4. Partitioning procedures for solving mixed-variables programming problems;Benders;Numerische Mathematik,1962

5. A feasibility pump heuristic for general mixed-integer problems;Bertacco;Discrete Optimization,2007

Cited by 62 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Truck-drone joint path planning for post-disaster emergency material deployment considering fairness;International Journal of Industrial Engineering Computations;2024

2. Set covering heuristics in a Benders decomposition for railway timetabling;Computers & Operations Research;2023-11

3. A hybrid algorithm for drone routing problem with time windows;2023 IEEE International Conference on Networking, Sensing and Control (ICNSC);2023-10-25

4. A machine learning based branch-cut-and-Benders for dock assignment and truck scheduling problem in cross-docks;Transportation Research Part E: Logistics and Transportation Review;2023-10

5. A matheuristic approach for the family traveling salesman problem;Journal of Heuristics;2023-09-22