# A Branch-First, Cut-Second Approach for Locomotive Assignment

## Author Info

• Koorush Ziarati

(École Polytechnique (Montréal) Département de Mathématiques et Génie Industriel, C.P. 6079, Succ. Centre-Ville, Montréal, Canada H3C 3A7 and GERAD)

• François Soumis

(École Polytechnique (Montréal) Département de Mathématiques et Génie Industriel, C.P. 6079, Succ. Centre-Ville, Montréal, Canada H3C 3A7 and GERAD)

• Jacques Desrosiers

(École des Hautes Études Commerciales and GERAD, 3000 chemin de la Côte-Ste-Catherine, Montréal, Canada H3T 2A7)

• Marius M. Solomon

(Northeastern University, College of Business Administration, Department of Management Sciences, 314 Hayden Hall, 360 Huntingdon Avenue, Boston, Massachusetts 02115 and GERAD)

Registered author(s):

## Abstract

The problem of assigning locomotives to trains consists of selecting the types and number of engines that minimize the fixed and operational locomotive costs resulting from providing sufficient power to pull trains on fixed schedules. The force required to pull a train is often expressed in terms of horsepower and tonnage requirements rather than in terms of number of engines. This complicates the solution process of the integer programming formulation and usually creates a large integrality gap. Furthermore, the solution of the linearly relaxed problem is strongly fractional. To obtain integer solutions, we propose a novel branch-and-cut approach. The core of the method consists of branching decisions that define on one branch the projection of the problem on a low-dimensional subspace. There, the facets of the polyhedron describing a restricted constraint set can be easily derived. We call this approach branch-first, cut-second. We first derive facets when at most two types of engines are used. We then extend the branching rule to cases involving additional locomotive types. We have conducted computational experiments using actual data from the Canadian National railway company. Simulated test-problems involving two or more locomotive types were solved over 1-, 2-, and 3-day rolling horizons. The cuts were successful in reducing the average integrality gap by 52% for the two-type case and by 34% when more than 25 types were used. Furthermore, the branch-first, cut-second approach was instrumental in improving the best known solution for an almost 2,000-leg weekly problem involving 26 locomotive types. It reduced the number of locomotives by 11, or 1.1%, at an equivalent savings of \$3,000,000 per unit. Additional tests on different weekly data produced almost identical results.

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://dx.doi.org/10.1287/mnsc.45.8.1156

## Bibliographic Info

Article provided by INFORMS in its journal Management Science.

Volume (Year): 45 (1999)
Issue (Month): 8 (August)
Pages: 1156-1168

as in new window
Handle: RePEc:inm:ormnsc:v:45:y:1999:i:8:p:1156-1168

Contact details of provider:
Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
Phone: +1-443-757-3500
Fax: 443-757-3515
Email:
Web page: http://www.informs.org/

## Related research

Keywords: integer linear programming; branch and cut; decomposition; scheduling; railway;

## References

No references listed on IDEAS
You can help add them by filling out this form.

## Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
1. Rouillon, Stéphane & Desaulniers, Guy & Soumis, François, 2006. "An extended branch-and-bound method for locomotive assignment," Transportation Research Part B: Methodological, Elsevier, vol. 40(5), pages 404-423, June.
2. Vaidyanathan, Balachandran & Ahuja, Ravindra K. & Liu, Jian & Shughart, Larry A., 2008. "Real-life locomotive planning: New formulations and computational results," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 147-168, February.
3. Chung, Ji-Won & Oh, Seog-Moon & Choi, In-Chan, 2009. "A hybrid genetic algorithm for train sequencing in the Korean railway," Omega, Elsevier, vol. 37(3), pages 555-565, June.

## Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

## Corrections

When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:45:y:1999:i:8:p:1156-1168. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.