Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network

Sung, Chang Sup; Song, Soohwan

doi:10.1057/palgrave.jors.2601479

Cited by 9 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed flow model uses an exponential number of variables and is solved by a branch-and-price approach. Finally, in a broader sense, the NDPR is also related to optimization problems dealing with wavelength division multiplexing, but, in contrast to the NDPR, the routing of an optical signal has to be optimized at two layers, the logical and the physical one (see, e.g., Stanojević 2011, Sung andSong 2003, for further details).…”

Section: Informs Journal Onmentioning

confidence: 99%

Exact Approaches for Network Design Problems with Relays

Leitner

Ljubić

Riedler

et al. 2019

INFORMS Journal on Computing

View full text Add to dashboard Cite

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

show abstract

Section: Informs Journal Onmentioning

confidence: 99%

Exact Approaches for Network Design Problems with Relays

Leitner

Ljubić

Riedler

et al. 2019

INFORMS Journal on Computing

View full text Add to dashboard Cite

show abstract

“…However, it has been noted that a path-flow-based formulation may provide a more efficient and effective formulation, where a path [i, j] corresponds to an ordered set (i, k, j), iAI, jAJ, kAK. 22 Furthermore, since the associated candidate paths (potential paths) for each freight demand are finite (O(|K|)), the whole associated columns (the paths) are explicitly generated in the beginning of the associated LP relaxation (explicit column generation) and any service time restriction can be easily checked as the set of potential paths is generated. Therefore, the proposed problem will be formulated in terms of paths through which freight demands are transported.…”

Section: Mathematical Formulationmentioning

confidence: 99%

“…However, the aggregated constraints (5) is weaker than the disaggregated constraints (10) so that in order to find any better lower bounds, it is necessary to replace constraints (5) with constraints (10) even though it may require more time to solve the associated LP relaxations. 22 For each potential direct service, consider the following polyhedron associated with the capacity constraints (3) and (4):…”

Section: Valid Inequalities and Separation Algorithmmentioning

confidence: 99%

Integrated service network design for a cross-docking supply chain network

Sung

Song

2003

Journal of the Operational Research Society

Self Cite

View full text Add to dashboard Cite

This paper considers an integrated service network design problem for a given set of freight demands that is concerned with integration of locating cross-docking (CD) centers and allocating vehicles for the associated direct (transportation) services from origin node to a CD center or from a CD center to the destination node. For the vehicle allocation, direct services (sub-routes) should be determined for the given freight demands, and then the vehicle allocation has to be made in consideration of routing for the associated direct service fulfillment subject to vehicle capacity and service time restriction. The problem is modeled as a path-based formulation for which a tabu-search-based solution algorithm is proposed. To guarantee the performance of the proposed solution algorithm, strong valid inequalities are derived based on the polyhedral characteristics of the problem domain and an efficient separation heuristic is derived for identifying any violated valid inequalities. Computational experiments are performed to test the performance of the proposed solution algorithm and also that of a valid-inequality separation algorithm, which finds that the solution algorithm works quite well and the separation algorithm provides strengthened lower bounds. Its immediate application may be made to strategic (integrated) service network designs and to tactical service network planning for the CD network.

show abstract

“…One such procedure was proposed by Sung and Song (2003). However, in their setting there are no restrictions at the network nodes in terms of equipment available, and the capacity of lightpaths is not considered to be a constraint.…”

Section: Introductionmentioning

confidence: 99%

Branch and Price for WDM Optical Networks with No Bifurcation of Flow

Raghavan

Stanojević

2011

INFORMS Journal on Computing

View full text Add to dashboard Cite

T he second generation of optical networks with wavelength division multiplexing (WDM) is based on the notion of two layer networks, where the first layer represents a logical topology defined over the physical topology of optical fibers and the second layer represents multiple traffic requests combined (multiplexed) over the paths established in the logical topology. Because the design of both of these layers is challenging by itself, researchers have mainly focused on solving these problems either independently or in a sequential fashion. In this paper, we look at the WDM optical network design problem with nonbifurcated traffic flows and propose an exact branch-and-price procedure that simultaneously solves logical topology design and traffic routing over the established logical topology. The unique feature of the proposed algorithm is that it works with a rowincomplete mathematical formulation and two types of variables that exponentially grow in number with the problem size. We discuss computational issues related to the use of this procedure and propose two approximate branch-and-price procedures that can be used to obtain lower and upper bounds for this problem. Finally, we present the results of our computational experiments for two design objectives and alternative optical network settings.

show abstract

Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network

Cited by 9 publications

References 25 publications

Exact Approaches for Network Design Problems with Relays

Exact Approaches for Network Design Problems with Relays

Integrated service network design for a cross-docking supply chain network

Branch and Price for WDM Optical Networks with No Bifurcation of Flow

Contact Info

Product

Resources

About