scholarly journals A Benders decomposition algorithm for multi-factory scheduling problem with batch delivery

2017 ◽  
Vol 24 (2) ◽  
pp. 823-833
Author(s):  
N. Karimi ◽  
H. Davoudpour
Keyword(s):  
Benders Decomposition ◽  
Decomposition Algorithm ◽  
Scheduling Problem ◽  
Batch Delivery ◽  
Benders Decomposition Algorithm ◽  
Factory Scheduling

scholarly journals A Benders Decomposition Algorithm for the Passenger Train Service Planning

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Song Pu
Keyword(s):  
High Speed ◽  
Benders Decomposition ◽  
Valid Inequalities ◽  
Service Planning ◽  
Decomposition Algorithm ◽  
Passenger Train ◽  
Railway Line ◽  
Passenger Demand ◽  
Benders Decomposition Algorithm ◽  
Passenger Assignment

Railway transport becomes a more popular transportation in many countries due to its large transport capacity, low energy consumption, and benign environment. The passenger train service planning is the key of the rail operations system to balance the transport service and the passenger demand. In this paper, we propose a mixed binary linear programming formulation for the passenger train service planning to optimize the train route, frequency, stop schedule, and passenger assignment simultaneously. In addition, we analyze the computational complexities of the model and develop a Benders decomposition algorithm with valid inequalities to solve this problem. Finally, our model and algorithm are tested on a real-world instance of the Beijing-Shanghai high-speed railway line. The computational results show that our approach can solve these problems within reasonable solution time and small optimality gaps (less than 2.5%).

Sign in / Sign up

Export Citation Format

Share Document