51 research outputs found
An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design
We investigate the 3-architecture Connected Facility Location Problem arising
in the design of urban telecommunication access networks. We propose an
original optimization model for the problem that includes additional variables
and constraints to take into account wireless signal coverage. Since the
problem can prove challenging even for modern state-of-the art optimization
solvers, we propose to solve it by an original primal heuristic which combines
a probabilistic fixing procedure, guided by peculiar Linear Programming
relaxations, with an exact MIP heuristic, based on a very large neighborhood
search. Computational experiments on a set of realistic instances show that our
heuristic can find solutions associated with much lower optimality gaps than a
state-of-the-art solver.Comment: This is the authors' final version of the paper published in:
Squillero G., Burelli P. (eds), EvoApplications 2016: Applications of
Evolutionary Computation, LNCS 9597, pp. 283-298, 2016. DOI:
10.1007/978-3-319-31204-0_19. The final publication is available at Springer
via http://dx.doi.org/10.1007/978-3-319-31204-0_1
A fast ILP-based Heuristic for the robust design of Body Wireless Sensor Networks
We consider the problem of optimally designing a body wireless sensor
network, while taking into account the uncertainty of data generation of
biosensors. Since the related min-max robustness Integer Linear Programming
(ILP) problem can be difficult to solve even for state-of-the-art commercial
optimization solvers, we propose an original heuristic for its solution. The
heuristic combines deterministic and probabilistic variable fixing strategies,
guided by the information coming from strengthened linear relaxations of the
ILP robust model, and includes a very large neighborhood search for reparation
and improvement of generated solutions, formulated as an ILP problem solved
exactly. Computational tests on realistic instances show that our heuristic
finds solutions of much higher quality than a state-of-the-art solver and than
an effective benchmark heuristic.Comment: This is the authors' final version of the paper published in G.
Squillero and K. Sim (Eds.): EvoApplications 2017, Part I, LNCS 10199, pp.
1-17, 2017. DOI: 10.1007/978-3-319-55849-3\_16. The final publication is
available at Springer via http://dx.doi.org/10.1007/978-3-319-55849-3_1
EFFECTIVENESS OF SWITCHING FROM ORAL ZIPRASIDONE TO RISPERIDONE IN A PATIENT WITH COMORBID AUTISTIC DISORDER, PROFOUND INTELLECTUAL DISABILITY, GILBERT SYNDROME, AND EXACERBATION OF PSYCHOSIS
Autism and intellectual disability may hinder any other coexisting psychiatric diagnosis. Diagnoses are often based on behavioral observations, directly ob- tained or reported by family members or operators in frequent contact with the patient, and non-verbal communications, as well as on the psychological and physical symptoms manifested by the patient.
We describe the case of a 28-year-old Italian man, hospitalized in one of our long-term care wards for comorbid profound intellectual disability (IQ<25), autistic and psychotic disorders, and Gilbert syndrome, who manifested a severe exacerbation of psychosis, for which ziprasidone was prescribed. This condition para- doxically further deteriorated after the introduction of this drug. A subsequent switch to risperidone greatly and rapidly improved both psychosis-related and symp- toms emerging after the introduction of ziprasidone
A biologically inspired network design model
A network design problem is to select a subset of links in a transport network that satisfy passengers or cargo transportation demands while minimizing the overall costs of the transportation. We propose a mathematical model of the foraging behaviour of slime mould P. polycephalum to solve the network design problem and construct optimal transport networks. In our algorithm, a traffic flow between any two cities is estimated using a gravity model. The flow is imitated by the model of the slime mould. The algorithm model converges to a steady state, which represents a solution of the problem. We validate our approach on examples of major transport networks in Mexico and China. By comparing networks developed in our approach with the man-made highways, networks developed by the slime mould, and a cellular automata model inspired by slime mould, we demonstrate the flexibility and efficiency of our approach
- âŠ