A numerical and experimental study on energy saving solutions for mobile hydraulic machinery

Energy saving in mobile hydraulic machinery, aimed to fuel consumption reduction, has been one of the principal interests of many researchers and OEMs in the last years. Many different solutions have been proposed and investigated in the literature in order to improve the fuel efficiency, from novel system architectures and strategies to control the system to hybrid solutions. This thesis deals with the energy analysis of a hydraulic system of a middle size excavator through mathematical tools. In order to conduct the analyses the multibody mathematical model of the hydraulic excavator under investigation will be developed and validated on the basis of experimental activities, both on test bench and on the field. The analyses will be carried out considering the typical working cycles of the excavators defined by the JCMAS standard. The simulations results will be analysed and discussed in detail in order to define different solutions for the energy saving in LS hydraulic systems. Among the proposed energy saving solutions, energy recovery systems seem to be very promising for fuel consumption reduction in mobile machinery. In this thesis a novel energy recovery system architecture will be proposed and described in detail. Its dimensioning procedure takes advantage of the dynamic programming algorithm and a prototype will be realized and tested on the excavator under investigation. Finally the energy saving proposed solutions will be compared referring to the standard machinery architecture and a novel hybrid excavator with an energy saving up to 11% will be presented.

Kinetic and hydraulic studies in high-rate biological filters

Most published work on either low- or high-rate biological filters covers one of three topics: kinetics, microbiology/ecology or hydraulics. These areas have been re-examined together for high-rate filters in order to further integrate them and enable appropriate utilization of low-rate filter experience.

Optimization of PCB component placements for the collect-and-place machines

This paper presents two hybrid genetic algorithms (HGAs) to optimize the component placement operation for the collect-and-place machines in printed circuit board (PCB) assembly. The component placement problem is to optimize (i) the assignment of components to a movable revolver head or assembly tour, (ii) the sequence of component placements on a stationary PCB in each tour, and (iii) the arrangement of component types to stationary feeders simultaneously. The objective of the problem is to minimize the total traveling time spent by the revolver head for assembling all components on the PCB. The major difference between the HGAs is that the initial solutions are generated randomly in HGA1. The Clarke and Wright saving method, the nearest neighbor heuristic, and the neighborhood frequency heuristic are incorporated into HGA2 for the initialization procedure. A computational study is carried out to compare the algorithms with different population sizes. It is proved that the performance of HGA2 is superior to HGA1 in terms of the total assembly time.

An integrated scheduling problem of PCB components on sequential pick-and-place machines:mathematical models and heuristic solutions

This paper formulates several mathematical models for determining the optimal sequence of component placements and assignment of component types to feeders simultaneously or the integrated scheduling problem for a type of surface mount technology placement machines, called the sequential pick-andplace (PAP) machine. A PAP machine has multiple stationary feeders storing components, a stationary working table holding a printed circuit board (PCB), and a movable placement head to pick up components from feeders and place them to a board. The objective of integrated problem is to minimize the total distance traveled by the placement head. Two integer nonlinear programming models are formulated first. Then, each of them is equivalently converted into an integer linear type. The models for the integrated problem are verified by two commercial packages. In addition, a hybrid genetic algorithm previously developed by the authors is adopted to solve the models. The algorithm not only generates the optimal solutions quickly for small-sized problems, but also outperforms the genetic algorithms developed by other researchers in terms of total traveling distance.

Integrated component scheduling models for chip shooter machines

This paper focuses on minimizing printed circuit board (PCB) assembly time for a chipshootermachine, which has a movable feeder carrier holding components, a movable X–Y table carrying a PCB, and a rotary turret with multiple assembly heads. The assembly time of the machine depends on two inter-related optimization problems: the component sequencing problem and the feeder arrangement problem. Nevertheless, they were often regarded as two individual problems and solved separately. This paper proposes two complete mathematical models for the integrated problem of the machine. The models are verified by two commercial packages. Finally, a hybrid genetic algorithm previously developed by the authors is presented to solve the model. The algorithm not only generates the optimal solutions quickly for small-sized problems, but also outperforms the genetic algorithms developed by other researchers in terms of total assembly time.