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

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2009)

作者： Yan, Hao-yun Li, Hong-yu Shanghai Dian Ji Univ Dept Ind Engn Shanghai Peoples R China Fudan Univ Dept Management Sci Shanghai Peoples R China

ISBN: (纸本)9781424448692

Order Review and Release (ORR) is a comprehensive approach to job-shop scheduling. Load-Oriented Manufacturing Control (LOMC) is an effective ORR method, and it restricts the workload of workstations by periodically release right orders into workshop. When selecting orders, "balancing workload" and "meeting order due date" are two contradict objectives. LOMC puts more emphasis on the latter. However, previous studies show that "balancing workload" is quite important, and priority should be given to "balancing workload" when order due dates show small difference. So it improves the order release procedure of LOMC by applying a 0-1 integer programming model to coordinate the two objectives delicately. The new method is named ILOMC (integer-programming-model-based LOMC). Simulation experiments have been carried out to compare LOMC and ILOMC. Simulation results show that ILOMC outperforms LOMC as it can better balance workload.

关键词： integer programming model LOMC ORR

来源：评论

学校读者我要写书评

暂无评论

A Pre-Determined Nodes Deployment Strategy of Two-Tiered Wireless Sensor Networks Based on Minimizing Cost

引用

INTERNATIONAL JOURNAL OF WIRELESS INFORMATION NETWORKS 2014年第2期21卷 114-124页

作者： Fan, Tiegang Teng, Guifa Huo, Limin Agr Univ Hebei Coll Mech & Elect Engn Baoding 071001 Peoples R China Hebei Univ Coll Math & Comp Baoding 071002 Peoples R China Agr Univ Hebei Grad Sch Baoding Peoples R China Agr Univ Hebei Coll Mech & Elect Engn Baoding Peoples R China

Nodes deployment is a fundamental factor in determining the connectivity, coverage, lifetime and cost of wireless sensor networks. In this paper, a two-tiered wireless sensor networks consisting of sensor clusters and a base station is considered. Within a sensor cluster, there are many sensor nodes and a relay node. We focus on the deployment strategy for sensor nodes and relay nodes to minimize cost under some constraints. Several means are used. The regular hexagonal cell architecture is employed to build networks. Based on the analysis of energy consumption of sensors and cost of network, an integer programming model is presented to minimize the cost. By the model, number of layers of sensor cluster is determined. In order to balance the energy consumption of sensors on the identical layer, a uniform load routing algorithm is used. The numerical analysis and simulation results show that the waste of energy and cost of wireless sensor networks can be effectively reduced by using the strategy.

关键词： Nodes deployment strategy Two-tiered wireless sensor networks Cost per unit area integer programming model

来源：评论

学校读者我要写书评

暂无评论

Mathematical modelling of metric-driven routing and resource allocation in wireless mesh networks 16

Mathematical modelling of metric-driven routing and resource...

引用

16th International Telecommunications Network Strategy and Planning Symposium (Networks)

作者： Li, Yuan Pioro, Michal Angelakis, Vangelis Yuan, Di Fragkiadakis, Alexandros Lund Univ Dept Elect & Informat Technol Lund Sweden Warsaw Univ Technol Inst Telecommun Warsaw Poland Linkoping Univ Dept Sci & Technol Norrkoping Sweden Fdn Res & Technol Hellas FORTH ICS Inst Comp Sci Iraklion Greece

ISBN: (纸本)9781479965151

The traditional routing protocols used in wireless mesh networks like AODV are not very efficient since the number of hops to a destination is mainly considered as the routing metric. This may lead to shorter paths;however, the throughput can decrease when traffic is routed through those paths. Various contributions have proposed different metrics or completely different routing algorithms. Nevertheless, for many of these metrics, real-time network performance monitoring is required, increasing their overhead, while the implementation of many of the proposed routing protocols is not feasible in practice because of their complexity. In this paper, we aim to optimize link metrics together with routing. We preserve the shortest path routing principle but with optimizing the link metrics;thus, combining the shortest path algorithm's low overhead with an optimized link metrics scheme. We present a two-phase scheme for the considered problem. During the first phase, we seek for the optimal link scheduling for minimizing the required time slots and then, in the second phase, we present a mixed integer programming model for metric-driven routing design. For comparison, we also present the optimization models for global optimized routing and shortest-hop routing, providing numerical results.

关键词： wireless mesh networks routing link scheduling resource allocation integer programming model

来源：评论

学校读者我要写书评

暂无评论

Optimizing the High Speed Train Stop Schedule Using Flexible Stopping Patterns Combination

Optimizing the High Speed Train Stop Schedule Using Flexible...

引用

IEEE International Conference on Intelligent Transportation Systems

作者： Xin Zhang Huiling Fu Lu Tong Sch. of Traffic & Transp. Beijing Jiaotong Univ. Beijing China

ISBN: (纸本)9781479960798

This paper presents an integrated train stop schedule optimization method combines with a crucial integer programming model in the context of high speed railway. The model tries to determine the train stops sequence along the train route, and the goal is minimizing the total seat-kilometers of unoccupied train-set seats. The integrated optimization method, in addition, optimizes a flexible train stopping patterns combination by using the model in a hierarchical way. A case study is conducted for a real-world instance of the Beijing-Shanghai high speed railway in China to verify the effectiveness of the method.

关键词： integer programming rail traffic scheduling Beijing-Shanghai high speed railway flexible stopping patterns combination high speed train stop schedule integer programming model integrated optimization method train route train stop schedule optimization method Educational institutions Linear programming Optimization methods Rail transportation Schedules

来源：评论

学校读者我要写书评

暂无评论

Solution method for the location planning problem of logistics park with variable capacity

引用

COMPUTERS & OPERATIONS RESEARCH 2013年第1期40卷 406-417页

作者： Tang, Jianxun Tang, Lixin Wang, Xianpeng Northeastern Univ Logist Inst Liaoning Key Lab Mfg Syst & Logist Shenyang 110819 Peoples R China

In this paper we study a logistics park location planning problem in which the capacity of the logistics park is determined by the sectors used to establish it in an open site. Since the size of each sector is not necessarily the same in every potential site, the capacity of the logistics park is thus variable, which makes this problem different from the traditional location problems in which the capacity of each facility is fixed. The task of this problem is to determine the location of the logistics parks, the sectors to be used to establish the logistics park in each open site, and the allocation of customers to the established logistics parks so as to minimize the total costs for establishing the logistics parks and supplying the demands of customers. The size mode is introduced to deal with the nonlinear establishment cost function and consequently this problem is formulated as an integer linear programming (ILP) model. Since CPLEX can only solve the ILP model with small-size problems, a tabu search (TS) hybrid with filter and fan (F&F) is presented to obtain near optimal solutions. In the hybrid algorithm, the IS is used to improve the solution by changing the allocation of customers to open sites while the F&F is used to further improve the solution by adjusting the status of sites (i.e., open or closed). In addition, an elite solution pool is constructed to store good solutions found in the searching history. Whenever the hybrid algorithm is trapped in local minima, a new start solution will be generated from the elite pool so as to improve the search diversity. To evaluate the performance of the proposed hybrid TS method, the column generation (CG) method with an acceleration strategy is developed to provide tight lower bounds. Computational results showed that the proposed hybrid algorithm can obtain optimal solutions for most of the small size problems and satisfactory near-optimal solutions with comparison to lower bounds for large size problems. (C) 201

关键词： Location planning problem Variable capacity Logistics park integer programming model Hybrid metaheuristic Column generation

来源：评论

学校读者我要写书评

暂无评论

Application of Particle Swarm Algorithm in Train-Set Circulation Problem of China

引用

2nd International Conference on Civil Engineering and Transportation (ICCET 2012)

作者： Li, Hua Han, Baoming Lu, Fang Li, Xiaojuan Beijing Jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China

ISBN: (纸本)9783037855645

Train-set circulation problem is an important issue in operations of high-speed passenger trains in the world. On the basis of characteristics of the train-set circulation problem in China, an integer programming model is presented without considering distinct train-set types. With redefinitions of some basic mathematical objects and operations, an improved particle swarm optimization algorithm is proposed to solve the model. The algorithm is applied in a real-life case study based on the timetable of the Wuhan-Guangzhou High-speed Railway Line. The results show that the proposed algorithm is effective to find the optimized train-set circulation plan.

关键词： train-set circulation integer programming model improved particle swarm algorithm

来源：评论

学校读者我要写书评

暂无评论

Simulation Study of Magnetic Resonance Imaging Examination Reservation Processes for Stroke Patients

Simulation Study of Magnetic Resonance Imaging Examination R...

引用

31st Chinese Control Conference

作者： Geng, Na Xie, Xiaolan Shanghai Jiao Tong Univ Shanghai 200240 Peoples R China Ecole Natl Super Mines F-42023 St Etienne 2 France

ISBN: (纸本)9789881563811

The timely imaging examinations are most important for stroke patients to have the further appropriate diagnosis and treatment. We have proposed a contract-based Magnetic Resonance Imaging (MRI) reservation process in [1] in order to reduce their waiting time for MRI examinations. Contracted time slots (CTS) are especially reserved for stroke patients. Regular time slots (RTS) assignment policy is to assign some "unlucky" patients to RTS by keeping CTS queue length below a certain threshold. We further propose a reservation process in [2] in order to reduce the waiting time of these "unlucky" patients by utilizing the virtual CTS queue. RTS assignment policy is used to reserve additional RTS instead of assigning specific patients directly to RTS. This paper proposes a new reservation process without the virtual CTS queue. All times slots including CTS and RTS are used on FIFO (First In First Out) order. Computational results show that the improved method can greatly reduce the maximal waiting time and the deviation of average waiting time.

关键词： Reservation process Contracted time slots Regular time slots integer programming model

来源：评论

学校读者我要写书评

暂无评论

modelling and Tabu search heuristic for solving container stowage planning problem

Modelling and Tabu search heuristic for solving container st...

引用

24th Chinese Control and Decision Conference (CCDC)

作者： Li, Kun Tianjin Polytech Univ Sch Management Tianjin 300000 Peoples R China

ISBN: (纸本)9781457720727

The container stowage planning problem (CSPP) presented in this paper considers the task of loading containers into the containership with a set of structural and operational restrictions. We formulate this problem as an integer programming model to minimize the number of shift, the total loading time and the weight difference between maximum loaded bay and minimum loaded bay. For solving this problem, we decompose this problem into former subproblem and latter subproblem and solving two subproblems orderly to obtain the initial solutions. Based on this initial solution, the tabu search algorithm with diverse neighborhoods and diversification strategy are proposed. The experimental results comparing with CPLEX show that the proposed mathematical model and the tabu search algorithm can obtain better solutions than CPLEX in an allowable time and resolve the problem more effectively than current plan operator.

关键词： container stowage planning problem integer programming model tabu search

来源：评论

学校读者我要写书评

暂无评论

models Responding to Large-area Flight Delays in Aviation Production Engineering

引用

Systems Engineering Procedia 2012年 5卷 68-73页

作者： Mingang Gao Hong Chi Yuzhen Hu Baoguang Xu Institute of Policy and Management Chinese Academy of Science Beijing 100190

Large-area flight delays have a serious impact on aviation safety and bring huge losses to airlines. Flight reschedulling is a classic aviation production engineering. Based on flight priority levels, models are built responding to large-area flight delays in this paper. The models adopt different rescheduling rules to flights in different status. Meanwhile they take the restraint of connection of flights and surplus flight time of IA flights (flights in the air) into account, which makes the model accord with practical situation. A case study is given which demonstrate the Effectiveness of the models. The models provide significant theoretical basis to airline flight rescheduling.

关键词： Aviation production engineering Large-area flight delays Flight rescheduling integer programming model

来源：评论

学校读者我要写书评

暂无评论

Simulation Study of Magnetic Resonance Imaging Examination Reservation Processes for Stroke Patients

Simulation Study of Magnetic Resonance Imaging Examination R...

引用

第三十一届中国控制会议

作者： Na GENG~1,Member,IEEE,Xiaolan XIE~(1,2),Senior Member,IEEE 1.Shanghai Jiao Tong University,Shanghai,200240,China 2.Ecole Nationale Superieure des Mines de Saint Etienne,42023 Saint-Etienne cedex 2 France

The timely imaging examinations are most important for stroke patients to have the further appropriate diagnosis and *** have proposed a contract-based Magnetic Resonance Imaging(MRI) reservation process in[1]in order to reduce their waiting time for MRI *** time slots(CTS) are especially reserved for stroke *** time slots(RTS) assignment policy is to assign some "unlucky" patients to RTS by keeping CTS queue length below a certain *** further propose a reservation process in[2]in order to reduce the waiting time of these "unlucky" patients by utilizing the virtual CTS *** assignment policy is used to reserve additional RTS instead of assigning specific patients directly to *** paper proposes a new reservation process without the virtual CTS *** times slots including CTS and RTS are used on FIFO(First In First Out) *** results show that the improved method can greatly reduce the maximal waiting time and the deviation of average waiting time.

关键词： Reservation process Contracted time slots Regular time slots integer programming model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：