Benders decomposition has been widely used for solving network design problems. In this paper, we use a branch-and-cut algorithm to improve the separation procedure of Gabrel et al. and Knippel et al. for capacitated network design. We detail experiments on bi-layer networks, comparing with Knippel’s previous results.

Logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted the attention of many researchers. Transportation network design is then one of the most important fields of logistic network. This study is concerned with designing a multi-stage and multi-product logistic network. At first, a mixed integer nonlinear programming model...

In this paper, the exam booklet distribution plan for Higher Education Institutions Exam (HEIE) is studied. The accurate important to decrease transportation cost and use capacity efficiently. booklets should be considered as capacitated vehicle routing problem (VRP). context, aim of paper minimizing cost/distance from depot where are kept schools with vehicles. case Gaziantep city 135 nodes (o...

In our previous research, we compared the actual route recorded by a GPS device “PhotoTrackr” and the optimal vehicle route derived by using ArcGIS Network Analyst tool. VRP is the fundamental problem in the research fields of transportation, we focus on variations of CVRPTW (Capacitated VRP with Time Windows). Various types of VRP are studied to determine the optimal route under various constr...

We consider a compound problem of the generalized minimum-cost flow problem and the independent-flow problem, which we call the generalized independent-flow problem. The generalized minimumcost flow problem is to find a minimum-cost flow in a capacitated network with gains, where each arc flow is multiplied by a gain factor when going through an arc. On the other hand, the independent-flow prob...

We consider a network in which products consist of combinations of connecting edges and each edge corresponds to a perishable resource. In our model, different revenue-maximizing “controllers” determine the prices associated with different resources and the price of the product is the sum of the prices of the constituent resources. At one extreme, a single controller might set all resource pric...

This abstract describes a branch, cut, and price (BCP) algorithm for the solution of a class of network design problems with routing and packing constraints that can all be seen as special cases of a general model we will call the Capacitated Node Routing Problem (CNRP). We present several alternative integer programming formulation of the CNRP that can be shown to generalize a number of other ...