A branch-and-price approach for solving the train unit scheduling problem
                        
                        
                            - Submitting institution
 
                            - 
                                The University of Leeds
                                
 
                            
 
                            - Unit of assessment
 
                            - 11 - Computer Science and Informatics
 
                            - Output identifier
 
                            - UOA11-63
 
                            - Type
 
                            - D - Journal article
 
                                - DOI
 
                                - 
                                        10.1016/j.trb.2016.09.007
                                
 
                                - Title of journal
 
                                - Transportation Research Part B: Methodological
 
                                - Article number
 
                                - -
 
                                - First page
 
                                - 97
 
                                - Volume
 
                                - 94
 
                                - Issue
 
                                - -
 
                                - ISSN
 
                                - 0191-2615
 
                                - Open access status
 
                                - Access exception
 
                            - Month of publication
 
                            - September
 
                            - Year of publication
 
                            - 2016
 
                            - URL
 
                            - 
                                    
                                        https://dx.doi.org/10.1016/j.trb.2016.09.007
                                    
                            
 
                            - Supplementary information
 
                            - 
-                            
 
                            - Request cross-referral to
 
                            - -
 
                            - Output has been delayed by COVID-19
 
                            - No
 
                            - COVID-19 affected output statement
 
                            - -
 
                            - Forensic science
 
                            - No
 
                            - Criminology
 
                            - No
 
                            - Interdisciplinary
 
                            - Yes
 
                            - Number of additional authors
 
                            - 
                                1
                            
 
                            - Research group(s)
 
                            - 
                                        
A - AC (Algorithms and Complexity)
                             
                                - Citation count
 
                                - 13
 
                            - Proposed double-weighted
 
                            - No
 
                            - Reserve for an output with double weighting
 
                            - No
 
                            - Additional information
 
                            - Details the novel algorithmic advances in an exact method achieving a practical solver(RS-Opt) for scheduling train units. Extensive industrial collaboration using real datasets and operational rules. Leeds University spinout Tracsis Plc(ICS: UOA11-1)  secured customers for RS-Opt in 2019, with a requirement within an existing multimillion-pound contract to deliver optimised train unit scheduling with a strong emphasis on automation (chris.barnes@tracsis.com(CEO)). Once fully rolled-out, RS-Opt will be the first of its kind adopted for operational use in UK (and probably worldwide). The research will also benefit a much wider field in its branch-and-price approach and its multi-commodity network flow model.
 
                            - Author contribution statement
 
                            - -
 
                            - Non-English
 
                            - No
 
                            - English abstract
 
                            - -