Branch-and-price-and-cut for a service network design and hub location problem

Ann-Kathrin Rothenbächer, Michael Drexl and Stefan Irnich

European Journal of Operational Research, 2016, vol. 255, issue 3, 935-947

Abstract: In the context of combined road–rail freight transport, we study the integrated tactical planning of hub locations and the design of a frequency service network. We consider a number of real-world constraints such as multiple transshipments of requests at hubs, transport time limits for requests, request splitting, and outsourcing possibilities. We present a path-based model and solve it with a branch-and-price-and-cut algorithm. Computational experiments show that large realistic instances from a major German rail freight company can be solved close to optimality within one hour on a standard desktop computer, allowing our algorithm to be used for practical planning purposes.

Keywords: Service network design; Hub location; Intermodal transport; Branch-and-price-and-cut (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221716303952
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:255:y:2016:i:3:p:935-947

DOI: 10.1016/j.ejor.2016.05.058

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().