scholarly journals New models of the generalized fixed-charge network design problem

2012 ◽  
Vol 28 (1) ◽  
pp. 143-150
Author(s):  
PETRICA C. POP ◽  
◽  
CORINA POP SITAR ◽  
Keyword(s):  
Network Design ◽  
Optimization Problems ◽  
Fixed Charge ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Computational Results ◽  
Combinatorial Optimization Problems ◽  
Backbone Network ◽  
New Models ◽  
The Given

We consider in this paper the generalized fixed-charge network design (GFCND) problem in which we are interested to find the cheapest backbone network connecting exactly one hub from each of the given clusters. The GFCND problem belongs to the class of generalized combinatorial optimization problems. We describe two mixed integer programming formulations of the GFCND problem. Based on one of the new proposed formulations, we solve the GFCND problem to optimality using CPLEX for problems with up to 30 clusters and 200 nodes. Computational results are reported and compared with those from the literature.

scholarly journals Highway Passenger Transport Based Express Parcel Service Network Design: Model and Algorithm

2017 ◽  
Vol 2017 ◽  
pp. 1-17 ◽  
Author(s):  
Yuan Jiang ◽  
Baofeng Sun ◽  
Gendao Li ◽  
Zhibin Lin ◽  
Changxu Zheng ◽  
...  
Keyword(s):  
Network Design ◽  
Network Flow ◽  
Programming Model ◽  
Real Data ◽  
Path Selection ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Passenger Transport ◽  
Service Network ◽  
Time Space

Highway passenger transport based express parcel service (HPTB-EPS) is an emerging business that uses unutilised room of coach trunk to ship parcels between major cities. While it is reaping more and more express market, the managers are facing difficult decisions to design the service network. This paper investigates the HPTB-EPS network design problem and analyses the time-space characteristics of such network. A mixed-integer programming model is formulated integrating the service decision, frequency, and network flow distribution. To solve the model, a decomposition-based heuristic algorithm is designed by decomposing the problem as three steps: construction of service network, service path selection, and distribution of network flow. Numerical experiment using real data from our partner company demonstrates the effectiveness of our model and algorithm. We found that our solution could reduce the total cost by up to 16.3% compared to the carrier’s solution. The sensitivity analysis demonstrates the robustness and flexibility of the solutions of the model.

Design of Bus Routes: Methodology and the Santo Domingo Case

2002 ◽  
Vol 1791 (1) ◽  
pp. 35-43 ◽  
Author(s):  
Avishai Ceder ◽  
Oneximo Gonzalez ◽  
Hugo Gonzalez
Keyword(s):  
Network Design ◽  
Traffic Congestion ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Large Network ◽  
Santo Domingo ◽  
Urban Transit ◽  
Bus Network ◽  
Transit Routes

Growing traffic congestion, the importance of preserving the environment, and the problems of road safety are the main reasons to consider new initiatives worldwide in designing new urban transit routes. A need exists to develop a practical methodology for the construction of a new or improved network of bus routes along with intermodality considerations. An approach for the design of urban bus routes is presented with an example of designing new bus routes for the city of Santo Domingo in the Dominican Republic. Santo Domingo has major congestion, environmental, and safety problems. The presented approach involves a framework for the construction of operational objective functions for the bus-network-design problem. This framework takes into account passenger, operator, and community interests. The methodology combines the philosophy of mathematical programming approaches with decisionmaking techniques, so as to allow the user to select from a number of alternatives. The overall formulation is nonlinear and mixed-integer programming. The bus-network-design formulation used in the case study of Santo Domingo, a city with 3 million inhabitants, involved a large network of feasible bus routes subjected to the proposed method and resulted in 84 new bus routes. With other accompanied measures, the new bus routes will change the bus system image in Santo Domingo.

scholarly journals Determining nodal capacities for military distribution problems

2019 ◽  
Vol 3 (2) ◽  
pp. 110-130 ◽  
Author(s):  
Dave C. Longhorn ◽  
Joshua R. Muckensturm
Keyword(s):  
Supply Chain ◽  
Network Design ◽  
The United States ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Multiple Time ◽  
Supply Chain Network Design ◽  
Supply Chain Network ◽  
Content Type ◽  
Distribution Problems

Purpose This paper aims to introduce a new mixed integer programming formulation and associated heuristic algorithm to solve the Military Nodal Capacity Problem, which is a type of supply chain network design problem that involves determining the amount of capacity expansion required at theater nodes to ensure the on-time delivery of military cargo. Design/methodology/approach Supply chain network design, mixed integer programs, heuristics and regression are used in this paper. Findings This work helps analysts at the United States Transportation Command identify what levels of throughput capacities, such as daily processing rates of trucks and railcars, are needed at theater distribution nodes to meet warfighter cargo delivery requirements. Research limitations/implications This research assumes all problem data are deterministic, and so it does not capture the variations in cargo requirements, transit times or asset payloads. Practical implications This work gives military analysts and decision makers prescriptive details about nodal capacities needed to meet demands. Prior to this work, insights for this type of problem were generated using multiple time-consuming simulations often involving trial-and-error to explore the trade space. Originality/value This work merges research of supply chain network design with military theater distribution problems to prescribe the optimal, or near-optimal, throughput capacities at theater nodes. The capacity levels must meet delivery requirements while adhering to constraints on the proportion of cargo transported by mode and the expected payloads for assets.

scholarly journals Multi-Period Network Design Problem in Regional Hazardous Waste Management Systems

2019 ◽  
Vol 16 (11) ◽  
pp. 2042 ◽  
Author(s):  
Jun Zhao ◽  
Lixiang Huang
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Programming Model ◽  
Planning Horizon ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Hazardous Wastes ◽  
Total Risk ◽  
Total Cost ◽  
Treatment And Disposal

The management of hazardous wastes in regions is required to design a multi-echelon network with multiple facilities including recycling, treatment and disposal centers servicing the transportation, recycling, treatment and disposal procedures of hazardous wastes and waste residues. The multi-period network design problem within is to determine the location of waste facilities and allocation/transportation of wastes/residues in each period during the planning horizon, such that the total cost and total risk in the location and transportation procedures are minimized. With consideration of the life cycle capacity of disposal centers, we formulate the problem as a bi-objective mixed integer linear programming model in which a unified modeling strategy is designed to describe the closing of existing waste facilities and the opening of new waste facilities. By exploiting the characteristics of the proposed model, an augmented ε -constraint algorithm is developed to solve the model and find highly qualified representative non-dominated solutions. Finally, computational results of a realistic case demonstrate that our algorithm can identify obviously distinct and uniformly distributed representative non-dominated solutions within reasonable time, revealing the trade-off between the total cost and total risk objectives efficiently. Meanwhile, the multi-period network design optimization is superior to the single-period optimization in terms of the objective quality.

scholarly journals A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow

2016 ◽  
Vol 76 ◽  
pp. 134-146 ◽  
Author(s):  
Pedro Henrique González ◽  
Luidi Simonetti ◽  
Philippe Michelon ◽  
Carlos Martinhon ◽  
Edcarllos Santos
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Fixed Charge ◽  
Network Design Problem ◽  
Local Branching ◽  
Optimal Flow ◽  
Variable Fixing
Sign in / Sign up

Export Citation Format

Share Document