This paper addresses the storage location assignment problem for outbound containers. The problem is decomposed into two stages. The yard bays and the amount of locations in each yard bay, which will be assigned to th...
详细信息
This paper addresses the storage location assignment problem for outbound containers. The problem is decomposed into two stages. The yard bays and the amount of locations in each yard bay, which will be assigned to the containers bounded for different ships, are determined in the first stage. The exact storage location for each container is determined in the second stage. The problem in the first stage is solved by a mixed integer programming model, while a hybrid sequence stacking algorithm is applied to solve the problem in the second stage. Experimental results show that the proposed approach is effective and efficient in solving the storage location assignment problem for outbound containers. (C) 2010 Elsevier B.V. All rights reserved.
This paper presents a corrected formulation to the mixed integer programming model of the double-row layout problem (DRLP), first proposed by Chung and Tanchoco (2010, The double row layout problem. International Jour...
详细信息
This paper presents a corrected formulation to the mixed integer programming model of the double-row layout problem (DRLP), first proposed by Chung and Tanchoco (2010, The double row layout problem. International Journal of Production Research, 48 (3), 709-727). In the DRLP, machines are placed along two rows of a corridor, where the objective is to minimise the total cost of material handling for products that move between these machines. We highlight the errors in the original formulation, propose corrections to the formulation, and provide an analytical validation of the corrections.
This paper presents a mathematical model and its computer solution towards a water pollution control system optimisation case. Firstly, after simplifying and assuming initial conditions, a mixed integer programming mo...
详细信息
This paper presents a mathematical model and its computer solution towards a water pollution control system optimisation case. Firstly, after simplifying and assuming initial conditions, a mixed integer programming model for the urban water pollution facilities system plan problem was proposed according to the principle of minimum total cost of site selection, wastewater disposal and pipeline transport. Then, the model was solved by Lingo 12.0 software. Finally, its stability and application scope were analysed. The results showed that the model is dependable and the optimised running result provides an important reference for relevant decision-making departments.
Wildlife corridors connect areas of biological significance to mitigate the negative ecological impacts of habitat fragmentation. In this article we formalize the optimal corridor design as a connected subgraph proble...
详细信息
Wildlife corridors connect areas of biological significance to mitigate the negative ecological impacts of habitat fragmentation. In this article we formalize the optimal corridor design as a connected subgraph problem, which maximizes the amount of suitable habitat in a fully connected parcel network linking core habitat areas, subject to a constraint on the funds available for land acquisition. To solve this challenging computational problem, we propose a hybrid approach that combines graph algorithms with mixed integer programming-based optimization. We apply this technique to the design of corridors for grizzly bears in the U.S. Northern Rockies, illustrating the underlying computational complexities by varying the granularity of the parcels available for acquisition. The approach that is introduced is general and can be applied to other species or other similar problems, such as those occurring in social networks. (C) 2011 Elsevier Inc. All rights reserved.
This paper gives an introduction to a recently established link between the geometry of numbers and mixedinteger optimization. The main focus is to provide a review of families of lattice-free polyhedra and their use...
详细信息
This paper gives an introduction to a recently established link between the geometry of numbers and mixedinteger optimization. The main focus is to provide a review of families of lattice-free polyhedra and their use in a disjunctive programming approach. The use of lattice-free polyhedra in the context of deriving and explaining cutting planes for mixedinteger programs is not only mathematically interesting, but it leads to some fundamental new discoveries, such as an understanding under which conditions cutting planes algorithms converge finitely.
This paper proposes a multi-agent approach to decentralized power system restoration for distribution system networks. The proposed method consists of several Distributing Substation Agents (DSAGs) and Load Agents (LA...
详细信息
This paper proposes a multi-agent approach to decentralized power system restoration for distribution system networks. The proposed method consists of several Distributing Substation Agents (DSAGs) and Load Agents (LAGs). LAG corresponds to the customer load, while a DSAG corresponds to the distribution substation. LAG restores self-load, while a DSAG supplies the electricity to LAGs. From the simulation results, it can be seen the proposed multi-agent system could reach the right solution by making use of only the local information. In addition, the proposed method is able to get the restorative plan which is better than the solution of the mixed integer programming. Therefore, the interaction of several simple agents leads to a dynamic restoration system, allowing approximation solution efficiently. This means that the proposed multi-agent restoration system is a promising approach to more large-scale distribution networks. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of the organizing committee of 2nd International Conference on Advances in Energy Engineering (ICAEE).
Maximization of network lifetime is one of the most important design goals in Wireless Sensor Networks (WSNs). In WSNs with static base stations, sensor nodes close to the base station dissipate most of their energies...
详细信息
ISBN:
(纸本)9781467362337
Maximization of network lifetime is one of the most important design goals in Wireless Sensor Networks (WSNs). In WSNs with static base stations, sensor nodes close to the base station dissipate most of their energies for relaying other sensor nodes' data. Although cooperation among the sensor nodes results in longer network lifetimes in comparison to greedy approaches, there is an inherent limit on the achievable network lifetime due to the limited energy of the sensor nodes in close proximity of the base station acting as relays. Base station mobility is proposed as a remedy for the WSN hot spot problem. As the base station relocates, the burden of relaying the data coming from all sensor nodes can be shared by a larger set of nodes. To take advantage of base station mobility to maximize the network lifetime, determining the optimal mobility pattern is of utmost importance. In this study, we investigate the impact of using three base station mobility patterns which are random mobility, grid mobility, and spiral mobility. To avoid the shadowing effects of specific protocols or algorithms we build a novel mixed integer programming (MIP) framework which enables us to explore the design space under optimal operating conditions.
existing service composition approaches usually assume that the quality of service does not change over time. Actually, the performance of a service may fluctuate due to the dynamic environments, which may violate the...
详细信息
ISBN:
(纸本)9781467347754;9781467347730
existing service composition approaches usually assume that the quality of service does not change over time. Actually, the performance of a service may fluctuate due to the dynamic environments, which may violate the end-to-end QoS constraints or degrade the QoS of a composite service. History records (or QoS records) can exhibit QoS fluctuations over the past period and reflect the actual performance of a service. Thus, a novel Two-Phase Approach for Service Composition (TPASC) based on QoS records is presented to address the problem. The proposed approach has the two phases: one is preliminary filtering, where a heuristic QoS decomposition algorithm is proposed to decompose the end-to-end QoS constraints into local constraints, and then some promising services are selected in terms of the probability that they can meet the local constraints;the other is MIP (mixed integer programming)-based service selection, where QoS records associated with each promising service are reduced by K-means clustering method, and then a MIP model is proposed to rank and select services in terms of the reduced QoS records. The experimental results show TPASC can conduct service composition with high efficiency and significant cost savings in dynamic environments.
Supply uncertainty can have a very radical impact on firms who fail to protect against it. It appears that the quantity delivered by the supplier is random. In this paper, we develop a mixedinteger non linear program...
详细信息
ISBN:
(纸本)9781467358125
Supply uncertainty can have a very radical impact on firms who fail to protect against it. It appears that the quantity delivered by the supplier is random. In this paper, we develop a mixedinteger non linear programming model for a mono-item multi-period inventory management decision and supplier selection problem under random yield. The yield of supplier is random. The buyer needs to answer three questions: how much to command? what is supplier selected? and in which period? The complexity of this problem is NP-hard. We used a genetic algorithm (GA) to solve this problem.
N-1-1 contingency analysis considers the consecutive loss of two elements in a power system, with intervening time for operator adjustments;the associated reliability criterion was recently included in the NERC Standa...
详细信息
ISBN:
(纸本)9781467327299
N-1-1 contingency analysis considers the consecutive loss of two elements in a power system, with intervening time for operator adjustments;the associated reliability criterion was recently included in the NERC Standard TPL-001-1. In this paper, we introduce optimization models for N-1-1 contingency analysis, based on DC optimal power flow considerations. We use mixed-integerprogramming approaches to optimally model the system adjustments required to avoid potential cascading outages during the primary and secondary contingencies. Contingencies are determined via worst-case interdiction analysis. To facilitate operation during the secondary contingency, line overloads and load shedding are allowed. We test our models and algorithms on several IEEE test systems. Our computational experiments indicate potential for the models to augment comprehensive system operations models, such as unit commitment.
暂无评论