Branch-and-price-and-cut for a service network design and hub location problem
نویسندگان
چکیده
منابع مشابه
Branch-and-price-and-cut for a service network design and hub location problem
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. To our knowledge, the combination of problem feat...
متن کاملA branch-and-cut algorithm for the hub location and routing problem
We study the hub location and routing problem where we jointly decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total transportation cost. Each hub has one vehicle that visits all the nodes assigned to it on a cycle. We propose a mixed integer programming formulation for this problem and s...
متن کاملHeuristic Branch-and-Price-and-Cut to Solve a Network Design Problem
We present a Heuristic Branch&Price&Cut (BPC) approach for a network design problem. This algorithm integrates several original features including: • a multi-commodity multi-capacity network design problem path based model, • a pricing scheme using pools of generators and promising columns, • cutting-planes applied to the path-based formulation to obtain better lower bounds, to make better heur...
متن کاملBranch-and-Price for a Survivable Network Design Problem
We consider a specific variant of the survivable network design problem suitable to model real world scenarios occurring in the extension of fiber optic networks. In this article, two mixed integer programming models, which can be solved by branch-and-price, are discussed and compared to existing approaches theoretically as well as by a computational study. We further discuss the usage of alter...
متن کاملA branch-and-cut algorithm for the partitioning-hub location-routing problem
We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2016
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2016.05.058