检索结果-内蒙古大学图书馆

Optimization of high-level preventive maintenance scheduling for high-speed trains

RELIABILITY ENGINEERING & SYSTEM SAFETY 2019年第Mar.期183卷 261-275页

作者： Lin Boliang Wu Jianping Lin Ruixi Wang Jiaxi Wang Hui Zhang Xuhui Beijing Jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China CloudMinds 4500 Great Amer PkwySuite 230 Santa Clara CA 95054 USA China Acad Railway Sci Inst Comp Technol Beijing 100081 Peoples R China Shanghai Railway Bur Vehicle Dept Shanghai 200071 Peoples R China

For safety reasons, a high-speed train needs to carry out the preventive maintenance when its accumulated running mileage or time reaches a predefined threshold. This paper formulates the train high-level preventive maintenance planning problem as a 0-1 programming model. A novel state function is designed to describe whether a train is under maintenance or not. By using this function, the constraint for restricting the total number of trains under maintenance can be formulated reasonably well. A linearization technique is also employed to refine the original non-linear state function into a linear one. To handle large-scale instances, a simulated annealing algorithm is proposed for solving the problem and is applied to a real-world case study from Shanghai Railway Bureau (SRB), a regional railway operator under China Railway. The optimized results yield a total cost of 3,619,200 standard train-km in terms of remaining mileage. In addition, sensitivity analyses based on the real-world case study reveal some interesting insights. We have delivered the results to SRB as a useful and efficient decision support tool for their high-level maintenance planning work.

关键词： High-speed railway EMU train High-level maintenance planning 0-1 programming Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

A new exact approach for the 0-1 Collapsing Knapsack Problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年第1期260卷 56-69页

作者： Della Croce, Federico Salassa, Fabio Scatamacchia, Rosario Politecn Torino Dipartimento Automat & Informat Corso Duca Abruzzi 24 I-10129 Turin Italy Politecn Torino Dipartimento Ingn Gestionale & Prod Corso Duca Abruzzi 24 I-10129 Turin Italy

We consider the 0/1 Collapsing Knapsack Problem (CKP) and a generalization involving more than a capacity constraint (M-CKP). We propose a novel ILP formulation and a problem reduction procedure together with an exact approach. The proposed approach compares favorably to the methods available in the literature and manages to solve to optimality very large size instances particularly for CKP and 2-CKP. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Branch and Bound Collapsing Knapsack Problem 0-1 programming Exact algorithm

来源：评论

学校读者我要写书评

暂无评论

Minimal arc-sets spanning dicycles

引用

DISCRETE APPLIED MATHEMATICS 2018年 240卷 33-43页

作者： Cornaz, D. Kerivin, H. Mahjoub, A. R. Univ Paris 09 PSL Res Univ CNRS UMR 7244LAMSADE F-75016 Paris France Univ Blaise Pascal LIMOS Cornplexe Sci Cezeaux F-63173 Aubiere France Clemson Univ Dept Math Sci Clemson SC USA

We give a structural characterization of the inclusionwise minimal arc subsets whose vertices induce a subgraph containing at least one directed cycle. These arc sets arise in a linear formulation of a binary quadrati... 详细信息

关键词： Directed cycles Minimal forbidden structure Sherali-Adams's Linearization 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

Credit scoring model based on a novel group feature selection method: The case of Chinese small-sized manufacturing enterprises

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2022年第1期73卷 122-138页

作者： Zhang, Zhipeng Chi, Guotai Colombage, Sisira Zhou, Ying Dalian Univ Technol Dalian Peoples R China Federat Univ Australia Ballarat Vic Australia

In building a predictive credit scoring model, feature selection is an essential pre-processing step that can improve the predictive accuracy and comprehensibility of models. In this study, we select the optimal feature subset based on group feature selection in lieu of the individual feature selection method, to establish a credit scoring model for small manufacturing enterprises. In our methodology, we first select a group of features using the 0-1 programming method, with the objective function of maximising the Gini coefficient (GINI) of the credit score to identify the possibility of default. Then we introduce constraints to remove any redundant features in the same subset, provided they reflect the same information. Finally, we assign weights to different features according to the Gini coefficient, ensuring that the weight of the features reflects their discriminatory power. Our empirical results show that the selection of a set of features more effectively identifies default status than the individual feature selection approach. Moreover, a rating system with more features does not necessarily have better discriminatory power. As the number of features exceeds the optimum number of features selected, the system's discriminatory ability begins to decrease.

关键词： Credit scoring feature selection default discrimination Gini coefficient 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

Formulations for the maximum common edge subgraph problem

引用

DISCRETE APPLIED MATHEMATICS 2024年 346卷 115-130页

作者： de Gastines, Etienne Knippel, Arnaud Normandie Univ INSA Rouen Normandie LMI UR 3226 F-76000 Rouen France

The Maximum Common Edge Subgraph Problem (MCES), given two graphs G and H, asks about finding a maximum common subgraph between those two graphs with a maximal number of edges. We present new integer programming formulations for MCES and compare the performances of those formulations with earlier formulations from the literature.(c) 2023 Elsevier B.V. All rights reserved.

关键词： Maximum common subgraph Graph matching 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

A two-stage heuristic approach for nurse scheduling problem: A case study in an emergency department

引用

COMPUTERS & OPERATIONS RESEARCH 2014年 51卷 99-110页

作者： Wong, T. C. Xu, M. Chin, K. S. Univ Strathclyde Dept Design Mfg & Engn Management Glasgow Lanark Scotland City Univ Hong Kong Dept Syst Engn & Engn Management Hong Kong Hong Kong Peoples R China

Nurse scheduling is a critical issue in the management of emergency department. Under the intense work environment, it is imperative to make quality nurse schedules in a most cost and time effective way. To this end, a spreadsheet-based two-stage heuristic approach is proposed for the nurse scheduling problem (NSP) in a local emergency department. First, an initial schedule satisfying all hard constraints is generated by the simple shift assignment heuristic. Second, the sequential local search algorithm is employed to improve the initial schedules by taking soft constraints (nurse preferences) into account. The proposed approach is benchmarked with the existing approach and 0-1 programming. The contribution of this paper is twofold. First, it is one of a few studies in nurse scheduling literature using heuristic approach to generate nurse schedules based on Excel spreadsheet. Therefore, users with little knowledge on linear programming and computer sciences can operate and change the scheduling algorithms easily. Second, while most studies on nurse scheduling are situated in hospitals, this paper attempts to bridge the research gap by investigating the NSP in the emergency department where the scheduling rules are much more restrictive due to the intense and dynamic work environment. Overall, our approach generates satisfactory schedules with higher level of user-friendliness, efficiency, and flexibility of rescheduling as compared to both the existing approach and 0-1 programming. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Nurse scheduling Emergency department Heuristics Excel 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

Modeling the Geometry and Dynamics of the Endoplasmic Reticulum Network

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2018年第2期15卷 377-386页

作者： Lin, Congping Lemarchand, Laurent Euler, Reinhardt Sparkes, Imogen Univ Exeter Math Exeter Devon England UBO Univ Eurcipeenne Bretagne Lab STICC UMR 6285 Brest France Univ Exeter Biosci Exeter Devon England

The endoplasmic reticulum (ER) is an intricate network that pervades the entire cortex of plant cells and its geometric shape undergoes drastic changes. This paper proposes a mathematical model to reconstruct geometric network dynamics by combining the node movements within the network and topological changes engendered by these nodes. The network topology in the model is determined by a modified optimization procedure from the work (Lemarchand, et al. 2014) which minimizes the total length taking into account both degree and angle constraints, beyond the conditions of connectedness and planarity. A novel feature for solving our optimization problem is the use of "lifted" angle constraints, which allows one to considerably reduce the solution runtimes. Using this optimization technique and a Langevin approach for the branching node movement, the simulated network dynamics represent the ER network dynamics observed under latrunculin B treated condition and recaptures features such as the appearance/disappearance of loops within the ER under the native condition. The proposed modeling approach allows quantitative comparison of networks between the model and experimental data based on topological changes induced by node dynamics. An increased temporal resolution of experimental data will allow a more detailed comparison of network dynamics using this modeling approach.

关键词： Endoplasmic reticulum network dynamics 0-1 programming cutting planes

来源：评论

学校读者我要写书评

暂无评论

User-friendly random-grid-based visual secret sharing for general access structures

引用

SECURITY AND COMMUNICATION NETWORKS 2016年第10期9卷 966-976页

作者： Pang, Liaojun Miao, Deyu Lian, Chunfeng Xidian Univ Sch Life Sci & Technol State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Wayne State Univ Dept Comp Sci Detroit MI 48202 USA

Compared with the visual-cryptography-based visual secret sharing, the random-grid-based visual secret sharing (RGVSS) has some technical advantages, such as no pixel expansion and no need of codebooks. Designed based on RGVSS, the user-friendly random-grid-based visual secret sharing (UFRGVSS) not only inherits the advantages of RGVSS but also overcomes the data management problem in RGVSS by taking meaningful images as shares. Unfortunately, up to now, the existing threshold UFRGVSS schemes are only (2, 2) ones, which should use two meaningful images with complementary colors as shares. What's more, there is no feasible method to construct UFRGVSS schemes for more general threshold access structures excluding (2, 2) threshold, let alone for general access structures (GASs). Motivated by these concerns, in this paper, by stamping the gray-scale images with the shares generated from the traditional RGVSS, a novel method was proposed to design the UFRGVSS scheme for GASs, in which the resulting shares can be any meaningful gray-scale images. Experimental results show the feasibility of the proposed method by assessing its performance under different situations. Literature retrieval shows that our work may be the first attempt to construct the UFRGVSS scheme for GASs. Copyright (c) 2015 John Wiley & Sons, Ltd.

关键词： visual secret sharing general access structure random grid user-friendly 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

Design of the intelligent network segment of future mobile communication systems

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 1998年第2期11卷 79-91页

作者： Demesticha, VP Tzifa, EC Demestichas, PP Theologou, ME Natl Tech Univ Athens Div Comp Sci GR-15773 Athens Greece

Future mobile communication systems will have to provide sophisticated services at quality levels comparable with those provided by fixed systems. An additional requirement is that these systems should be deployed by minimally impacting the existing infrastructures. In this respect an important component of future mobile communication systems is their intelligent network segment, which contains the logic of the services provided and the relevant data required for providing these services. In the context of this paper we study the problem of designing this segment. Our reference system is UMTS, but the practices presented herein may be applied to other systems as well. We identify two major problems, the first at the Mobility and Services Control Point (MSCP) level and the second at the Mobility and Services Data Point (MSDP) level. Our aim in this paper is the following. First, the overall design process is decomposed into a sequence of well-defined problems. Second, the problems are formally stated and theoretically formulated. Third, owing to the computational complexity associated with the theoretical formulations, we take the first steps towards the design of approximate (heuristic) algorithms. Finally we provide results and draw subsequent conclusions. (C) 1998 John Wiley & Sons, Ltd.

关键词： UMTS intelligent network segment 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

Modeling the railway network design problem: A novel approach to considering carbon emissions reduction

引用

TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT 2017年 56卷 95-109页

作者： Lin, Boliang Liu, Chang Wang, Huijun Lin, Ruixi Beijing Jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China Natl Railway Adm China Inst Planning & Standard Beijing 100055 Peoples R China Stanford Univ Dept Elect Engn Stanford CA 94305 USA

In recent years, air pollution has become a severe environmental problem. Many countries are seeking effective methods to reduce carbon emissions. Among the sources of air pollution, the transportation industry is a large one. Thus, developing low carbon emissions transportation is a new trend. Since railway transport possesses the advantages of high volume and low emissions, a new idea for transportation development is to divert truck freights to railway by improving the capacity of the railway. Based on this situation, this paper analyzes the carbon emissions of railway and highway transport and estimates the environmental benefit of building a railway. Next, a bi-level programming model for railway network design is recommended. Different from the classical model, the opportunity cost and carbon emissions of the infeasible flows, which cannot be transported by railway and will be served by highway, are considered in the objective function, enabling the model to balance the investment and carbon emissions. To comply with the practice of railway planning, we introduced the method to deal with passenger flow, empty car flow and relationships among the links in a corridor. In the end, a numerical example is conducted to test the model and compare the final decisions when different weights are set on the carbon emissions. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Railway network design Carbon emissions Inland transportation Divert freight flow 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：