Optimization Models for Estimating Transit Network Origin–Destination Flows with Big Transit Data

In the article, the author considers the problems of complex algorithmization and systematization of approaches to optimizing the work plans of construction organizations (calendar plans) using various modern tools, including, for example, evolutionary algorithms for "conscious" enumeration of options for solving a target function from an array of possible constraints for a given nomenclature. Various typical schemes for modeling the processes of distribution of labor resources between objects of the production program are given, taking into account the array of source data. This data includes the possibility of using the material and technical supply base (delivery, storage, packaging) as a temporary container for placing the labor resource in case of released capacity, quantitative and qualification composition of the initial labor resource, the properties of the construction organization as a counterparty in the contract system with the customer of construction and installation works etc. A conceptual algorithm is formed that is the basis of the software package for operational harmonization of the production program ( work plans) in accordance with the loading of production units, the released capacities of labor resources and other conditions stipulated by the model. The application of the proposed algorithm is most convenient for a set of objects, which determines the relevance of its implementation in optimization models when planning production programs of building organizations that contain several objects distributed over a time scale.

Download Full-text

Inventory Optimization Models of Equipment Spare Parts Based on Computer Simulation

2018 3rd International Conference on Computer Science and Information Engineering (ICCSIE 2018) ◽

10.23977/iccsie.2018.1067 ◽

2018 ◽

Keyword(s):

Computer Simulation ◽

Spare Parts ◽

Optimization Models ◽

Inventory Optimization

Download Full-text

COMPARISON OF TWO OPTIMIZATION MODELS FOR CONSTRUCTING PATTERNS IN THE METHOD OF LOGICAL ANALYSIS OF DATA

СИСТЕМЫ УПРАВЛЕНИЯ И ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ ◽

10.36622/vstu.2020.95.50.002 ◽

2020 ◽

pp. 10-13

Author(s):

Р.И. Кузьмич ◽

А.А. Ступина ◽

С.Н. Ежеманская ◽

А.П. Шугалей

Keyword(s):

Objective Function ◽

Optimization Model ◽

Logical Analysis ◽

Optimization Models ◽

Logical Analysis Of Data

Предлагаются две оптимизационные модели для построения информативных закономерностей. Приводится эмпирическое подтверждение целесообразности использования критерия бустинга в качестве целевой функции оптимизационной модели для получения информативных закономерностей. Информативность, закономерность, критерий бустинга, оптимизационная модель Comparison of two optimization models for constructing patterns in the method of logical analysis of data Two optimization models for constructing informative patterns are proposed. An empirical confirmation of the expediency of using the boosting criterion as an objective function of the optimization model for obtaining informative patterns is given.

Download Full-text

Passenger route choice behavior on transit network with real-time information at stops

Journal of Computer Applications ◽

10.3724/sp.j.1087.2013.02964 ◽

2013 ◽

Vol 33 (10) ◽

pp. 2964-2968 ◽

Cited By ~ 2

Author(s):

Ying ZENG ◽

Jun LI ◽

Hui ZHU

Keyword(s):

Real Time ◽

Choice Behavior ◽

Route Choice ◽

Transit Network ◽

Route Choice Behavior ◽

Real Time Information ◽

Time Information

Download Full-text

A comparison of optimization models for lumber production planning

Bosque (Valdivia) ◽

10.4067/s0717-92002015000200009 ◽

2015 ◽

Vol 36 (2) ◽

pp. 239-246 ◽

Cited By ~ 3

Author(s):

Francisco P Vergara ◽

Cristian D Palma ◽

Héctor Sepúlveda

Keyword(s):

Production Planning ◽

Optimization Models

Download Full-text

Research on Hyperpaths in the Urban Rail Transit Network

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.488-489.1439 ◽

2014 ◽

Vol 488-489 ◽

pp. 1439-1443

Author(s):

Jin Hai Li ◽

Jian Feng Liu

Keyword(s):

Large Scale ◽

Urban Rail Transit ◽

Rail Transit ◽

Transit Network ◽

Travel Costs ◽

Urban Rail ◽

Distinctive Structure ◽

Feasible Path ◽

Definition Of ◽

Urban Rail Transit Network

Hyperpaths enumeration is one of the basic procedures in many traffic planning issues. As a result of its distinctive structure, hyperpaths in Urban Rail Transit Network (URTN) are different from those in road network. Typically, one may never visit a station more than once and would never transfer from one line to another that has been visited in a loopless URTN, meaning that stations a hyperpath traversed cannot be repeated, neither do lines in loopless networks. This paper studies the relationships between feasible path and the shortest path in terms of travel costs. In this paper, a new definition of hyperpath in URTN is proposed and a new algorithm based on the breadth first searching (BFS) method is presented to enumerate the hyperpaths. The algorithm can safely avoid hyperpath omission and can even be applied in networks containing loops as well. The influence of parameters on hyperpaths is studied by experimentally finding hyperpaths in the subway network in Beijing. A group of suggested parameter pairs are then given. Finally, a numerical experiment is used to illustrate the validity of the proposed algorithm. The results imply the significance of the convergence of the BFS algorithm which can be used to search hyperpaths in large scale URTN even with loop.

Download Full-text