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

IEEE International Conference on Systems, Man and Cybernetics

作者： D.E. Kaufman J. Nonis R.L. Smith Department of Industrial and Operations Engineering University of Michigan Ann Arbor MI USA

The authors propose a new model for dynamic traffic assignment, modeling the traffic system by a mixed integer linear program solvable in finite time. The model represents link travel times, which must be the same for all vehicles which enter a link together during a single time period by means of 0-1 integer variables. Given the values of these variables, the problem is to assign traffic, modeled as multiperiod multicommodity flow, subject to constraints on capacity implied by the link travel times. An optimal solution to the model gives the vehicle routings corresponding to minimum total travel time, achieving the most efficient use of road capacity. The solution gives unambiguous link travel times as a function of time of entry to the link, suitable for individual route optimization if all but a small priority class of traffic accepts the system-optimal routing.< >

关键词： mixed integer linear programming Dynamic programming Vehicle dynamics Vehicles Traffic control Telecommunication traffic Road transportation Network topology Upper bound Impedance

来源：评论

学校读者我要写书评

暂无评论

STATIC AND DYNAMIC LAYOUT PROBLEMS WITH VARYING AREAS

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 1994年第1期45卷 59-69页

作者： LACKSONEN, TA OHIO UNIV DEPT IND & SYST ENGNATHENSOH 45701 USA

This paper describes a two-step algorithm for solving the layout problem while assuming the departments can have varying areas. The first step solves a quadratic assignment problem formulation of the problem using a heuristic cutting plane routine. The second step solves a mixed-integer linear programming problem to find the desired block diagram layout. The algorithm incorporates two concepts to make the solutions more practical. First, rearrangement costs are simultaneously considered along with flow costs in solving a dynamic layout problem involving multiple time periods. It is the only algorithm to solve a general dynamic layout problem with varying department areas. Second, regular department shapes are maintained by requiring all departments to be rectangular. Its formulation for doing this is more efficient than previous algorithms.

关键词： mixed integer linear programming FACILITIES LAYOUT DYNAMIC LAYOUTS

来源：评论

学校读者我要写书评

暂无评论

EQUIPMENT SELECTION AND MACHINE SCHEDULING IN GENERAL MAIL FACILITIES

引用

MANAGEMENT SCIENCE 1994年第8期40卷 1049-1068页

作者： JARRAH, AIZ BARD, JF DESILVA, AH UNIV TEXAS DEPT MECH ENGNGRAD PROGRAM OPERAT RES & IND ENGNAUSTINTX 78712 PLANMAT INC BETHESDAMD 20817 GEORGETOWN UNIV SCH BUSINESS ADMWASHINGTONDC 20057

With the goal of fiscal self-sufficiency, the United States Postal Service (USPS) has embarked upon a 10-year program to modernize, and in some cases radically alter, the way it manages and processes the mail. At the heart of this effort is the goal of automating virtually all of the letter mail by 1995. This means reading, sorting, and then sequencing each mail piece to the order in which it will be delivered by the carrier with only a minimum of manual labor. In support of this goal, a series of long-term planning models has been developed to help select equipment and plan for its use at the more than 250 general mail facilities (GMF) throughout the nation. This paper reports on one of the central studies underlying this effort. Because of the size and complexity of the facility design problem, a hierarchical approach was followed. Three interrelated models were developed starting with a mixed integer linear program to derive equipment needs and initial machine schedules. The latter are post-processed in two stages to produce implementable schedules that reflect current practice. An auxiliary linear program and a heuristic were constructed for this purpose. The models and analysis conducted are demonstrated with data obtained from the Providence GMF. The results indicate that near optimal solutions can be found quite efficiently and are expected to lead to substantial savings over the 10-year planning horizon.

关键词： FACILITY PLANNING EQUIPMENT SELECTION mixed integer linear programming MACHINE SCHEDULING LARGE SCALE SYSTEMS POSTAL OPERATIONS

来源：评论

学校读者我要写书评

暂无评论

Inventory minimization and production scheduling: the case of a large Hong Kong company

引用

International Transactions in Operational Research 1994年第3期1卷 271-283页

作者： Chu, Sydney C.K. University of Hong Kong Hong Kong Hong Kong

The background of this study is a rather classical but complex inventory control/production planning/line scheduling problem of a major soft-drink company in Hong Kong. The issue that stands out for this many-product high-sales manufacture is the storage space of its central warehouse, which often finds itself in the state of overflow or near capacity with finished goods and work-in-process inventory. This phenomenon can create immediate interruptions of production, capital tie-ups and subsequent potential of lost saales. Another obviously important concern is the meeting of forecast demands. A mathematical modelling approach that entails techniques of multi-period aggregate optimization is proposed to tackle the overall problem. The dual objectives are to achieve better production planning and line scheduling in order to minimize inventory build-up maximize demand satisfaction. Numerical results for a sample problem are reported as an illustration to this proposed two-phase approach. © 1994.

关键词： inventory control line scheduling linear programming mixed integer linear programming multi-period optimization production planning

来源：评论

学校读者我要写书评

暂无评论

A sub-optimal assignment of application tasks onto heterogeneous systems

A sub-optimal assignment of application tasks onto heterogen...

引用

Heterogeneous Computing Workshop

作者： J.C. DeSouza-Batista M.M. Eshaghian A.C. Parker S. Prakash Y.C. Wu Department of Electrical Engineering-Systems University of Southern California Los Angeles CA USA New Jersey Institute of Technology Newark NJ USA IBM Corporation Poughkeepsie NY USA

Presents a mathematical programming model for finding the sub-optimal assignment of a given application task onto a heterogeneous suite of computers. The proposed model is based on the Cluster-M heterogeneous programming paradigm. Using Cluster-M, an application task is represented in form of a Cluster-M specification which indicates all the concurrent and communicating subtasks at every step of computation. These specifications are then to be mapped onto the underlying heterogeneous suite of computers represented in a Cluster-M representation format. To map every step of Cluster-M specification onto the Cluster-M representation of the heterogeneous suite, we propose to use an optimal synthesis technique called SOS (synthesis of systems). We formulate and solve each of the mapping steps in the form of a mixed integer linear programming model. This leads to a very fast sub-optimal selection and mapping solution.< >

关键词： Application software Concurrent computing Mathematical model mixed integer linear programming Parallel processing Information science Costs Ear Heuristic algorithms Annealing

来源：评论

学校读者我要写书评

暂无评论

A mathematical model for configuration planning of multi-beam satellites with heterogeneous service classes

A mathematical model for configuration planning of multi-bea...

引用

Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference

作者： F. Yegenoglu Yao Gao T. Lua Intelsat Limited Washington D.C. DC USA INTELSAT Washington DC USA

Develops a mixed integer linear programming (MIP) model for determining the connectivities of a multi-beam satellite and for distributing the traffic among transponders. The optimization objectives include evenly distributing traffic among transponders (satellite beams) and minimizing the number of active transponders. The model handles a variety of service classes each with different requirements simultaneously. The major inputs to the model are the heterogeneous traffic matrix, beam inter-connection capabilities of transponders and their capacities, and beam coverages. The outputs are the transponder switch settings and a traffic assignment plan. The traffic assignment plan indicates what portion of the traffic originating from one region and destined to another should be assigned to each transponder.< >

关键词： Mathematical model Switches Traffic control Transponders Channel bank filters mixed integer linear programming Satellite ground stations Time division multiple access linear programming Satellite communication

来源：评论

学校读者我要写书评

暂无评论

Min-max linear programming and the timing analysis of digital circuits

Min-max linear programming and the timing analysis of digita...

引用

IEEE International Conference on Computer-Aided Design

作者： T.M. Burks K. Sakallah University of Michigan USA

This paper discusses a mathematical optimization problem with a number of applications in the timing analysis of synchronous and asynchronous circuits. This problem, which we call min-max linear programming (mmLP), involves the solution of linear programs that have min and max functions added to their constraints. Instances of problem mmLP are described, and a simple proof of NP-completeness is given. Two alternate methods are presented for mmLP solution. The first uses a branch-and-bound algorithm which is optimized to specifically reduce the number of operations required by the simplex linear programming algorithm. The second uses a transformation to a standard mixed integer linear programming (MILP) formulation. We evaluate both approaches on a variety of problems, including several large previously unsolved optimal clocking problems.

关键词： linear programming Timing Circuit analysis Digital circuits Clocks Asynchronous circuits Vectors Delay Latches mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A polynomial-time algorithm for designing digital filters with power-of-two coefficients

A polynomial-time algorithm for designing digital filters wi...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： D. Li J. Song Y.C. Lim Department of Electrical Engineering National University of Singapore Singapore

ISBN: (纸本)0780312813

An algorithm is presented for designing digital filters with coefficients expressible as sums of signed power-of-two (SPT) terms. For each filter gain, the time complexity of the algorithm is a second-order polynomial in the filter order and is a first-order polynomial in the filter wordlength. Unlike conventional methods where each coefficient is allocated a fixed number of SPT terms, the author's method allows the number of SPT terms for each coefficient to vary subject to the number of SPT terms for the entire filter. This provides the possibility of finding a better filter without increasing the number of adders, which determines the realization cost for a given filter length. Application of the algorithm to finite impulse response (FIR) filter designs shows that it achieves up to 8.9 dB improvement over simulated annealing and mixed integer linear programing on the normalized peak ripples of example filters.< >

关键词： Polynomials Algorithm design and analysis Digital filters Finite impulse response filter Simulated annealing Nonlinear filters Extraterrestrial measurements Costs mixed integer linear programming Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

Module selection and scheduling using unrestricted libraries

Module selection and scheduling using unrestricted libraries

引用

European Conference on Design Automation

作者： A.H. Timmer M.J.M. Heijligers L. Stok J.A.G. Jess Department of Electrical Engineering Design Automation Section Eindhovan University of Technology Eindhoven Netherlands IBM Thomas J. Watson Research Center Yorktown Heights NY USA

Most high-level synthesis schedulers are capable only of mapping an operation to one specific module type. To ensure a full design space exploration, a synthesis system should however select freely from a library containing modules with a large variety in delay, area and so on. A module selection and scheduling approach which allows the full use of such unrestricted libraries is presented. Extensive benchmark results show very fast running times and optimal solutions. This approach clearly illustrates the advantages of synthesis tools which can fully cope with unrestricted libraries, as they lead to designs with less module area.< >

关键词： Libraries Space exploration Delay High level synthesis Space technology Design automation Flow graphs Hardware mixed integer linear programming Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Scheduling Coast Guard district cutters

Scheduling Coast Guard district cutters

引用

作者： Robert A. Farmer Naval Postgraduate School

学位级别：硕士

The United States Coast Guard is organized by Atlantic and Pacific areas, which are further subdivided into districts. Each district assigns cutters (ships) of length 180 feet or less into weekly statuses. The resulting cutter schedules reflect the district's level of readiness to respond to such emergencies as search and rescue, law enforcement, and pollution response. The First Coast Guard District has one of the largest scheduling problems, assigning each of 16 cutters to one of six weekly statuses. The First District's quarterly schedules must adhere to a number of guidelines which ensure patrol coverage, enforce equitable distribution of patrols, and restrict consecutive cutter statuses. This thesis formulates and solves the quarterly scheduling problem as an elastic mixed integer linear program. Face valid schedules, which are superior to actual schedules for all measures of effectiveness considered, are obtained within 15 minutes on a 486/33 Mhz personal computer using a commercially available integer programming solver.

关键词： Ship Scheduling mixed integer linear programming Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：