scholarly journals Optimization of Multimodal Discrete Network Design Problems Based on Super Networks

2021 ◽  
Vol 11 (21) ◽  
pp. 10143
Author(s):  
Yaling Zhou ◽  
Chengxuan Cao ◽  
Ziyan Feng
Keyword(s):  
Network Design ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Minimum Cost ◽  
Network Design Problem ◽  
Equilibrium Constraints ◽  
Modal Interactions ◽  
Proposed Model ◽  
Flow Equilibrium ◽  
Discrete Network Design Problem

In this paper, we investigate the multimodal discrete network design problem that simultaneously optimizes the car, bus, and rail transit network, in which inter-modal transfers are achieved by slow traffic modes including walking and bike-sharing. Specifically, a super network topology is presented to signify the modal interactions. Then, the generalized cost formulas of each type of links in the super network are defined. And based on the above formulas a bi-objective programming model is proposed to minimize the network operation cost and construction cost with traffic flow equilibrium constraints, investment constraints and expansion constraints. Moreover, a hybrid heuristic algorithm that combines the minimum cost flow algorithm and simulated annealing algorithm is presented to solve the proposed model. Finally, the effectiveness of the proposed model and algorithm is evaluated through two numerical tests: a simple test network and an actual multimodal transport network.

A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design

2017 ◽  
Vol 34 (05) ◽  
pp. 1750026 ◽  
Author(s):  
Yuxiang Yang ◽  
Zuqing Huang ◽  
Qiang Patrick Qiang ◽  
Gengui Zhou
Keyword(s):  
Supply Chain ◽  
Mathematical Programming ◽  
Network Design ◽  
Closed Loop ◽  
Programming Model ◽  
Market Competition ◽  
Network Design Problem ◽  
Equilibrium Constraints ◽  
Mathematical Programming Model ◽  
Closed Loop Supply Chain

A firm sets up his facilities including manufacturing/remanufacturing plants and distribution/collection centers, incorporating an existing closed-loop supply chain (CLSC) network. The entering firm has to compete with the existing firms in the existing network. The entering firm behaves as the leader of a Stackelberg game while the existing firms in the existing network are followers. We assume that the entering firm can anticipate the existing firms’ reaction to his potential location decision before choosing his optimal policy. We use a CLSC network equilibrium model in which the decision makers are faced with multiple objectives to capture the existing firms’ reaction. A mathematical programming model with equilibrium constraints is developed for this competitive CLSC network design problem by taking into account the market competition existing in the decentralized CLSC network. A solution method is developed by integrating Genetic algorithm with an inexact logarithmic-quadratic proximal augmented Lagrangian method. Finally, numerical examples and the related results are studied for illustration purpose.

scholarly journals Modeling the Service Network Design Problem in Railway Express Shipment Delivery

Symmetry ◽  
2018 ◽  
Vol 10 (9) ◽  
pp. 391 ◽  
Author(s):  
Siqi Liu ◽  
Boliang Lin ◽  
Jianping Wu ◽  
Yinan Zhao
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Programming Model ◽  
Optimal Solution ◽  
Minimum Cost ◽  
Theory And Practice ◽  
Network Design Problem ◽  
Service Network ◽  
Service Network Design ◽  
Train Services

As air pollution becomes increasingly severe, express trains play a more important role in shifting road freight and reducing carbon emissions. Thus, the design of railway express shipment service networks has become a key issue, which needs to be addressed urgently both in theory and practice. The railway express shipment service network design problem (RESSNDP) not only involves the selection of train services and determination of service frequency, but it is also associated with shipment routing, which can be viewed as a service network design problem (SNDP) with railway characteristics. This paper proposes a non-linear integer programming model (INLP) which aims at finding a service network and shipment routing plan with minimum cost while satisfying the transportation time constraints of shipments, carrying capacity constraints of train services, flow conservation constraint and logical constraints among decision variables. In addition, a linearization technique was adopted to transform our model into a linear one to obtain a global optimal solution. To evaluate the effectiveness and efficiency of our approach, a small trial problem was solved by the state-of-the-art mathematical programming solver Gurobi 7.5.2.

High Speed Information Network Planning using Stochastic Optimization Method

2013 ◽  
Author(s):  
Ki-Sang Song ◽  
Arun K. Somani
Keyword(s):  
Stochastic Optimization ◽  
Network Design ◽  
Multimedia Information ◽  
High Speed ◽  
Minimum Cost ◽  
Optimization Method ◽  
Multimedia Communication ◽  
Network Design Problem ◽  
Information Network ◽  
Traffic Characteristics

From the 1994 CAIS Conference: The Information Industry in Transition McGill University, Montreal, Quebec. May 25 - 27, 1994.Broadband integrated services digital network (B-ISDN) based on the asynchronous transmission mode (ATM) is becoming reality to provide high speed, multi bit rate multimedia communications. Multimedia communication network has to support voice, video and data traffics that have different traffic characteristics, delay sensitive or loss sensitive features have to be accounted for designing high speed multimedia information networks. In this paper, we formulate the network design problem by considering the multimedia communication requirements. A high speed multimedia information network design alogrithm is developed using a stochastic optimization method to find good solutions which meet the Quality of Service (QoS) requirement of each traffic class with minimum cost.

Cuckoo optimization algorithm in reverse logistics: A network design for COVID-19 waste management

2021 ◽  
pp. 0734242X2110039
Author(s):  
Elham Shadkam
Keyword(s):  
Waste Management ◽  
Network Design ◽  
Optimization Algorithm ◽  
Reverse Logistics ◽  
Heuristic Algorithms ◽  
Programming Model ◽  
Fixed Costs ◽  
Logistics System ◽  
Cuckoo Optimization Algorithm ◽  
Proposed Model

Today, reverse logistics (RL) is one of the main activities of supply chain management that covers all physical activities associated with return products (such as collection, recovery, recycling and destruction). In this regard, the designing and proper implementation of RL, in addition to increasing the level of customer satisfaction, reduces inventory and transportation costs. In this paper, in order to minimize the costs associated with fixed costs, material flow costs, and the costs of building potential centres, a complex integer linear programming model for an integrated direct logistics and RL network design is presented. Due to the outbreak of the ongoing global coronavirus pandemic (COVID-19) at the beginning of 2020 and the consequent increase in medical waste, the need for an inverse logistics system to manage waste is strongly felt. Also, due to the worldwide vaccination in the near future, this waste will increase even more and careful management must be done in this regard. For this purpose, the proposed RL model in the field of COVID-19 waste management and especially vaccine waste has been designed. The network consists of three parts – factory, consumers’ and recycling centres – each of which has different sub-parts. Finally, the proposed model is solved using the cuckoo optimization algorithm, which is one of the newest and most powerful meta-heuristic algorithms, and the computational results are presented along with its sensitivity analysis.

scholarly journals Discrete Network Design Problem

2020 ◽  
Author(s):  
Alireza Rahimi
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Variable Demand ◽  
Total Cost ◽  
Discrete Network Design Problem ◽  
The Impact ◽  
Budget Restrictions

The network design problem aims to minimize the travelers’ total cost under budget restrictions. This research provides a framework to incorporate variable demand assignment in the discrete network design problem. The findings emphasized the impact of considering variable demand in discrete network design problem.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document