MIP neighborhood search heuristics for a service network design problem with design-balanced requirements

2020 ◽  
Vol 26 (4) ◽  
pp. 475-502
Author(s):  
Naoto Katayama
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Neighborhood Search ◽  
Service Network ◽  
Service Network Design ◽  
Search Heuristics

scholarly journals Dynamic discretization discovery for the service network design problem with mixed autonomous fleets

2020 ◽  
Vol 141 ◽  
pp. 164-195
Author(s):  
Yannick Oskar Scherr ◽  
Mike Hewitt ◽  
Bruno Albert Neumann Saavedra ◽  
Dirk Christian Mattfeld
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Service Network ◽  
Service Network Design

The Continuous-Time Service Network Design Problem

2017 ◽  
Vol 65 (5) ◽  
pp. 1303-1321 ◽  
Author(s):  
Natashia Boland ◽  
Mike Hewitt ◽  
Luke Marshall ◽  
Martin Savelsbergh
Keyword(s):  
Network Design ◽  
Continuous Time ◽  
Design Problem ◽  
Network Design Problem ◽  
Service Network ◽  
Time Service ◽  
Service Network Design

scholarly journals An Optimization Method for the Train Service Network Design Problem

2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Jie Xiao ◽  
Yi Xie ◽  
Haowei Yu ◽  
Hongying Yan
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Programming Model ◽  
Optimal Solution ◽  
Network Design Problem ◽  
Small Scale ◽  
Improved Genetic Algorithm ◽  
Service Network ◽  
Service Network Design ◽  
Train Services

Effective railway freight transportation relies on a well-designed train service network. This paper investigates the train service network design problem at the tactical level for the Chinese railway system. It aims to determine the types of train services to be offered, how many trains of each service are to be dispatched per day (service frequency), and by which train services shipments are to be transported. An integer programming model is proposed to address this problem. The optimization model considers both through train services between nonadjacent yards, and two classes of service between two adjacent yards ( i.e., shuttle train services directly from one yard to its adjacent yard, and local train services that make at least one intermediate stop). The objective of the model is to optimize the transportation of all the shipments with minimal costs. The costs consist of accumulation costs, classification coststrain operation costs, and train travel costs. The NP-hard nature of the problem prevents an exact solution algorithm from finding the optimal solution within a reasonable time, even for small-scale cases. Therefore, an improved genetic algorithm is designed and employed here. To demonstrate the proposed model and the algorithm, a case study on a real-world sub-network in China is carried out. The computational results show that the proposed approach can obtain high-quality solutions with satisfactory speed. Moreover, comparative analysis on a case that assumes all the shuttle train services between any two adjacent yards to be provided without optimization reveals some interesting insights.

scholarly journals A Bi-Level Programming Model for the Railway Express Cargo Service Network Design Problem

Symmetry ◽  
2018 ◽  
Vol 10 (6) ◽  
pp. 227 ◽  
Author(s):  
Boliang Lin ◽  
Jianping Wu ◽  
Jiaxi Wang ◽  
Jingsong Duan ◽  
Yinan Zhao
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Programming Model ◽  
Network Design Problem ◽  
Service Network ◽  
Service Network Design

Subgradient Methods for the Service Network Design Problem

1994 ◽  
Vol 28 (3) ◽  
pp. 256-272 ◽  
Author(s):  
Judith M. Farvolden ◽  
Warren B. Powell
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Subgradient Methods ◽  
Service Network ◽  
Service Network Design
Sign in / Sign up

Export Citation Format

Share Document