scholarly journals A branch-and-price approach to the feeder network design problem

2018 ◽  
Vol 264 (2) ◽  
pp. 607-622 ◽  
Author(s):  
Alberto Santini ◽  
Christian E.M. Plum ◽  
Stefan Ropke
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Branch And Price ◽  
Price Approach

Using branch-and-price approach to solve the directed network design problem with relays

Omega ◽  
2012 ◽  
Vol 40 (5) ◽  
pp. 672-679 ◽  
Author(s):  
Xiangyong Li ◽  
Y.P. Aneja ◽  
Jiazhen Huo
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Directed Network ◽  
Branch And Price ◽  
Price Approach

Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations

2012 ◽  
Vol 60 (3) ◽  
pp. 604-610 ◽  
Author(s):  
Chungmok Lee ◽  
Kyungsik Lee ◽  
Kyungchul Park ◽  
Sungsoo Park
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Technical Note ◽  
Network Design Problem ◽  
Branch And Price ◽  
Robust Network Design ◽  
Robust Network

scholarly journals Branch-and-price approaches for the network design problem with relays

2018 ◽  
Vol 92 ◽  
pp. 155-169 ◽  
Author(s):  
Barış Yıldız ◽  
Oya Ekin Karaşan ◽  
Hande Yaman
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Branch And Price

scholarly journals A Branch-and-Price Algorithm for the Liner Shipping Network Design Problem

2020 ◽  
Vol 1 (4) ◽  
Author(s):  
Kristian Thun ◽  
Henrik Andersson ◽  
Magnus Stålhane
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Computational Study ◽  
Liner Shipping ◽  
Maritime Transportation ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Specific Class ◽  
Branch And Price ◽  
Price Algorithm

AbstractMaritime transportation is the backbone of the global economy and one of its most important segments is liner shipping. To design a liner shipping network is notoriously difficult but also very important since an efficient network can be the difference between prosperity and bankruptcy. In this paper, we propose a branch-and-price algorithm for the liner shipping network design problem, which is the problem of designing a set of cyclic services and to deploy a specific class of vessels to each service so that all demand can flow through the network at minimal cost. The proposed model can create services with a complex structure and correctly calculate the transshipment cost. The formulation of the master problem strengthens a known formulation with valid inequalities. Because of multiple dependencies between ports that are not necessarily adjacent and no defining state at any of the ports, the subproblem is formulated and solved as a mixed integer linear program. Strategies to improve the solution time of the subproblem are proposed. The computational study shows that the algorithm provides significantly tighter lower bounds in the root node than existing methods on a set of small instances.

Algorithms for a network design problem with crossing supermodular demands

Networks ◽  
2004 ◽  
Vol 43 (4) ◽  
pp. 256-265 ◽  
Author(s):  
Vardges Melkonian ◽  
�va Tardos
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem
Sign in / Sign up

Export Citation Format

Share Document