Variations in the efficiency of a mathematical programming solver according to the order of the constraints in the model

It is well-known that the efficiency of mixed integer linear mathematical programming depends on the model (formulation) used. With the same mathematical programming solver, a given problem can be solved in a brief calculation time using one model but requires a long calculation time using another. In this paper a new, unexpected feature to be taken into account is presented: the order of the constraints in the model can change the calculation time of the solver considerably. For a test problem, the Response Time Variability Problem (RTVP), it is shown that the ILOG CPLEX 9.0 optimizer returns a ratio of 17.47 between the maximum and the minimum calculations time necessary to solve optimally 20 instances of the RTVP, according to the order of the constraints in the model. It is shown that the efficiency of the mixed integer linear mathematical programming depends not only on the model (formulation) used, but also on how the information is introduced into the solverPeer Reviewe

Evaluating urban freight transport policies within complex urban environments

Urban Freight Transport (UFT) entails significant advantages for the economic growth of cities, but can also hamper population quality of life, obstructing vehicles and people movements while exacerbating environmental problems. Many initiatives have been engaged by many city administrators in order to efficiently manage UFT, evaluating different policies at a global scale. From the perspective of operators, most works analyze a limited set of policies or only focus on the benefits of companies. In this work, a decisionmaking process is used to evaluate a large set of UFT policies, through different attributes representing the advantages and limitations of each policy over promoter companies and the society. To do so, an ex-ante procedure in five steps is proposed to classify the policies: (1) attributes definition, (2) attributes weighting, (3) policy-attribute assessment, (4) policy ranking, and (5) feasibility threshold satisfaction. The whole process is supported on consultations to 26 experts regarding shop supply and restocking activities within complex urban environments. Results show a classification of the analyzed policies, according to their suitability for implementation ; which could be extended (directly or with small adjustments) to other contexts, given the flexibility of the decision-making procedure developed.Peer ReviewedPostprint (author's final draft

Improving parametric Clarke and Wright algorithms by means of iterative empirically adjusted greedy heuristics

Since Clarke and Wright proposed their well-known savings algorithm for solving the Capacitated Vehicle Routing Problem, several enhancements to the original savings formula have been recently proposed, in the form of parameterisations. In this paper we first propose to use Empirically Adjusted Greedy Heuristics to run these parameterized heuristics and we also consider the addition of new parameters. This approach is shown to improve the savings algorithms proposed in the literature. Moreover, we propose a new procedure which leads to even better solutions, based on what we call Iterative Empirically Adjusted Greedy Heuristics

Improving the resolution of the simple assembly line balancing problem type E

The simple assembly line balancing problem type E (abbreviated as SALBP-E) occurs when the number of workstations and the cycle time are variables and the objective is to maximise the line efficiency. In contrast with other types of SALBPs, SALBP-E has received little attention in the literature. In order to solve optimally SALBP-E, we propose a mixed integer liner programming model and an iterative procedure. Since SALBP-E is NP-hard, we also propose heuristics derived from the aforementioned procedures for solving larger instances. An extensive experimentation is carried out and its results show the improvement of the SALBP-E resolution

Heuristic procedures for solving the General Assembly Line Balancing Problem with Setups (GALBPS)

The General Assembly Line Balancing Problem with Setups (GALBPS) was recently defined in the literature. It adds sequence-dependent setup time considerations to the classical Simple Assembly Line Balancing Problem (SALBP) as follows: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time, thereby providing the task sequence inside each workstation. This paper proposes over 50 priority-rule-based heuristic procedures to solve GALBPS, many of which are an improvement upon heuristic procedures published to date

A community electrification project: combination of microgrids and household systems fed by wind, PV or micro-hydro energies according to micro-scale resource evaluation and social constraints

When electrifying isolated rural communities, usually standardized solutions have been implemented using the same technology at all the points. However these solutions are not always appropriate to the community and its population. This article aims to describe the technical design of the electrification system of the community of Alto Peru (in the region of Cajamarca, Peru), where the adequate technology was used at each area according to micro-scale resource evaluation and the socioeconomic requirements of the population. Specifically four technologies were implemented: wind microgrids in highlands, a micro-hydro power plant in the presence of a waterfall, a PV microgrid in a group of points sheltered from the wind and individual PV systems in scattered points with low wind potential. This project brought electricity to 58 households, a health center, a school, a church, two restaurants and two shops.Peer ReviewedPostprint (author’s final draft

Inhomogeneous cortical synchronization and partial epileptic seizures

Objective: Interictal synchronization clusters have recently been described in several publications using diverse techniques, including neurophysiological recordings and fMRI, in patients suffering from epilepsy. However, little is known about the role of these hypersynchronous areas during seizures. In this work, we report an analysis of synchronization clusters jointly with several network measures during seizure activity; we then discuss our findings in the context of prior literature.Methods: Subdural activity was recorded by electrocorticography (with 60 electrodesplaced at temporal and parietal lobe locations) in a patient with temporal lobe epilepsywith partial seizures with and without secondary generalization (SG). Both interictal andictal activities (during four seizures) were investigated and characterized using local synchronization and complex network methodology. The modularity, density of links, average clustering coefficient, and average path lengthswere calculated to obtain information about the dynamics of the global network. Functional connectivity changes during the seizures were compared with the time evolution of highly synchronized areas.Results: Our findings reveal temporal changes in local synchronization areas during seizuresand a tight relationship between the cortical locations of these areas and the patterns oftheir evolution over time. Seizure evolution and SG appear to be driven by two differentunderlying mechanisms.Fil: Vega Zelaya, Lorena. Hospital Universitario la Princesa; EspañaFil: Pastor, Jesús Eduardo. Hospital Universitario la Princesa; EspañaFil: García de Sola, Rafael. Hospital Universitario la Princesa; EspañaFil: Ortega, Guillermo José. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Quilmes; Argentin