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

管理科学 2018年第7期 734-742页

作者：赵顺晶龙建成丁建勋石琴

停车换乘作为交通需求管理措施的一个重要手段，可以有效缓解城市中心区的交通拥堵以及城市停车问题。合理的停车换乘设施选址和停车费用都将大大提高停车换乘设施的作用和完善整个城市交通系统的功效。本文以通勤廊道的停车换乘系统为... 详细信息

停车换乘作为交通需求管理措施的一个重要手段，可以有效缓解城市中心区的交通拥堵以及城市停车问题。合理的停车换乘设施选址和停车费用都将大大提高停车换乘设施的作用和完善整个城市交通系统的功效。本文以通勤廊道的停车换乘系统为对象，分别考虑政府经营和企业经营两种模式，提出了双层规划模型来描述停车换乘条件下停车换乘选址及停车费用优化问题。基于灵敏度分析的方法，提出了分支定界算法求解提出的双层规划模型。采用数值算例验证了提出的模型和算法的有效性。该研究可以为从成本与收益的角度对停车换乘设施的建设方案的评价提供决策支持，对停车换乘系统的发展和规划具有理论指导意义。

关键词：停车换乘双层规划随机用户平衡分支定界　　park and ride bi-level programming stochastic user equilibrium branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A MULTI-MODE PROJECT SCHEDULING PROBLEM WITH A SINGLE NONRENEWABLE RESOURCE

A MULTI-MODE PROJECT SCHEDULING PROBLEM WITH A SINGLE NONREN...

引用

作者： CANSU ALTINTAS MIDDLE EAST TECHNICAL UNIVERSITY

学位级别：硕士

In this thesis, we consider a multi-mode project scheduling problem with a single nonrenewable resource. We assume that the resource is released in pre-specified times at pre-specified quantities and the resource is consumed at activity completions. The activities can be processed at different modes where a mode is defined by a processing time and a resource requirement amount. Our problem is to select the modes and timings of the activities so as to minimize the project completion time. We develop a mixed integer linear model and present a branch and bound algorithm. The results of our experiments have revealed that the mathematical model can handle only small-sized problem instances with up to 20 tasks and branch and bound algorithm can solve problem instances with up to 100 tasks for some resource release profiles.

关键词： Project scheduling Multiple modes Nonrenewable Resource branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

The 0-1 Multiple Knapsack Problem

The 0-1 Multiple Knapsack Problem

引用

作者： Hayat Abdullah Shamakhai Laurentian University

学位级别：硕士

In operation research, the Multiple Knapsack Problem (MKP) is classified as a combinatorial optimization problem. It is a particular case of the Generalized Assignment Problem. The MKP has been applied to many applications in naval as well as financial management. There are several methods to solve the Knapsack Problem (KP) and Multiple Knapsack Problem (MKP); in particular the bound and bound algorithm (B&B). The bound and bound method is a modification of the branch and bound algorithm which is defined as a particular tree-search technique for the integer linear programming. It has been used to obtain an optimal solution. In this research, we provide a new approach called the Adapted Transportation algorithm (ATA) to solve the KP and MKP. The solution results of these methods are presented in this thesis. The Adapted Transportation algorithm is applied to solve the Multiple Knapsack Problem where the unit profit of the items is dependent on the knapsack. In addition, we will show the link between the Multiple Knapsack Problem (MKP) and the multiple Assignment Problem (MAP). These results open a new field of research in order to solve KP and MKP by using the algorithms developed in transportation.

关键词： Generalized Assignment Problem Assignment Problem Knapsack problem Multiple Knapsack Problem branch and bound algorithm bound and bound algorithm Transportation Problem Multiple Assignment Problem Adapted Transportation Problem Vogel Approximation Method Group Role Assignment problem

来源：评论

学校读者我要写书评

暂无评论

A two-stage stochastic optimization model for the transfer activity choice in metro networks

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2016年 83卷 271-297页

作者： Yang, Lixing Zhang, Yan Li, Shukai Gao, Yuan Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China

This research focuses on finding the best transfer schemes in metro networks. Using sample-based time-invariant link travel times to capture the uncertainty of a realistic network, a two-stage stochastic integer programming model with the minimized expected travel time and penalty value incurred by transfer activities is formulated. The first stage aims to find a sequence of potential transfer nodes (stations) that can compose a feasible path from origins to destinations in the transfer activity network, and the second stage provides the least time paths passing by the generated transfer stations in the first stage for evaluating the given transfer schemes and then outputs the best routing information. To solve our proposed model, an efficient hybrid algorithm, in which the label correcting algorithm is embedded into a branch and bound searching framework, is presented to find the optimal solutions of the considered problem. Finally, the numerical experiments are implemented in different scales of metro networks. The computational results demonstrate the effectiveness and performance of the proposed approaches even for the large-scale Beijing metro network. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Transfer activity scheme Two-stage stochastic programming model branch and bound algorithm Label correcting algorithm

来源：评论

学校读者我要写书评

暂无评论

COMPARISON OF ROUTING algorithmS FOR STORAGE AND RETRIEVAL MECHANISM IN CYLINDRICAL AS/RS

引用

TRANSPORT 2016年第1期31卷 11-21页

作者： Janilionis, Vytautas V. Bazaras, Zilvinas Janilionis, Vytautas [a] Dept of Transport Engineering Kaunas University of Technology Kaunas Lithuania[b] Dept of Applied Mathematics Kaunas University of Technology Lithuania

The objective of this research is to propose new routing algorithms for the Storage and Retrieval Mechanism (SRM) in the Cylindrical Automated Storage and Retrieval System (C-AS/RS) and contribute to the system conceptualization by investigating the maximum achievable retrieval request rates for different routing algorithms and system parameters. For this purpose, flexible and detailed simulation model was developed and investigated for 2 SRM types, 3 routing algorithms and a feasible set of system movement and load transfer time parameters. Based on the simulation output, the regression models for different SRM types and routing algorithms were developed for predicting the maximum retrieval request rate. The differences of the average maximum retrieval request rate were evaluated for various system configurations and routing algorithms. The alternative to optimal routing algorithm was proposed, reducing the system performance only by 1.4?÷?2.4% on average, but requiring significantly less calculations when planning the SRM tour. In addition, the system analysis indicated that SRM vertical velocity and load transfer time have the highest impact on the system performance and for different SRM types the average maximum retrieval request rates differ by 22.2?÷?31.8%.

关键词： cylindrical automated storage and retrieval system routing algorithm branch and bound algorithm automated warehouse simulation regression analysis

来源：评论

学校读者我要写书评

暂无评论

Artificial IntelligenceVersus Exact Methods via Inverse Logistics: a Comparative Study 28

Artificial IntelligenceVersus Exact Methods via Inverse Logi...

引用

28th International Business-Information-Management-Association Conference

作者： Ellili, Walid Samet, Mounir Kachouri, Abdennaceur Univ Sfax Lab LETI ENIS BP 1173 Sfax 3038 Tunisia

ISBN: (纸本)9780986041983

The present work is proposed to establish a comparative study between the exact method, namely, the algorithm branch and bound, in respect of the artificial intelligence approaches (the genetic algorithms as well as the neural ones). The purpose is to highlight the artificial intelligence noticeable performance in solving the multi- product and multi- period model through the above-mentioned method, with the aim of providing a solution for the reverse logistics' site-localization problem regarding end-of-life products. For the sake of reaching, a solution within a reasonable tune, however, the genetic algorithm and neural network have displayed a remarkable ability to effectively solve the problem, as considered in relation to the assessment and sorting or separation procedure (branch and bound algorithm), constructed within a CPLEX shopping solver. In addition, a comparative study between the three methods is going to be established.

关键词： Genetic algorithm branch and bound algorithm CPLEX Neural Network

来源：评论

学校读者我要写书评

暂无评论

Computational Approaches for Efficient Scheduling of Steel Plants as Demand Response Resource 19

Computational Approaches for Efficient Scheduling of Steel P...

引用

19th Power Systems Computation Conference (PSCC)

作者： Zhang, Xiao Hug, Gabriela Kolter, Zico Harjunkoski, Iiro Carnegie Mellon Univ Elect & Comp Engn Pittsburgh PA 15213 USA Swiss Fed Inst Technol Informat Technol & Elect Engn Zurich Switzerland Carnegie Mellon Univ Comp Sci Pittsburgh PA 15213 USA ABB Corp Res Ladenburg Germany

ISBN: (纸本)9788894105124

Demand response is seeing increased popularity worldwide and industrial loads are actively taking part in this trend. As a host of energy-intensive industrial processes, steel plants have both the motivation and potential to provide demand response. However, the scheduling of steel plants is very complex and the involved computations are intense. In this paper, we focus on these difficulties and propose methods such as adding cuts and implementing an application-specific branch and bound algorithm to make the computations more tractable.

关键词： branch and bound algorithm mixed integer programming demand response steel plant scheduling resource task network

来源：评论

学校读者我要写书评

暂无评论

Dynamic Power Adjustment and Resource Allocation Framework for LTE Networks 21

Dynamic Power Adjustment and Resource Allocation Framework f...

引用

21st IEEE International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)

作者： Secinti, Gokhan Ozcevik, Muge Erel Chowdhury, Kaushik R. Canberk, Berk Istanbul Tech Univ Dept Comp Engn Istanbul Turkey Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA

ISBN: (纸本)9781509025589

In current LTE deployments, the unsupervised and unilateral installation of home or localized base stations, so called eNodeBs, may easily lead to excessive energy consumption and over-provisioning of network infrastructure. In this paper, we propose an energy efficient framework, which dynamically adjusts the power requirements of the system and performs Resource Block (RBs) allocation based on needs. It specifically optimizes power consumption of LTE networks consisting of under-utilized eNodeBs. The Energy Efficiency (EE) issue is formulated as an optimization problem, which trades off EE for SE without adversely impacting the downlink throughput. In order to solve this problem, we develop a heuristic approach called as Two Phase Enhanced branch and bound algorithm (TPEBB) [1]. End-to-end latency, modeled by Markov queues, is used as the main metric for QoS in this study [2]. Finally, we compare the proposed framework with various competing methods to show almost 70% improvement in EE and end-to-end latency.

关键词： Power Adjustment Resource Allocation Co-tier Interference Energy Efficiency branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Automatic Segmentation of Cell Candidate Regions in Microscopy Images Based on an Optimization algorithm 16

Automatic Segmentation of Cell Candidate Regions in Microsco...

引用

16th International Conference on Control, Automation and Systems (ICCAS)

作者： Tsuji, Kouki Tan, Joo Kooi Kim, Hyoungseop Yoneda, Kazue Tanaka, Fumihiro Kyushu Inst Technol Grad Sch Engn 1-1 Sensui Cho Kitakyushu Fukuoka 8048550 Japan Univ Occupat & Environm Hlth Sch Med Dept Surg 2 Kitakyushu Fukuoka Japan

ISBN: (纸本)9788993215120

Circulating tumor cells (CTCs) is an informative biomarker which assists pathologists in early diagnosis and evaluating therapeutic effects of patients with malignant tumors. The blood from a cancer patient is analyzed by a microscope and a large number of pictures including many cells are generated for each case. Thus, analyzing them is timeconsuming work for pathologists, and misdiagnosis may happen since the diagnosis of CTCs tends to depend on the individual skill of pathologist. In this paper, we propose a method which detects cell candidate regions in microscopy images automatically to make quantitative analysis possible by computer. Our proposed method consists of three steps. In the first step, we extract initial cell candidate regions in microscopy images based on the saliency map. In the second step, we choose nonsingle cell regions from the initial candidates based on the SVM algorithm. In the third step, we separate connected regions into single cell regions based on the branch and bound algorithm. We demonstrated the effectiveness of our proposed method using 540 microscopy images and we achieved a true positive rate of 99.04[%] and a false positive rate of 3.95[%].

关键词： Circulating tumor cell Segmentation Computer aided diagnosis Saliency map branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2010年第21期48卷 6461-6480页

作者： Yan, Pengyu Chu, Chengbin Yang, Naiding Che, Ada NW Polytech Univ Sch Management Xian 710072 Peoples R China Univ Technol Troyes F-10010 Troyes France Ecole Cent Paris Lab Genie Ind F-92295 Chatenay Malabry France

A branch and bound algorithm is described for optimal cyclic scheduling in a robotic cell with processing time windows. The objective is to minimise the cycle time by determining the exact processing time on each machine which is limited within a time window. The problem is formulated as a set of prohibited intervals of the cycle time, which is usually applied in the robotic cyclic scheduling problem with fixed processing times. Since both bounds of these prohibited intervals are linear expressions of the processing times, we divide these prohibited intervals into a series of the subsets and transform the problem into enumerating the non-prohibited intervals of cycle time in each subset. This enumeration procedure is completed by an efficient branch and bound algorithm, which could find an optimal solution by enumerating partial non-prohibited intervals. Computational results on the benchmark instances and randomly generated test instances indicate that the algorithm is effective.

关键词： robotic cell cyclic scheduling processing time windows method of prohibited intervals branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：