Search results for "Mathematical optimization"

Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem

2021

The soft-clustered capacitated arc-routing problem (SoftCluCARP) is a variant of the classical capacitated arc-routing problem. The only additional constraint is that the set of required edges, that is, the streets to be serviced, is partitioned into clusters, and feasible routes must respect the soft-cluster constraint, that is, all required edges of the same cluster must be served by the same vehicle. In this article, we design an effective branch-price-and-cut algorithm for the exact solution of the SoftCluCARP. Its new components are a metaheuristic and branch-and-cut-based solvers for the solution of the column-generation subproblem, which is a profitable rural clustered postman tour …

New Heuristic Algorithms for the Windy Rural Postman Problem

2005

[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved.

A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem

2016

[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, consisting of finding a route maximizing the difference between the total profit collected and the total cost. This problem generalizes the rural postman problem and other well-known arc routing problems and has real-life applications, mainly in snow removal operations. We propose here a formulation for the problem and study its associated polyhedron. Several families of facet-inducing inequalities are described and used in the design of a branch-and-cut procedure. The algorithm…

The Windy clustered prize-collecting arc-routing problem

2011

This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.

The Waterfront Theorem: an integrated and creative planning approach

2016

Waterfronts are sensitive interfaces between land and sea, creative interfaces between urban and environmental components, social interfaces between nodes and networks. They not only coincide with the areas of infrastructure that are gathering on the coast, not only with the shoreline or the environmental components of the coastal territories. They are hired by the project as complex interaction of crossing flows, stratified identity of urban communities: fundamental element of the environmental system, synthesis of landscape, space and community, a place of solidification of the identity of the social, cultural and economic community (Carta, 2009). The management of urban interface of wate…

Human factor policy testing in the sequencing of manual mixed model assembly lines

2004

In this paper the human resource management in manual mixed model assembly U-lines is considered. The objective is to minimise the total conveyor stoppage time to achieve the full efficiency of the line. A model, that includes effects of the human resource, was developed in order to evaluate human factor policies impact on the optimal solution of this line sequencing problem. Different human resource management policies are introduced to cope with the particular layout of the proposed line. Several examples have been proposed to investigate the effects of line dimensions on the proposed management policies. The examples have been solved through a genetic algorithm. The obtained results conf…

Distributed Consensus in Networks of Dynamic Agents

2006

Stationary and distributed consensus protocols for a network of n dynamic agents under local information is considered. Consensus must be reached on a group decision value returned by a function of the agents' initial state values. As a main contribution we show that the agents can reach consensus if the value of such a function computed over the agents' state trajectories is time invariant. We use this basic result to introduce a protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents' initial states. We demonstrate that the asymptotical consensus is reached via a Lyapunov approach. Finally we perfor…

2017

Abstract. We present a Monte Carlo genetic algorithm (MCGA) for efficient, automated, and unbiased global optimization of model input parameters by simultaneous fitting to multiple experimental data sets. The algorithm was developed to address the inverse modelling problems associated with fitting large sets of model input parameters encountered in state-of-the-art kinetic models for heterogeneous and multiphase atmospheric chemistry. The MCGA approach utilizes a sequence of optimization methods to find and characterize the solution of an optimization problem. It addresses an issue inherent to complex models whose extensive input parameter sets may not be uniquely determined from limited in…

Operator splitting methods for American option pricing

2004

Abstract We propose operator splitting methods for solving the linear complementarity problems arising from the pricing of American options. The space discretization of the underlying Black-Scholes Scholes equation is done using a central finite-difference scheme. The time discretization as well as the operator splittings are based on the Crank-Nicolson method and the two-step backward differentiation formula. Numerical experiments show that the operator splitting methodology is much more efficient than the projected SOR, while the accuracy of both methods are similar.

Multi-Resource Management for Multi-Tier Space Information Networks: A Cooperative Game

2019

With the drastic increase of space information network (SIN) traffic and the diversity of network traffic types, the optimal allocation of the scarce network resources is of great significance for optimizing the SIN system capability. In this paper, we propose a multi-resource management method for multi-tier SIN using the cooperative Nash bargaining solution. Since the original problem is a non-convex problem, we firstly make logarithmic transition, and then find a tightest lower bound function to convert the initial problem into a convex one. In order to carry out the optimal bandwidth and power allocation in SIN, we construct a joint bandwidth and power allocation (JBPA) algorithm. Simul…