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

Chinese Control Conference

作者： Na GENG Xiaolan XIE Shanghai Jiao Tong University Ecole Nationale Superieure des Mines de Saint Etienne

ISBN: (纸本)9781467325813

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 Waiting time CTS stroke patient SLOT integer programming models first-in first-out Magnetic Resonance Imaging Room temperature Queue Stroke Patients

来源：评论

学校读者我要写书评

暂无评论

modelling and Tabu search heuristic for solving container stowage planning problem

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

引用

The 24th Chinese Control and Decision Conference (第24届中国控制与决策学术年会 2012 CCDC)

作者： Kun Li The School of Management Tianjin Polytechnic University Tianjin 300000 China

ISBN: (纸本)9781457720734

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

来源：评论

学校读者我要写书评

暂无评论

A Mathematical programming model for Optimization Problem of Production Process Based on Time Constraints in Pinggao Group Co.,Ltd.

A Mathematical Programming Model for Optimization Problem of...

引用

2011 2nd IEEE International Conference on Emergency Management and Management Sciences(ICEMMS 2011)

作者： Wu Yingfeng School of management~() Postdoctoral Workstation~() Pinggao Group Co.,Ltd.~() Xi'an,China

This paper proposes a practical problem of optimization of production process based on time constraints in Pinggao Group Co.,*** to custom's demand,it needs to complete the productive task of designated work pieces in a strict time *** practical problem is originated form the produce *** objective is to minimize the total cost of production process,satisfying the time *** this paper, the practical problem is formulated as an integer programming *** a case study,a software package（Lingo 9.0） is applied to solve the optimization problem of the production process for slave cylinder in 2 factory of Pinggao Group Co.,Ltd.

关键词： Operations research Optimization Problem of Production Process Time constraints integer programming model

来源：评论

学校读者我要写书评

暂无评论

A two-stage solving approach to vehicle routing problem with rigid time window: a scheme generating system and an integer programming model

A two-stage solving approach to vehicle routing problem with...

引用

10th World Multi-Conference on Systemics, Cybernetics and Informatics/12th International Conference on Information Systems Analysis and Synthesis

作者： Hu, Xiangpei Huang, Minfang Sun, Lijun Dalian Univ Technol Inst Syst Engn Dalian 116023 Liaoning Peoples R China

ISBN: (纸本)9789806560710

In this paper, we present a two-stage solution approach to a special VRP, which can be described as follows: all customers scattering around the depot are divided into a number of circular area;they must be satisfied within a specified time window;several kinds of vehicles are used. The objective of the first stage is to generate possible delivery schemes for each type of vehicles, in which depth-first search strategy of the state-space theory in Artificial Intelligence (AI) is used. It is remarkable that a vehicle's travel time constraint and load capacity constraint are used to control the search depth in this stage. Simultaneously, two strategies are introduced to decrease the number of feasible schemes by eliminating some worse schemes. In the second stage, an integer programming model is constructed to work out the optimal routing schemes from the first stage's outcome. Based on the proposed two-stage approach, a solving system is developed to solve the above mentioned kind of VRP. Also a real VRP case, which contains 106 customers and two kinds of vehicles, is studied to test the effectiveness and efficiency of the approach. The study creates a new way of solving this kind of NP-hard problems.

关键词： logistics management vehicle routing problem (VRP) Artificial Intelligence integer programming model

来源：评论

学校读者我要写书评

暂无评论

SEASONAL SLOT ALLOCATION PLANNING FOR A CONTAINER LINER SHIPPING SERVICE

引用

JOURNAL OF MARINE SCIENCE AND TECHNOLOGY-TAIWAN 2010年第1期18卷 84-92页

作者： Lu, Hua-An Chu, Ching-Wu Che, Pei-Yu Natl Taiwan Ocean Univ Dept Shipping & Transportat Management Chilung Taiwan

This research addresses a slot allocation planning problem of the container shipping company for satisfying the estimated seasonal demands on a liner service. We explore in detail the influenced factors of planning and construct a quantitative model for the optimum allocation of the ship's slot spaces. An integer programming model is formulated to maximize the potential profits per round trip voyage for a liner company, and a real life example of an eastern Asia short sea service has been studied. Analysis results reveal that containers with the higher contributions like reefers and 40 feet dry containers have priorities to be allocated more than others, but not all because of satisfying necessary operational constraints. Our model is not only providing a higher space utilization rate and more detailed allocation results, but also helpful for the ship size assessment in long-term planning.

关键词： slot allocation integer programming model short sea service

来源：评论

学校读者我要写书评

暂无评论

A bicriteria m-machine flowshop scheduling with sequence-dependent setup times

引用

APPLIED MATHEMATICAL modelLING 2010年第2期34卷 284-293页

作者： Eren, Tamer Kirikkale Univ Fac Engn Dept Ind Engn TR-71451 Kirikkale Turkey

In this study, a bicriteria m-machine flowshop scheduling with sequence-dependent setup times is considered. The objective function of the problem is minimization of the weighted sum of total completion time and makespan. Only small size problems with up to 6 machines and 18 jobs can be solved by the proposed integer programming model. Also the model is tested on an example. We also proposed three heuristic approaches for solving large jobs problems. To solve the large sizes problems up to 100 jobs and 10 machines, special heuristics methods is used. Results of computational tests show that the proposed model is effective in solving problems. (c) 2009 Elsevier Inc. All rights reserved.

关键词： m-Machine flowshop scheduling Bicriteria Sequence-dependent setup times integer programming model Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Optimal Deployment Plan of Emission Reduction Technologies for TxDOT’s Construction Equipment

Optimal Deployment Plan of Emission Reduction Technologies f...

引用

作者： Bari, Muhammad Ehsanul Texas A&M University

The purpose of this study was to develop and test an optimization model that will provide a deployment plan of emission reduction technologies to reduce emissions from non-road equipment. The focus of the study was on the counties of Texas that have nonattainment (NA) and near-nonattainment (NNA) status. The objective of this research was to develop methodologies that will help to deploy emission reduction technologies for non-road equipment of TxDOT to reduce emissions in a cost effective and optimal manner. Three technologies were considered for deployment in this research, (1) hydrogen enrichment (HE), (2) selective catalytic reduction (SCR) and (3) fuel additive (FA). Combinations of technologies were also considered in the study, i.e. HE with FA, and SCR with FA. Two approaches were investigated in this research. The first approach was "Method 1" in which all the technologies, i.e. FA, HE and SCR were deployed in the NA counties at the first stage. In the second stage the same technologies were deployed in the NNA counties with the remaining budget, if any. The second approach was called "Method 2" in which all the technologies, i.e. FA, HE and SCR were deployed in the NA counties along with deploying only FA in the NNA counties at the first stage. Then with the remaining budget, SCR and HE were deployed in the NNA counties in the second stage. In each of these methods, 2 options were considered, i.e. maximizing NOx reduction with and without fuel economy consideration in the objective function. Thus, the four options investigated each having different mixes of emission reduction technologies include Case 1A: Method 1 with fuel economy consideration; Case 1B: Method 1 without fuel economy consideration; Case 2A: Method 2 with fuel economy consideration; and Case 2B: Method 2 without fuel economy consideration and were programmed with Visual C++ and ILOG CPLEX. These four options were tested for budget amounts ranging from $500 to $1,183,000 and the results obta

关键词： Optimal Deployment integer programming model Emission Reduction Technologies Book Thesis

来源：评论

学校读者我要写书评

暂无评论

A modelling and Tabu Search Heuristic for a Continuous Galvanizing Line Scheduling Problem

引用

ISIJ INTERNATIONAL 2009年第3期49卷 375-384页

作者： Tang, Lixin Gao, Cong Northeastern Univ Logist Inst Liaoning Key Lab Mfg Syst & Logist Shenyang 110004 Liaoning Prov Peoples R China

In this paper, we address a continuous galvanizing line scheduling problem in a steel plant. The continuous galvanizing line we research produces principally two kinds of coils, inner galvanized coils and outer galvanized coils. Due to the technical constraints, outer coils can not be produced continuously more than a specified number and some inner coils must be inserted between outer coils. The problem is to find a schedule of all coils that minimizes the sum of changeover costs, the number of inserted inner coils and the number of transition coils used. The difficulty of solving the problem lies in the interrelation of sequencing these two kinds of coils. We formulate the scheduling problem as an integer programming model by considering above practical requirements. A heuristic based on tabu search is developed to solve the problem. The matching algorithm is used during the procedure of generating an initial solution where the optimal assignment of candidate inner coils to be inserted and positions is found by Hungarian method and then the saving step is used to reduce the number of inner coils inserted. In implementing the tabu search heuristic, intensification search, diversification search and path relinking are used to improve the effectiveness of the algorithm. 28 instances of four sizes are randomly generated to simulate the actual production data. For all the instances with 20 and 30 coils and four out of five instances with 50 coils, the tabu search heuristic finds the optimal schedules as CPLEX does. For other instances, the heuristic always obtains the better schedules and consumes much less computation time than CPLEX. In real production environment, hundreds of coils are needed to be scheduled, and the heuristic is able to generate high quality schedules within reasonable computation time.

关键词： continuous galvanizing line integer programming model tabu search

来源：评论

学校读者我要写书评

暂无评论

Investment optimization on port's development by fuzzy integer programming

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2008年第1期186卷 423-434页

作者： Allahviranloo, Mahdieh Afandizadeh, Shahriar Iran Univ Sci & Technol Dept Civil Engn Tehran Iran

In this research, the main purpose is to formulate a model to determine the optimum investment on port development from national investment prospective;on the other hand, costs and benefits are calculated from consumer and investor's viewpoint. The formulated model is an integer-programming model. The emphasis is on how to formulate an investment optimization problem where cargo operation, investment costs, cargo-handling capacity, cargo transportation network, and the world maritime fleet constraints are included. Fuzzy numbers are used for cargo forecast study results. The output of the model is the type of design ships and design berths which are needed in each sub period, so that the port planner (the government) will find out the optimum development plan of port in each sub period when there is uncertainty in cargo handling forecast (fuzzy numbers). (c) 2007 Elsevier B.V. All rights reserved.

关键词： investment container terminals fuzzy logic integer programming model port development

来源：评论

学校读者我要写书评

暂无评论

A bicriteria flowshop scheduling with a learning effect

引用

APPLIED MATHEMATICAL modelLING 2008年第9期32卷 1719-1733页

作者： Eren, Tamer Guner, Ertan Kirikkale Univ Fac Engn Dept Ind Engn TR-71450 Kirikkale Turkey Gazi Univ Fac Engn & Architecture Dept Ind Engn TR-06570 Ankara Turkey

In many situations, a worker's ability improves as a result of repeating the same or similar tasks;this phenomenon is known as the learning effect. In this paper the learning effect is considered in a two-machine flowshop. The objective is to find a sequence that minimizes a weighted sum of total completion time and makespan. Total completion time and makespan are widely used performance measures in scheduling literature. To solve this scheduling problem, an integer programming model with n(2) + 6n variables and 7n constraints where n is the number of jobs is formulated. Because of the lengthy computing time and high computing complexity of the integer programming model, the problem with up to 30 jobs can be solved. A heuristic algorithm and a tabu search based heuristic algorithm are presented to solve large size problems. Experimental results show that the proposed heuristic methods can solve this problem with up to 300 jobs rapidly. According to the best of our knowledge, no work exists on the bicriteria flowshop with a learning effect. (c) 2007 Elsevier Inc. All rights reserved.

关键词： flowshop scheduling bicriteria scheduling learning effect makespan completion time integer programming model heuristic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：