This paper focuses on the problem of supplying the workstations of assembly lines with components during the production process. For that specific problem, this paper presents a Mixed Integer Linear Program (MILP) that aims at minimizing the energy consumption of the supplying strategy. More specifically, in contrast of the usual formulations that only consider component flows, this MILP handle...

This paper deals with the problem of finding optimal feeding sequence in a manufacturing cell with feeders fed by a mobile robot with manipulation arm. The performance criterion is to minimize total traveling time of the robot in a given planning horizon. Besides, the robot has to be scheduled in order to keep production lines within the cell working without any shortage of parts fed from feede...

The problem of laying out a survivable IP network over a WDM network is considered. The links of the IP network are realized by unprotected lightpaths of the WDM network, and the lightpaths must be routed so that the IP network remains connected after any fault. Crochat and Le Boudec [2] introduced the problem for the case of single fiber-link failures, and Modiano and Narula-Tam [5] provided a...

In this paper, we present an analysis of the strength of sparse cutting-planes for mixed integer linear programs (MILP) with sparse formulations. We examine three kinds of problems: packing problems, covering problems, and more general MILPs with the only assumption that the objective function is non-negative. Given a MILP instance of one of these three types, assume that we decide on the suppo...

In wireless sensor networks, the sensor nodes collect data, which are routed to a sink node. Most of the existing proposals address the routing problem to maximize network lifetime in the case of a single sink node. In this paper, we extend this problem into the case of multiple sink nodes. To maximize network lifetime, we consider the two problems: (i) how to position multiple sink nodes in th...

Modularity density maximization is a clustering method that improves some issues of the commonly-used modularity maximization approach. Recently, some Mixed-Integer Linear Programming (MILP) reformulations have been proposed in the literature for the modularity density maximization problem, but they require as input the solution of a set of auxiliary binary Non-Linear Programs (NLPs). These can...

The Monash Interview for Liaison Psychiatry (MILP) is a structured interview designed for use with patients who have physical and psychiatric comorbidity. Linked to a computerized diagnostic algorithm, the MILP is able to establish diagnoses according to DSM-III-R, International Classification of Diseases--10th Edition (ICD-10), and DSM-IV criteria, as well as a range of other criteria relevant...

The profound transformation of large-scale Industrial Control Systems (ICS), e.g., smart energy networks (Smart Grids), from a proprietary and isolated environment to a modern architecture brings several new challenges. Nowadays, ICS network designers need to accommodate a variety of devices and communication media/protocols with industry-specific requirements pertaining to real-time delivery o...

The management of complex energy systems where different power sources are active in a time varying scenario of costs and prices needs efficient optimization approaches. Usually the scheduling problem is is formulated as a Mixed Integer Linear Programming (MILP) to guarantee the convergence to the global optimum. The goal of this work is to propose and compare a hybrid technique based on Artifi...