scholarly journals A Multiobjective Optimization for Train Routing at the High-Speed Railway Station Based on Tabu Search Algorithm

2018 ◽  
Vol 2018 ◽  
pp. 1-22 ◽  
Author(s):  
Ziyan Feng ◽  
Chengxuan Cao ◽  
Yutong Liu ◽  
Yaling Zhou
Keyword(s):  
Tabu Search ◽  
High Speed ◽  
Large Scale ◽  
Computing Time ◽  
Mixed Integer ◽  
Small Scale ◽  
Railway Station ◽  
High Speed Railway ◽  
Routing Problem ◽  
Train Routing

This paper focuses on the train routing problem at a high-speed railway station to improve the railway station capacity and operational efficiency. We first describe a node-based railway network by defining the turnout node and the arrival-departure line node for the mathematical formulation. Both considering potential collisions of trains and convenience for passengers’ transfer in the station, the train routing problem at a high-speed railway station is formulated as a multiobjective mixed integer nonlinear programming model, which aims to minimize trains’ departure time deviations and total occupation time of all tracks and keep the most balanced utilization of arrival-departure lines. Since massive decision variables for the large-scale real-life train routing problem exist, a fast heuristic algorithm is proposed based on the tabu search to solve it. Two sets of numerical experiments are implemented to demonstrate the rationality and effectiveness of proposed method: the small-scale case confirms the accuracy of the algorithm; the resulting heuristic proved able to obtain excellent solution quality within 254 seconds of computing time on a standard personal computer for the large-scale station involving up to 17 arrival-departure lines and 46 trains.

scholarly journals Multidepot Heterogeneous Vehicle Routing Problem for a Variety of Hazardous Materials with Risk Analysis

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Bochen Wang ◽  
Qiyuan Qian ◽  
Zheyi Tan ◽  
Peng Zhang ◽  
Aizhi Wu ◽  
...  
Keyword(s):  
Risk Analysis ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Large Scale ◽  
Programming Model ◽  
Hazardous Materials ◽  
Mixed Integer ◽  
Small Scale ◽  
Routing Problem ◽  
Heterogeneous Vehicle Routing Problem

This study investigates a multidepot heterogeneous vehicle routing problem for a variety of hazardous materials with risk analysis, which is a practical problem in the actual industrial field. The objective of the problem is to design a series of routes that minimize the total cost composed of transportation cost, risk cost, and overtime work cost. Comprehensive consideration of factors such as transportation costs, multiple depots, heterogeneous vehicles, risks, and multiple accident scenarios is involved in our study. The problem is defined as a mixed integer programming model. A bidirectional tuning heuristic algorithm and particle swarm optimization algorithm are developed to solve the problem of different scales of instances. Computational results are competitive such that our algorithm can obtain effective results in small-scale instances and show great efficiency in large-scale instances with 70 customers, 30 vehicles, and 3 types of hazardous materials.

Dynamic Scheduling Model and Algorithm for Dispatching Trains in High-Speed Railway Passenger Station

2010 ◽  
Author(s):  
Yixiang Yue ◽  
Leishan Zhou
Keyword(s):  
High Speed ◽  
Large Scale ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Time Window ◽  
Real Life ◽  
Greedy Heuristic ◽  
Railway Station ◽  
High Speed Railway ◽  
Railway Passenger

Regarding the railway station tracks and train running routes as machines, all trains in this railway station as jobs, dispatching trains in high-speed railway passenger stations can be considered as a special type of Job-Shop Problem (JSP). In this paper, we proposed a multi-machines, multi-jobs JSP model with special constraints for Operation Plan Scheduling Problem (OPSP) in high-speed railway passenger stations, and presented a fast heuristic algorithm based on greedy heuristic. This algorithm first divided all operations into several layers according to the yards attributes and the operation’s urgency level. Then every operation was allotted a feasible time window, each operation was assigned to a specified “machine” sequenced or backward sequenced within the time slot, layer by layer according to its priority. As we recorded and modified the time slots dynamically, the searching space was decreased dramatically. And we take the South Beijing High-speed Railway Station as example and give extensive numerical experiment. Computational results based on real-life instance show that the algorithm has significant merits for large scale problems; can both reduce tardiness and shorten cycle times. The empirical evidence also proved that this algorithm is industrial practicable.

scholarly journals Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed Railway

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Lianbo Deng ◽  
Jing Xu ◽  
Ningxin Zeng ◽  
Xinlei Hu
Keyword(s):  
Optimization Model ◽  
Dynamic Pricing ◽  
High Speed ◽  
Large Scale ◽  
Solution Method ◽  
Programming Model ◽  
Divide And Conquer ◽  
Small Scale ◽  
High Speed Railway ◽  
Seat Allocation

This paper studies the multistage pricing and seat allocation problems for multiple train services in a high-speed railway (HSR) with multiple origins and destinations (ODs). Taking the maximum total revenue of all trains as the objective function, a joint optimization model of multistage pricing and seat allocation is established. The actual operation constraints, including train seat capacity constraints, price time constraints in each period, and price space constraints among products, are fully considered. We reformulate the optimization model as a bilevel multifollower programming model in which the upper-level model solves the seat allocation problem for all trains serving multiple ODs in the whole booking horizon and the lower optimizes the pricing decisions for each train serving each OD in different decision periods. The upper and lower are a large-scale static seat allocation programming and many small-scale multistage dynamic pricing programming which can be solved independently, respectively. The solving difficulty can be significantly reduced by decomposing. Then, we design an effective solution method based on divide-and-conquer strategy. A real instance of the China’s Wuhan-Guangzhou high-speed railway is employed to validate the advantages of the proposed model and the solution method.

scholarly journals The electric vehicle routing problem with partial recharge and vehicle recycling

2021 ◽  
Author(s):  
Yuzhen Zhou ◽  
Jincai Huang ◽  
Jianmai Shi ◽  
Rui Wang ◽  
Kuihua Huang
Keyword(s):  
Electric Vehicle ◽  
Large Scale ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Small Scale ◽  
Routing Problem ◽  
Practical Applications ◽  
New Variant ◽  
Commercial Solver ◽  
Charging Stations

AbstractIn this paper, a new variant of the electric vehicle (EV) routing problem, which considers heterogeneous EVs, partial recharge, and vehicle recycling, is investigated based on logistic companies' practical operation. A mixed integer linear programming (MILP) model is proposed to formulate the problem. For small-scale scenarios, commercial solver, e.g., CPLEX, is leveraged. For large-scale instances faced by practical applications, a hybrid metaheuristic is designed through integrating a modified Greedy Algorithm with the Variable Neighborhood Search (VNS). The proposed algorithm was tested by real-world instances from JD, an e-commerce enterprise in China. Computational results indicate that partial recharge and vehicle recycling can save costs effectively. It also shows that the number of charging stations is an important factor for the application of EVs.

Sign in / Sign up

Export Citation Format

Share Document