Optical network architectures with elastic bandwidth provisioning are a very promising approach for next generation optical networks. Such elastic optical networks will enable efficient resource utilization and flexib...
详细信息
ISBN:
(纸本)9781457708817
Optical network architectures with elastic bandwidth provisioning are a very promising approach for next generation optical networks. Such elastic optical networks will enable efficient resource utilization and flexible sub-wavelength and super-channel connection provisioning to support heterogeneous and immense bandwidth demands. In this paper, we focus on the problem of Routing, Modulation Level, and Spectrum Allocation/Assignment (RMLSA) which emerges in such networks. We both formulate RMLSA as an integer Linear programming (ILP) problem and propose an effective heuristic method called Adaptive Frequency Assignment - Division and Collision Avoidance (AFA-DCA) to be used if the solution of ILP is not attainable.
Answer Set programming (ASP; [1,2,3]) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance Boolean constraint solving capacities. ASP is particularly suited fo...
详细信息
ISBN:
(纸本)9783642406263;9783642406270
Answer Set programming (ASP; [1,2,3]) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance Boolean constraint solving capacities. ASP is particularly suited for modeling problems in the area of Knowledge Representation and Reasoning involving incomplete, inconsistent, and changing information. As such, it offers, in addition to satisfiability testing, various reasoning modes, including different forms of model enumeration, intersection or unioning, as well as multi-criteria and -objective optimization. From a formal perspective, ASP allows for solving all search problems in NP (and NP NP ) in a uniform way. Hence, ASP is wellsuited for solving hard combinatorial search problems, like system design and timetabling. Prestigious applications of ASP include composition of Renaissance music [4], decision support systems for NASA shuttle controllers [5], reasoning tools in systems biology [6,7,8] and robotics [9,10], industrial team-building [11], and many more. the versatility of ASP is nicely reflected by the ASP solver clasp [12], winning first places at various solver competitions, such as ASP,MISC, PB, and SAT competitions. the solver clasp is at the heart of the open source platform Potassco hosted at *** . Potassco stands for the “Potsdam Answer Set Solving Collection-[13] and has seen more than 30000 downloads world-wide since its inception at the end of 2008. the talk will start with an introduction to ASP, its modeling language and solving methodology, and portray some distinguished ASP systems.
this paper studies the quayside operation problem, in which three seaside planning decisions are integrated, withthe objective of minimizing the maximum relative tardiness. A refinement of the state-of-the-art formul...
详细信息
this paper studies the quayside operation problem, in which three seaside planning decisions are integrated, withthe objective of minimizing the maximum relative tardiness. A refinement of the state-of-the-art formulation is presented in this work, and an improved exact combinatorial Benders decomposition algorithm is devised for the problem at container terminals which used to be typically modeled by mixed-integer linear programming problems containing a large number of “big-M” coefficients.
We consider some generalizations of the Asymmetric Traveling Salesman Path Problem. In these variants, we have multiple salesmen that we are to move around a metric and the goal is to have each node visited by at leas...
详细信息
To solve the two major challenges in the energy sector i.e. demand supply ratio and to achieve clean energy, biomass and biofuels provide the best suitable options in agriculture based developing nations like India. T...
详细信息
In this paper we show how to exploit in Constraint programming (CP) a well-known integerprogramming technique, the additive bounding procedure, when using Limited Discrepancy Search (LDS). LDS is an effective search ...
详细信息
High penetration of renewable resources will increase the risk of overloading transmission lines and the difficulty of controlling transmission grid in a safe operation. In this paper, a model for transmission capacit...
详细信息
High penetration of renewable resources will increase the risk of overloading transmission lines and the difficulty of controlling transmission grid in a safe operation. In this paper, a model for transmission capacity margin assessment (TCMA) is established to quantify the transmission security with uncertain wind generation. the basic formulation is reformulated as a two-stage non-differentiable programming model. It can be transformed into a mixed integer linear programming (MILP) by duality theory and specific linearization techniques. Furthermore, an effective procedure is developed to improve the transmission capacity margin by necessary wind curtailment. A detailed case study is performed on the IEEE 31-bus system and numerical results verify the effectiveness of this TCMA framework.
this paper applies sentence compression models for the task of query-focused multi-document summarization in order to investigate if sentence compression improves the overall summarization performance. Both compressio...
详细信息
Coordinate-wise minimization is a simple popular method for large-scale optimization. Unfortunately, for general (non-differentiable and/or constrained) convex problems it may not find global minima. We present a clas...
详细信息
the multi-objective integerprogramming problems in large scale are considered time consuming. In the past, mathematical structures were used that can get benefits of high processing powers and parallel processing. th...
详细信息
ISBN:
(纸本)9781424458288;9789774033964
the multi-objective integerprogramming problems in large scale are considered time consuming. In the past, mathematical structures were used that can get benefits of high processing powers and parallel processing. the Branch and Bound (B&B) algorithm is one of the most used methods to solve combinatorialoptimization problems. A general approach to generate all non-dominated solutions of the multi-objective integerprogramming (MOIP) Problem is developed. In this paper, a supervisor-master-sub-master-worker algorithm to solve large scale integer multi-objective problems that can get the benefits of mathematical structures and high processing powers has been proposed. this approach addresses several issues related to the characteristics of the algorithm itself and the properties of parallel computing systems. From the solved benchmark example this algorithm proved to provide a considerable high performance. Results show that a consistently better efficiency can be achieved in solving integer equations, providing reduction of time.
暂无评论