Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem
type: Item
instance of: scholarly article
title: Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem
zbMATH Open document ID: 1407.90229
DOI: 10.1155/2014/246791
author: Xianqiang Yang
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: The railway freight center stations location and wagon flow organization in railway transport are interconnected, and each of them is complicated in a large-scale rail network. In this paper, a two-stage method is proposed to optimize railway freight center stations location and wagon flow organization together. The location model is present with the objective to minimize the operation cost and fixed construction cost. Then, the second model of wagon flow organization is proposed to decide the optimal train service between different freight center stations. The location of the stations is the output of the first model. A heuristic algorithm that combined tabu search (TS) with adaptive clonal selection algorithm (ACSA) is proposed to solve those two models. The numerical results show the proposed solution method is effective.
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B90
zbMATH DE Number: 7015981
Wikidata QID: Q59064196
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/246791
OpenAlex ID: W2051344189
cites work: The Location of Emergency Service Facilities
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: A Heuristic Method for the Set Covering Problem
cites work: Hub Location and the p-Hub Median Problem
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Fuzzy logic based algorithms for maximum covering location problems
cites work: Some heuristic methods for solving \(p\)-median problems with a coverage constraint
cites work: Constructing railroad blocking plans to minimize handling costs
cites work: New approaches for solving the block‐to‐train assignment problem
cites work: A user's guide to tabu search
cites work: Tabu search and finite convergence
Recommended article: Study on the stochastic chance-constrained fuzzy programming model and algorithm for wagon flow scheduling in railway bureau
Recommended article: Optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network of railway terminal
Recommended article: Stochastic optimization model of locomotive assignment to freight trains
Recommended article: Routing optimization model and algorithm for out-of-gauge freights in multiple flow railway network
Recommended article: Optimization Models for Multi-period Railway Rolling Stock Assignment
Recommended article: Models and algorithms for combinatorial optimization problems arising in railway applications
Recommended article: A simulated annealing approach to the railroad freight transportation design problem
Recommended article: The locomotive assignment problem: a survey on optimization models
Recommended article: A search-based approach to railway rolling stock allocation problems
description: scientific article; zbMATH DE number 7015981