A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
From MaRDI portal
Publication:2783880
DOI10.1287/trsc.34.2.133.12308zbMath1004.90045OpenAlexW2150889816MaRDI QIDQ2783880
Jean-François Cordeau, François Soumis, Jacques Desrosiers
Publication date: 17 October 2002
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.34.2.133.12308
Lagrangian relaxationtransportationDantzig-Wolfe decompositionassignmentBenders decompositionbranch-and-bound method
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Decomposition methods (49M27)
Related Items
Hub location problems with price sensitive demands ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ Effective material flow at an assembly facility ⋮ Mathematical formulations for a 1-full-truckload pickup-and-delivery problem ⋮ A SEARCH-BASED APPROACH TO RAILWAY ROLLING STOCK ALLOCATION PROBLEMS ⋮ Solving a real-world train-unit assignment problem ⋮ Circulation of railway rolling stock: a branch-and-price approach ⋮ Integrated approach to network design and frequency setting problem in railway rapid transit systems ⋮ Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain ⋮ Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem ⋮ Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches ⋮ A time-space formulation for the locomotive routing problem at the Canadian National Railways ⋮ Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows ⋮ Robust rolling stock in rapid transit networks ⋮ Speed-up Benders decomposition using maximum density cut (MDC) generation ⋮ Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach ⋮ A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture ⋮ Optimal engineering design via Benders' decomposition ⋮ Estimating the parameters of a fatigue model using Benders' decomposition ⋮ Recovery strategies from major supply disruptions in single and multiple sourcing networks ⋮ Simultaneous frequency and capacity setting for rapid transit systems with a competing mode and capacity constraints ⋮ A Lagrangian heuristic for a train-unit assignment problem ⋮ Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Benders decomposition for set covering problems. Almost satisfying the consecutive ones property ⋮ A general rapid network design, line planning and fleet investment integrated model ⋮ Solving the optimum communication spanning tree problem ⋮ Integration of timetable planning and rolling stock in rapid transit networks ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ Operations Research in passenger railway transportation ⋮ A rolling stock circulation model for combining and splitting of passenger trains ⋮ A Benders decomposition approach for the robust spanning tree problem with interval data ⋮ A new convergent hybrid learning algorithm for two-stage stochastic programs ⋮ Practical enhancements to the Magnanti-Wong method ⋮ The locomotive assignment problem: a survey on optimization models ⋮ Locomotive assignment and freight train scheduling using genetic algorithms ⋮ Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
This page was built for publication: A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
