Optimizing schedules of rail train circulations by tabu search algorithm
type: Item
instance of: scholarly article
title: Optimizing schedules of rail train circulations by tabu search algorithm
zbMATH Open document ID: 1296.90144
DOI: 10.1155/2013/102346
author: Mingming Chen
author: Huimin Niu
published in: Mathematical Problems in Engineering
publication date: 2014-10-13T00:00:00Z
review text: Summary: This paper develops an integer programming model for the scheduling problem in train circulations on an intercity rail line. The model that aims to minimize the sum of interval time for any two consecutive tasks is proposed to characterize the train operation process. Two main constraints, namely, time-shift and equilibrium constraint, are considered to get the feasible and practical solution of train schedules. A heuristic procedure using tabu search algorithm is also designed to solve the model by introducing the penalty function and a neighborhood search method with the trip exchange and insert strategy. A computational experiment performed on test instances provided by two major stations on the Beijing-Tianjin Intercity Railway in China illustrates the proposed model and algorithm.
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6354377
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/102346
OpenAlex ID: W2028598146
Wikidata QID: Q59022540
cites work: Multi-depot vehicle scheduling problems with time windows and waiting costs
cites work: A dynamic programming based algorithm for the crew scheduling problem.
cites work: Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
cites work: Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
cites work: A model for bus crew scheduling problem with multiple duty types
cites work: A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern
cites work: An optimization to schedule train operations with phase-regular framework for intercity rail lines
cites work: Study on the train operation optimization of passenger dedicated lines based on satisfaction
cites work: Q4280134
cites work: A fast heuristic for the train scheduling problem
cites work: A column generation approach for the rail crew re-scheduling problem
cites work: Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
cites work: A unique hybrid particle swarm optimisation algorithm for simulation and improvement of crew scheduling problem
Recommended article: Railway scheduling by network optimization
Recommended article: A branch and bound algorithm for scheduling trains in a railway network
Recommended article: An optimization to schedule train operations with phase-regular framework for intercity rail lines
Recommended article: Q4450523
Recommended article: Q3306865
Recommended article: A Re-optimization Approach for Train Dispatching
Recommended article: The demand-dependent optimization of regular train timetables
Recommended article: Q5210017
Recommended article: Q2759921
description: scientific article; zbMATH DE number 6354377