共查询到10条相似文献,搜索用时 0 毫秒
1.
Airport management: taxi planning 总被引:4,自引:0,他引:4
Ángel G. Marín 《Annals of Operations Research》2006,143(1):191-202
The Taxi Planning studies the aircraft routing and scheduling on the airport ground. This is a dynamic problem, which must be updated almost every time that a new aircraft enters or exits the system. Taxi Planning has been modelled using a linear multicommodity flow network model with side constraints and binary variables. The flow capacity constraints are used to represent the conflicts and competence between aircrafts using a given airport capacity. The “Branch and Bound” and “Fix and Relax” methodologies have been used. The computational tests have been run at the Madrid-Barajas airport, using actual data from the airport traffic. 相似文献
2.
We develop a method to determine the topology of a network that interconnects a number of token rings using source routing bridges. The purpose is to compute a topology that provides low response delays for network users at a minimal cost of bridge installations. We formulate this network design problem as a mixed binary integer linear program. We develop effective heuristic algorithms. The algorithms exploit the topology and routing solutions of the linear programming relaxation in a sophisticated manner which we believe is new in the literature. The model incorporates performance issues, such as network stability, bridge overflow, back pressure effect and broadcast storm, that are specific to the underlying communication technology. By formally incorporating these performance issues, we tighten the model formulation and improve the quality of the LP bound considerably. Computational results are reported for problems with up to 20 token rings and 190 potential bridge locations. 相似文献
3.
Joseph L. Balintfy G. Terry Ross Prabhakant Sinha Andris A. Zoltners 《Mathematical Programming》1978,15(1):63-76
In this paper, the analytical representation of food preference is used in a separable non-linear program to yield the serving frequencies of menu items for a finite time horizon. The frequencies obtained in this way insure cost and nutritional control. Subsequently, the scheduling problem dealing with item assignments to meals and days is formulated as an integer program consisting of several transportation problems linked by weekly nutritional constraints. This problem is solved using a branch and bound algorithm which employs Lagrangian relaxation to obtain bounds and to decide on branching strategy. 相似文献
4.
The strategic design of a robust supply chain has to determine the configuration of the supply chain so that its performance remains of a consistently high quality for all possible future conditions. The current modeling techniques often only consider either the efficiency or the risk of the supply chain. Instead, we define the strategic robust supply chain design as the set of all Pareto-optimal configurations considering simultaneously the efficiency and the risk, where the risk is measured by the standard deviation of the efficiency. We model the problem as the Mean–Standard Deviation Robust Design Problem (MSD-RDP). Since the standard deviation has a square root expression, which makes standard maximization algorithms based on mixed-integer linear programming non-applicable, we show the equivalency to the Mean–Variance Robust Design Problem (MV-RDP). The MV-RDP yields an infinite number of mixed-integer programming problems with quadratic objective (MIQO) when considering all possible tradeoff weights. In order to identify all Pareto-optimal configurations efficiently, we extend the branch-and-reduce algorithm by applying optimality cuts and upper bounds to eliminate parts of the infeasible region and the non-Pareto-optimal region. We show that all Pareto-optimal configurations can be found within a prescribed optimality tolerance with a finite number of iterations of solving the MIQO. Numerical experience for a metallurgical case is reported. 相似文献
5.
网络计划技术在建筑工程施工管理中的应用问题 总被引:5,自引:0,他引:5
根据建筑工程施工特点,指出了应用网络计划资本的重要性。从网络计划技术在建筑施工管理中的应用现状出发,阐述了应用中存在的主要问题,详细分析了其产生的原因,进而对提高应用水平的对策进行了讨论,章有助于网络计划技术更好地在施工管理中应用。 相似文献
6.
Hub-and-Spoke型运输网络改善方法及其应用 总被引:2,自引:0,他引:2
Hub-and-Spoke(本文简称为HS)网络形式被广泛采用于多个领域,其在实践中显现的缺陷也为学术界所重视。本文采用运输车辆空驶吨公里作为评判标准,以"中途点停靠"(pickup stopover)的形式改善HS型运输网络。通过解析法获得HS运输网络结合中途点停靠运输模式的适用条件,并以我国公路快速货运业干线运输组织为对象加以实证分析。相比于运筹学领域优化计算方法而言,这种针对HS运输网络改善方法的可行性论证过程简单而实用。 相似文献
7.
Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem 总被引:2,自引:0,他引:2
In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size. 相似文献
8.
Material Requirements Planning (MRP) and Just-in-Time (JIT) system are directed toward planning and controlling the important characteristics of material flow: how much of what materials flow and when. Since the material flow is at the heart of the manufacturing firm, MRP and JHT are the powerful management tools that could determine the success or failure of an entire manufacturing system. One of the strongest debates in manufacturing has been centered on the performance comparison and compatibility of JIT production system to the existing MRP. The primary intent of this research is to provide an overview of the manufacturing planning and control environment associated with MRP and JIT. Classifying the existing MRP/JIT comparison and integration literature, two different perspectives on MRP/JIT are discussed, and future research area is proposed based on the taxonomy. 相似文献
9.
10.
基于等级特征与可变信息板(VMS)研究了交叉巢式Logit(CNL)模型及网络交通流分配。综合幂函数与指数函数表示方法给出新的信息效用衰减因子,结合道路等级特征表示VMS对车流的影响系数及CNL模型的分配系数;给出等级结构道路网络的随机用户均衡条件下的交叉巢式Logit路径选择模型及其等价数学规划,并设计网络流分配算法。通过实例网络的计算与分析,得到一些有意义的结论:等级结构越显著的路网总出行时间费用越低且其分散参数(θ)弹性绝对值越大;对具有较强随机性的实际路网,若增加一定的确定性则节省更多网络总出行时间;道路网络中设置了VMS时总出行时间受分散参数的影响更小。 相似文献