WO2013174795A1

WO2013174795A1 - Method for the removal of waste from a network of waste inlets

Info

Publication number: WO2013174795A1
Application number: PCT/EP2013/060374
Authority: WO
Inventors: Cèsar Fernández Camon; Carlos MATEU PIÑOL; Ramón Béjar Torres; Felipe Mañá Serres
Original assignee: Ros Roca Envirotec, S.L.
Priority date: 2012-05-21
Filing date: 2013-05-21
Publication date: 2013-11-28
Also published as: EP2666737B1; EP2666737A1; PT2666737T; ES2920923T3

Abstract

Method for the removal of waste from a network of waste inlets (I) in an automated waste collection system, said inlets (I) being adapted to be loaded with at least one type of waste fraction, said network having a root node (RN) where the collection facility is, and said system comprising at least one valve (v) that defines at least two sectors, any sector comprising the root node (RN) and the inlets (I) connected thereto under one condition of the valve (v), either open or closed, the method comprising ordering all the inlets (I) of the waste collection system, selecting the next sequence of inlets (I) from which waste is to be unloaded and transported to the root node (RN), said selection being the result of an optimization problem that comprises the minimization of a cost function under at least one operational constraint, the cost function being a function of at least two variables, one variable being an estimation of the cost of the energy consumed in the transport of waste from the inlets (I) to the root node (RN), and another variable being a penalty related to not unload inlets (I) that are loaded with waste at a level above their assigned capacity, and one operational constraint being that only inlets (I) from at most one sector can be unloaded in any distinct unloading sequence, and transporting the unloaded waste from the inlets (I) of the selected sequence to the root node (RN).

Description

Method for the removal of waste from a network of waste inlets

The present invention relates to a method for the removal of waste from a network of waste inlets in an automated waste collection system, said inlets being adapted to be loaded with at least one type of waste fraction, said network having a root node where the collection facility is. A network of pipes connect the waste inlets to the root node.

The invention also relates to a system and a computer program for the removal of waste from a network of waste inlets in an automated waste collection system, suitable for carrying out such a method.

BACKGROUND ART Disposal of waste products, such as inorganic and organic refuse and the like, by means of air waste disposal systems is a known technology in which waste is conveniently driven through a pipe system into a collection facility. Air waste disposal systems are usually used in inner city, private communities, building areas, hospitals, hotels, industrial facilities, airports, etc. and places in general where waste is produced in large amounts, this being a rapid, clean and efficient technique for centrally disposing of waste products.

In such a disposal system, a network of fixed waste inlets where refuse is to be selectively placed is distributed on a determined area. Each of the inlets is connected to waste pipes leading to a common air transport pipe system through corresponding discharge valves. Waste products are driven through the air transport pipe system by an air stream (typically at vacuum conditions) drawing them to at least one collection facility for treating, recycling or disposal.

The inlets are emptied when a volume of waste considered to be sufficient to be discharged into the collection station is detected. This may be carried out by level sensors associated to the inlets which output a level-indication signal to control means for opening the corresponding discharge valve.

Since a plurality of inlets exists in the network of inlets, a control system has to be provided in order to improve performance, especially in large networks. For example, emptying can be performed on a first to come first to serve basis or by forming groups of inlets according to a priority value that represents the relative importance of collecting waste from the group. In the European patent EP2022731 , waste is collected from a plurality of waste inlets through waste pipes leading to transport pipes. The transport pipes comprise several branches and at least one inlet is connected to each branch through a corresponding waste pipe for driving refuse to at least one collection facility. The waste is collected by emptying a first inlet; establishing the inlet being emptied as a reference inlet; selecting a new inlet to be analyzed; determining whether at least one emptying condition is met, said condition depending on said reference inlet and said new inlet; if said condition is met, emptying the selected inlet, establishing said inlet as a new reference inlet, and selecting again a new inlet to be analyzed; and if said condition is not met, selecting another new inlet to be analyzed and then determining again whether said condition is met.

This method has been proved to be efficient, but there is still scope to reduce the energy consumption involved in the pneumatic transportation of waste.

SUMMARY OF THE INVENTION

It is an object of the present invention to provide a method that reduces the energy consumption of automated waste collection systems.

The invention proposes the use of machine learning techniques and linear programming algorithms for the planning operations of automatic waste collection plants. The objective is to achieve optimal operation plans, at any time, based on the current state of the system and on previous experiences, that minimizes energy consumption subject to pre-established service quality standards. An optimal operation plan includes selecting a sequence of inlets to be emptied after the last selected sequence has been emptied.

The method has at least two levels. First, to determine an optimal emptying decision at a given instant of time (i.e., the next ordered sequence of inlets to be emptied) by applying mixed integer linear programming techniques to a parametric model of the system. Second, to learn from experience by recording historical data and current decisions and by applying machine learning techniques to compute, within a time horizon, an optimal operation plan that includes, at each interval of time, the determination of the optimal emptying decision according to the first level.

Optimal planning decisions will depend on the system status as well as on the future behaviour of the users. This stochastic component can be captured employing dynamic programming and machine learning techniques. The system dimensionality (number of states, time granularity and decisions) can be defined so as to allow an offset training based on a corpus data (i.e. historical data from existing plants). Once the dynamic programming algorithms have been properly trained, optimal decisions can be achieved at each time slot, on real time, according to the current status of the system, and new feedback can be added to the trained values.

According to an aspect of the invention, the system comprises at least one valve that defines at least two sectors, any sector comprising the root node and the inlets connected thereto under one condition of the valve, either open or closed, and the method comprises the steps of:

- ordering all the inlets of the waste collection system;

- selecting the next sequence of inlets from which waste is to be unloaded and transported to the root node, said selection being the result of an optimization problem that comprises the minimization of a cost function under at least one operational constraint, the cost function being a function of at least two variables, one variable being an estimation of the cost of the energy consumed in the transport of waste from the inlets to the root node, and another variable being a penalty related to not unload inlets that are loaded with waste at a level above their assigned capacity, and one operational constraint being that only inlets from at most one sector can be unloaded in any distinct unloading sequence;

- transporting the unloaded waste from the inlets of the selected sequence to the root node.

Optimization algorithms can be applied to a model of the parameters of the system. Said model can be encoded and solved as a linear program. The resulting decisions (sequences of inlets to be unloaded) manage to reduce the time the absorption or aspiration engine (provided at the collection facility -i.e. root node) is working, thus increasing the treatment capacity of the plant, and of course reducing the energy consumption thereof.

The step of selecting the next sequence of inlets to be unloaded may be performed in parallel with the step of transporting the waste from the inlets of the last selected sequence.

In some embodiments, the estimation of the cost of the consumed energy may be made separately for the transitory energy consumed when changing, from one sequence to the next, the sector where the unloading is to take place or the air speed to be applied to the unloaded waste, and for the stationary energy consumed during the actual waste transportation. The air speed may be different for different types of waste fraction. The transitory energy can be of around 10% of the stationary energy, and the latter can be of the order or 20 megajoule.

In some embodiments, the cost function comprises the sum of said at least two variables, and it may comprise the sum of the estimation of the cost of said transitory energy and the estimation of the cost of said stationary energy. For example, the cost function may be the sum of an estimation of the cost of energy and a penalty, or it may be the sum of an estimation of the cost of transitory and stationary energy and a penalty. The estimation of the cost of the transitory energy may be a function of at least the respective types of waste fraction transported in two consecutive unloading sequences, the respective air speeds for the waste transportation in two consecutive unloading sequences, and the amount of air to be removed in one unloading sequence before the actual waste transportation is started.

The estimation of the cost of the stationary energy may be a function of at least the air speed for the waste transportation in an unloading sequence, the amount of waste to be transported in an unloading sequence, and the inlets included in an unloading sequence and the order in which said inlets are to be unloaded. The network of waste inlets can be represented by a graph, and said graph may be a tree, that is, a rooted graph without loops.

In some embodiments, the step of ordering the inlets may comprise the substeps of:

- ordering the inlets on each branch starting from the farthest from the root node and ending in the nearest to the root node;

- ordering the branches that joins a junction node in the descending order of the distance from the last inlet of each branch to the root node;

- iterating over all the junction nodes of the tree until all the inlets are ordered.

So, inlets of a single branch may be ordered starting from the most upstream (the farthest from the root node) and ending in the most downstream. Then branches joining a junction node may be ordered by combining the inlet sequences of all these branches. For each branch, the distance from the last inlet of its sequence to the root node is considered, ordering the sequences by descending order of such distances. These steps are iterated until the complete ordering for the whole tree is obtained. This ordering gives preference to starting always at the farthest inlet, because the energy needed for transporting the waste of a sequence of inlets down to the root node is more sensitive to the distance from the last inlet to the root node.

In some embodiments, at least one of the following is another operational constraint in the minimization of the cost function:

- only one type of waste fraction can be unloaded in the next unloading sequence;

- at most one sector is active in the next unloading sequence;

- inlets belong to at least one sector;

- a least one inlet is active if a sector is active;

- not more than a maximum quantity can be transported for each type of waste fraction;

- the air speed is upper and lower bounded for each type of waste fraction;

- only inlets loaded at a level above a threshold can be unloaded. The method may comprise modelling the waste collection system and encoding the resulting model as a constraint integer program. The minimization of the cost function may comprise using an algorithm to solve said constraint integer program.

The method may also comprise the step of planning the future unloading sequences with a time horizon of at least one hundred such sequences. Each sequence typically lasts a few minutes, so a convenient time horizon may be of half a day or, preferably, of a day.

In some embodiments, said planning may comprise assigning a value to each state of the waste collection system, any such state being a selectable distinct unloading sequence. Said assignation may be based on historical data compiled from the past operation of the waste collection system. Said values are of a stochastic nature.

In some embodiments, said planning may comprise defining and solving a problem of dynamic programming, in which the solving step might include said minimization of the cost function given the current state of the waste collection system and the value assigned to each state thereof.

BRIEF DESCRIPTION OF THE DRAWINGS

Some particular embodiments of the present invention will be described in the following, only by way of non-limiting example, with reference to the appended drawings, in which: the sole figure is a schematic diagram of a simplified automatic vacuum waste collection plant.

DESCRIPTION OF PARTICULAR EMBODIMENTS An automated waste collection system (AWCS) typically uses air suction on a closed network of underground pipes, covering an area of a few square kilometres, to transport waste from the drop off points scattered throughout the city to a central collection point, reducing greenhouse gas emissions and the inconveniences of conventional methods (odours, noise, . . . ), as well as allowing better waste reuse and recycling.

The pipe network may always be represented as a graph, frequently rooted and tree shaped, that is, a graph with at least one root node and no loops; the central collection point is located at the root node.

This central collection point has the means to split the collected waste by fraction (organic fraction, paper, etc.), and is where waste is packed for disposal in containers that are then transported with trucks to a landfill area for recycling or mechanical/biological treatment. The network usually has sector valves located on some of the branch junctions that can isolate one of the branches (to reduce the volume of air that will be suctioned). The drop-off points are located along the branches, and contain inlets for the different waste fractions. There are also air valves that act as air entry points that help produce the air flow when the suction starts. Air valves can be located next to inlets, although it is not mandatory to have an air valve in each drop off point. An AWCS system has a control software that includes the implementation of a method for deciding when and what inlets, corresponding to a same fraction, should be emptied during a time interval (time slot) taking into account a number of constraints (e.g., full inlets should be emptied, inlets should be emptied at least once a day, air speed, . . . ). Since a significant part of the cost of operating AWCS systems is energy consumption, it is important to devise ways to minimize it.

An underground automated waste collection system is modelled as a set {T, I, f, V^a, V^s}. In some embodiments, T(N, Q) is a rooted tree with nodes (N) representing either waste inlets (I) or pipe junctions, and edges (<S) corresponding to union pipes between nodes, f represents the set of fractions waste is divided into. Air valves (V^a), located at some inlets, create air streams able to empty downstream inlets. Sector valves (V^s) are disposed along the tree in order to segment the whole tree structure, defining isolated sectors (s), making a more efficient transport for the inlets comprised in the corresponding sector. Sectors are subtrees of T, always containing the root node and a subset of I (I^s).

Each inlet in I is denoted by I[f,i], fef and ieN, while v[a,j]eV^a and v[s,j]eV^s denote the j^th air and sector valves, respectively. The status of any valve is open (o) or closed (c). The sole figure is a small example of such a system, with 3 types of fraction (fi, h, f₃), 5 inlets (two of them handling 2 types of fraction, so one can consider having 7 inlets), 4 air valves and 3 sector valves; the root node is denoted by RN. Note that in this case, only 5 combinations of V^s out of the 8 possible are valid, giving 5 different sectors (following the notation (v[s,l], v[s,2], v[s,3]), {(c; c; c), (c; o; c)} are not valid assignments and {(c; c; o), (c; o; o)} give the same sector configuration).

Three important subtrees that will deeply impact the system dynamics arise from the system topology: emptying, air and vacuum subtrees. The emptying subtree (T[E,i]) is unique for each inlet, and is defined as the path that waste must follow from inlet i to the root node. Of course, T[E,i] must not contain closed sector valves on it. The air subtree (T[A,i]) is the path followed by the air stream in charge of waste transport along T[E,i]. Note that T[E,i] is a subset of T[A,i], being equal if inlet i has an air valve, otherwise, the airflow must come from an upstream inlet. The vacuum subtree (T[V,s]) is unique for each sector and represents the total amount of air to be moved before proceeding to waste transport. Let's denote by d(T) the total length of a tree.

As an example, let's consider inlet number 2 (I[f_3/2]) of the sole figure. In this case, d(T[E,2]) = d(ei)+d(e₂)+ d(e₃) and d(T[A,2]) = d(T[E,2]) + d(e₄), where e_k denote the k^th edge. Inlet 2 can be emptied by 2 sectors: s[2,3] and s[2,3] (v[s,2] = o, v[s,3] = c and v[s,2] = o, v[s,3] = o, respectively). For the first case, d(T[V,s[2,3]]) = d(ei) + d(e₂) + d(e₃) + d(e₄) + d(e₅).

When inlets are additionally indexed by time, I[f,i,t] indicates their waste occupancy at a given time, capturing this way the stochastic behaviour of users. At any time, one can define an emptying sequence (e[f,s,t]) as an ordered sequence of loads to be transferred from inlets corresponding to sector s and type of fraction f, subject to a maximum transfer capacity (L[f,max]) per sequence depending on type of fraction. That is, e[f,s,t] = {L[f,U] I L[f,U] < i[f,i,t], I[f,i] e I^s, ∑i[f,i]_ep L[f,U] < L[f,max]}. Emptying sequences can not overlap in time and can be null (nothing to do).

As the objective will be to define optimal emptying sequences for a time interval (i.e. a day), some dynamic elements of the model must be defined. Air speed operation is an important one, being crucial to determine sequences duration and, consequently, energy consumptions. It is assumed that the air speed (v_t) is constant during an emptying sequence. Due to structural reasons, v_t has a maximum (VM). Furthermore, each inlet is characterized by a minimum air speed operation (V[f,i]) to avoid pipe obstructs.

The second element is the operation time (T[t]), which is defined as the required time to operate an emptying sequence, depending on the sequence itself, the air speed of operation v_t, and the previous operation state of the system. Such a previous operation state can be: operating an emptying sequence for type of fraction f and sector s' at speed v_t-i or idle (v_t-i = 0). The operation time is divided into two phases: a transitory phase (T^tr[t]) in which the previous speed (v_t-i) changes progressively to the current speed (v_t), and a stationary phase (T^st[t]) devoted to emptying the chosen sequence. T^tr[t] is a function of three types of parameters. First, the previous and the current operational air speed. Second, the type of fraction, because if there is a change of type of fraction among the previous and actual emptying sequences, the air speed must be dropped to a low value due to operational requirements; otherwise, it is enough to increase or decrease the air speed from the previous value (v_t-i) to the current one (v_t). Third, the total amount of air to be adapted, which depends on the vacuum paths of the previous sector (s') and the current sector (s), and can be obtained as T[V,s] - T[V,s]nT[V,s'] . It can expressed: f=f : x*[t] = c«[l,t] · I v_t - vt-i I + c*[2,t] · (d(T[V,s]) - d(T[V_/S]nT[V_/S'])) {≠{' : T*[t] = c«[l,t] · (v_t + vt-i) + c*[2,t] · (d(T[V,s]) - d(T[V_/S]nT[V_/S'])) where c^tr[l,t] and c^tr[2,t] are constants for a given system, as detailed below.

Once the transitory phase ends and the new air speed is reached, the stationary operation can be started in order to proceed with the emptying sequence. An emptying sequence consists of two operations that iterate over the ordered sequence of inlets; first, to empty an inlet over the transport pipes, and second, to proceed to waste transport. The transport of waste and the empty phase of the next inlet can overlap in time if and only if the inlet to be emptied is upstream the estimated position of the waste being transported. Under these assumptions:

T^St[t] = ∑L[f,j,t]=next(L[f,i,t]) T*[t](i, j) , L[f,i,t]ee[f,S,t] T*[t](i, j) = c [l,t] · L[f,i,t] + (d(T[E,i]) - d(T[E,i]nT[E,j]))/v_t where next() is the following element in the ordered sequence e[f,s,t] . And next() of the last element in the sequence is the root node. Note that if I[f,j] is upstream I[f,i], then d(T[E_/i]) - d(T[E_/i]nT[E_/j]) = 0 , meaning that once I[f,i] has been emptied, we can proceed to empty I[f,j].

Energy is closely related to the operation time, and can also be splitted into two parts: transitory and stationary. It is easy to understand that, for the transitory case, there is only energy consumption for the process of increasing air speed but not for decreasing it. The transitory energy can then be expressed as follows: f=f : E*[t] = ο*[1,ε] · I v_t - vt-i I ⁺ + c«[2,e] · (d(T[V,s]) - d(T[V_/S]nT[V_/S'])) f≠f : E*[t] = ο*[1,ε] · v_t + ο*[2,ε] · (d(T[V,s]) - d(T[V,s]nT[V,s'])) where

| x | ⁺ = 0 , x < 0 ; | x | ⁺ = x , x > 0 .

For the stationary part of the energy the air path plays an important role. For the same emptying path, the minimum transport energy is obtained when the shortest air path is employed, that is, by opening the upstream air valve closest to the inlet being emptied. The type of fraction also affects the power requirements, needing more energy those types of fraction that are more dense. Under these considerations, it is assumed that, during the stationary phase, power consumption is a linear function of the air path, c^st[l,e](r)+c^st[2,e](r) · d(T[A,i]), with coefficients depending on the type of fraction. The stationary energy can be expressed as follows:

E^st[t] =

(c*[U](f)+c*[¾e](f)^■ d(T^A[i])) ^■ T* [t](i, j) , . The objective is to find a set of emptying sequences and air speed operations, {e[f,s,t]} χ {v_t}, 0 < t < T, for an operative period of time T (e.g. a day), that minimizes the energy cost,∑o≤t≤T f_c(t) · (E^tr[t]+E^st[t]) , subject to the following constraints:

- I[f,i_/0], V I[f,i] e I. Constant giving the initial inlet loads.

- I[f,i,t] = I[£,i,t-1] + d[Ut-l] - L[f,i,t-1], V I[f,i] e I, 0<t<T. Inlets volume update. Random process d[f,i,t] denotes user waste disposal into I[f,i] during time slot t.

- I[UT] < ε[ί,ϊ], l[f,i] e I. Inlets residual load.

- I[f,i,t-1] > th[f,i] ==> I[f,U] < th[f,i], V I[f,i] e I, 0<t<T . Inlets over load threshold must be included.

- e[f _S t] = {L[f,i,t] I 0<t≤T, L[f,i,t]^<£I[f,i,t], I[f,i] e I^s,∑i[f,i_]e L[f,i,t] < Lfrmax]}, 0<t≤T. Emptying sequence maximum load per inlet and maximum transfer load.

- max i[f,i]ep (V[f,i]) < v_t < VM; 0<t<T. Range of operational air speed.

The energy cost (f_c(t)) depends on time and on the energy fares. The system has a stochastic behaviour, that is, the way the users dispose waste into the inlets has a random component. This randomness can be described by a list of real world disposals (d[f,i,t]) or by a parameterized random function for arrival times and waste amount for any inlet. The problem described above can be tackled by different dynamic programming approaches. All of them will require, at some point, an optimization step. It is presently describe how a single problem instance can be encoded as a Constraint Integer Program (CIP). Such an instance is specified by the system status at the end of a time slot, before performing an optimal decision.

A CIP is defined by a set of variables (integer and real valued), constraints (among the variables) and an objective function. From the system model {T, I, V^a, V^s}, the disposition of the sector valves (V^s) determine a set of sectors (S).

For determining the emptying sequence of any chosen subset of inlets, it is necessary to provide a total ordering of such inlets. This is an important step towards minimizing the energy needed for emptying a subset of inlets. A possible ordering algorithm is presently described; it orders once all the inlets of the plant and the resulting total order is then used for ordering any subset of inlets chosen at any execution of the optimization algorithm.

Notation and auxiliary functions used in the ordering algorithm:

- I: set of inlets.

- T (N, Q) binary tree where nodes can be of different classes:

· Root node: the node with the absorption engine (collection facility), that is connected with either a junction node or with an internal inlet node.

• Junction node: an internal node with two upstream pipes and one downstream pipe. The two son nodes of a junction node n are denoted as sonl(n) and son2(n).

· Internal inlet node: an internal node with an inlet with a downstream pipe and an upstream pipe. The son on an internal inlet node n is denoted as son(n).

• Leaf node: a leaf node can either contain an inlet or simply an air valve.

- getfarthest(T(N, Q), r): a function that gets the farthest inlet node fn of the subtree T_r, and its distance d from the root of T(N, Q) in the pair (fn, d), or return (null, 0) if there is no inlet in T_r.

The ordering algorithm is defined recursively for a plant tree, or plant subtree, and the ordering it gives depends on the following possible cases for the plant tree:

1 . leaf inlet node: in this base case the ordering contains only the inlet node.

2. internal inlet node: all the inlet nodes of the subtree attached to the node will be inserted first in the ordering, and then the inlet node.

3. junction node: all the inlet nodes of the subtree that contains the farthest node from the root node will be inserted first, and then the inlet nodes of the other subtrees. Algorithm OrderlnletsfTYM e ), mode)

L := [] ;

// L will contain the ordered list of inlets, starting from the furthest node from mode up to mode switch typeof(rnode) is do

case junction

(fl, dl) := getfarthest(T(N, e), sonl(rnode)) ;

(f¾ d2) := getfarthest(T(N, e), son2(rnode)) ;

Li := Orderlnlets(T(N, e), sonl( mode)) ;

L₂ := Orderlnlets(T(N, e), son2( mode)) ;

L := Li | L₂

else

L := L₂ | Li

case inner inlet

L := Orderlnlets(T(N, e), son(rnode)) | [mode]

case leaf inlet

L := [mode]

case leaf valve

L := []

return L ;

Before defining the variables and constraints, the following parameters not mentioned before are defined: - pu[f,i] e R, f = 1 ... |f I , i = 1 ... I X I , is the penalty cost due to left unloaded the inlet I[f,i] above a given threshold of its maximum capacity (th[f,i]).

- L[f,i] e R, is the load of I[f,i] at the beginning of the time slot being optimized (I[f,U]).

- s' e {1 ... I S I }, denotes the previous active sector.

- f' e {l ... I f I }, denotes the previous active fraction.

- v' e R, denotes the previous operational speed.

- Ind : {0 ... | I| } -> {0 ... | I| }, is a function that orders the set I U 0 according to the above definition, 0 being the root node.

- Vp : {(1 ... I S I ) x (1 ... | S | )} ÷ R, Vp(s, s') = d(T[V,s]) - d(T[V,s] Π T[V,s']), is the vacuum path.

- Ep : {(0 ... 1 1| ) x (0 ... 1 1| )} ÷ R, Ep(i, j) = d(T[E,i]) - d(T[R,i] Π T[E,j]), is the emptying path. - Ap : {(1... 11| } -» R, Ap(i) = d(T[A,i]), is the air path.

In the CIP model there are decision variables over which the search is performed, and auxiliary variables in order to make a more readable set of constraints. The following decision variables are defined:

- si e {0, 1}, i = 1... I S I , indicates whether a sector is activated for emptying.

- ft e {0, 1}, i = 1... I f I , determines the fraction.

- l/[s,f,i] e {0, 1}, s = 1... |S|,f = l ... |f|,i = l ... 11| , indicates whether inlet I[f,i] is going to be emptied with sector s. It is assumed that inlets can not be partially emptied.

- v e R. Operational air speed.

The auxiliary variables are:

- b[f,i] =∑i<s<|s| l[s,i,i] e {0, 1}, f = 1... |f \, i = 1... 11| , indicates whether an inlet I[f,i] is active regardless of the sector being considered.

-p[s,f,i,j] e{0,l},s = l... |S|,f = l... |f|,i = l... 11| , Ind(i) < Ind(j). It is a pair of inlet indicators, keeping track active inlets and their corresponding following up. It helps to compute energy.

- v^tr e R, is the air speed value to be considered in the transitory phase for energy calculation, depending on the fraction to be transported.

- E^tr = c^tr[l,e] · v^tr + c^tr[2,e] -∑i≤i<|s| s.^■ Vp(i, s') e R, is the transitory energy. -T^st[i,j]

(c^st[l,t] -k[s,f,i] -Lfril + ipfrUj] -Ep(j,i))/v) e R, i =1... |I|,j = l... 111 , is the stationary time.

- c^st [i,e] =∑i≤j≤|F| c^st[i;e](j) -fj e R, i e {1, 2}, determines the coefficients for the stationary energy calculation.

- E =∑i<i<|i| ∑!<,< 11|, ind(i)<ind(,) (c^st[l,e] + c^st[2,e] · Ap(j)) · T*[i,j] e R, is the stationary energy.

- P =∑i≤i≤|i| ∑i≤f≤|p| pu[f,i] · (1 - b[f,i]) e R, is the penalty due to leave unloaded inlets above a given threshold.

The constraints are: -∑i≤i< I s I si < 1. At most one active sector.

-∑i≤i≤|F| fi < 1. At most one active fraction.

- -| ¾ ==> -| l[),Q], V i = 1... |I|,j = l ... |S|,f = l ... | f | . Inactive sector propagation.

--_|fk==>-_| k[s,k,i], Vi = 1... I X| , s = 1... |S|,k = l ... | f | . Inactive fraction propagation.

-∑s,f,i ^[s,f,i] -L[f,i] < L[f,max]. Maximum transfer load per fraction.

- maxi=i...|i| (V[f,i] · b[f,i]) < v < VM e R. Operational air speed.

-∑i≤i≤|i| p[s,f,0,i]≤ 1, V s = 1... |S|,f = 1... |f |. Root node (0) has at most one follow up inlet.

- -| l[s,i,i] ==> (n p[s,f,i,j] Λ p[s,f,j',i], V s = 1... I S I , f = 1... | f | , i = 1... |I|,j = l ... \I\ : i <],]' = 0... \I\ :j'<i. Inactive inlet propagation.

- i/[s,f,i]) ==>∑o≤j<|i|, ind(j)<ind(i) plsXj/i] = 1, V s = 1... |S|, f = 1... | \ , i = 1 ... 111. Exactly one follow down inlet.

- (sj Λ f_k) ==>∑i<i<|i| b[j,k,i]≥ X j = 1... |S|, f = 1... |f | . At least one active inlet for active sector and fraction.

- ff ==> (v^tr = |v - v'|⁺). Speed contribution to transitory energy when fraction to be transported remains the same.

- -| ff ==> (v^tr = v). Speed contribution to transitory energy when fraction to be transported changes.

- L[f,i] < £[f,i] ==> η ί,ϊ], V i = 1 ... |I|, f = 1 ... |f | . Don't empty inlets below a residual threshold.

The objective is to minimize the energy consumption plus the penalty for leaving unloaded inlets above a threshold of their maximum capacity, i.e., to minimize the objective function (E^tr + E^st + P): min (E^tr + E^st + P)

This provides the immediately optimal decision. As an automated vacuum waste collection plant operates nonstop, and it being a strong requirement that all the inlets must be emptied at least once a day, one can think on planning operations with a time horizon of, e.g., a day.

Planning algorithms can be based on dynamic programming techniques and should take optimal decisions at each time slot, according to the above process. The time granularity (time duration of a time slot) will be lower bounded by the time required to take these decisions and will be determined by the encoding and the optimization solver performance. Considering that in a real scenario the time duration of an emptying sequence is in the order of a few minutes, the solver should give an optimal result in a matter of minutes, which is feasible (see below).

The status of the system, beyond being deterministic, is subject to the stochastic behaviour of users, so that, at each time slot, the system value depends on the value of the next time slot plus the cost of operation for the decisions taken on the current time slot. One possible approach is to use machine learning mechanisms to train the system, using dynamic algorithms that learn from historical data of existing plants (corpus data) about the values of the system. This training process has two main characteristics.

Firstly, the states of the system are characterized. The inlet's status, even simplified to a few number of levels, makes unfeasible a wholesome approach. As an example, 50 inlets described by three filling levels lead to a huge number of states (~10²³). Thus, some kind of aggregation will be needed in order to reduce the dimensionality of the problem. In is proposed to aggregate inlet filling levels, so characterizing the system status by sector filling levels instead of inlets, and defining this way a more accurate number of levels for the sector. It is also proposed a non linear contribution to the sector filling level amount for inlets beyond a given threshold level of occupancy, making more relevant those states with high occupancy inlets.

Secondly, the transition probabilities among the above mentioned states must be derived. As it is not feasible to characterize the stochastic behaviour of the inlets (users), it is proposed a learning schema based on approximate dynamic programming algorithms. In such algorithms, one trains the system by two different loops. First, the algorithm iterates through the time line, computing the system value for a given time slot, according to an optimal decision, and for a given realization of the stochastic input processes, namely input levels. As there are historic data with different realizations of the stochastic input process, the algorithm iterates in a second loop over all the possible realizations.

In this way, the approximate values of the system at each time slot are considered in the optimization process, an optimal sequence is derived, and the computed results feedback the historical data for system readjustments. As already mentioned, considering that in a real scenario the time duration of an emptying sequence is in the order of a few minutes, the ability of the solver to give an optimal result in few minutes will determine its suitability for real time operation. With this objective in mind, three existing plants have been encoded as five real problems and optimal solutions have been computed under different load situations. Table 1 summarizes the results.

The columns of Table 1 are:

- A problem name with its corresponding topology. Problem 2.1 and 2.2 correspond to the same plant with different sectorizations, as it is for problem

3.1 and 3.2.

- The number of drop-off points and inlets.

- The number of sections and fractions.

- The number of variables and constraints before and after pre-solving.

- Time to solve. A time limit of 5 minutes has been employed. This is a typical value for the emptying sequence time in a vacuum plant and gives the time limit for taking the next decision (i.e., while an emptying sequence is under way).

- The solution gap as the relative difference between the primal and dual bounds. This gives a measure of the accuracy of the solution hitherto obtained in relation to the optimal solution.

- The system load as the percentage of inlets with a load above the residual threshold. This parameter increases the number of variables and constraints after the pre-solving phase. Among the loaded inlets, roughly a 20% of them are loaded above the penalty threshold (th[f,i]).

# # # Time Gap Load

Problem # fract. # vars. # const.

drops inlets sect. (s.) (%) (%) p1 39 54 6 2 26,910 94 35,443 264 84 0 10 p1 39 54 6 2 26,899 223 35,439 657 84 0 20 p1 39 54 6 2 26,910 513 35,434 1 ,413 88 0 30 p1 39 54 6 2 26,910 1 ,367 35,424 3,712 146 0 50 p2.1 30 102 4 4 21 ,708 119 28,661 336 7 0 10 p2.1 30 102 4 4 21 ,708 334 28,651 962 - 0.77 20 p2.1 30 102 4 4 21 ,708 679 28,640 1 ,941 - 1.45 30 p2.1 30 102 4 4 21 ,708 1 ,331 28,618 3,742 - 5.95 50 p2.2 30 102 9 4 32,086 198 42,835 568 16 0 10 p2.2 30 102 9 4 32,086 545 42,375 1 ,616 - 0.32 20 p2.2 30 102 9 4 32,086 1 ,134 42,364 3,261 - 2.38 30 p2.2 30 102 9 4 32,086 2,096 42,342 5,951 - 10.34 50 p3.1 53 109 4 2 40,126 89 52,836 21 1 135 0 10 p3.1 53 109 4 2 40,126 260 52,825 625 138 0 20 p3.1 53 109 4 2 40,126 658 52,816 1 ,609 - 0.61 30 p3.1 53 109 4 2 40,126 1 ,015 52,794 2,429 169 0 50 p3.2 53 109 5 2 15,549 49 20,540 133 23 0 10 p3.2 53 109 5 2 15,549 104 20,529 288 23 0 20 p3.2 53 109 5 2 15,549 284 20,520 746 24 0 30 p3.2 53 109 5 2 15,549 1 ,476 20,488 1 ,235 25 0 50

Table 1

The problems have been solved with SCIP version 2.1 .1 [3] with SoPlex 1 .6 and default settings in a 2.66 GHz processor. The solving times are clearly suitable for real time operation.

Although only a number of particular embodiments and examples of the invention have been disclosed herein, it will be understood by those skilled in the art that other alternative embodiments and/or uses of the invention and obvious modifications and equivalents thereof are possible. Furthermore, the present invention covers all possible combinations of the particular embodiments described. Reference signs related to drawings and placed in parentheses in a claim, are solely for attempting to increase the intelligibility of the claim, and shall not be construed as limiting the scope of the claim. Thus, the scope of the present invention should not be limited by particular embodiments, but should be determined only by a fair reading of the claims that follow.

Further, although the embodiments of the invention described with reference to the drawings comprise computer apparatus and processes performed in computer apparatus, the invention also extends to computer programs, particularly computer programs on or in a carrier, adapted for putting the invention into practice. The program may be in the form of source code, object code, a code intermediate source and object code such as in partially compiled form, or in any other form suitable for use in the implementation of the processes according to the invention. The carrier may be any entity or device capable of carrying the program.

For example, the carrier may comprise a storage medium, such as a ROM, for example a CD ROM or a semiconductor ROM, or a magnetic recording medium, for example a floppy disc or hard disk. Further, the carrier may be a transmissible carrier such as an electrical or optical signal, which may be conveyed via electrical or optical cable or by radio or other means. When the program is embodied in a signal that may be conveyed directly by a cable or other device or means, the carrier may be constituted by such cable or other device or means.

Alternatively, the carrier may be an integrated circuit in which the program is embedded, the integrated circuit being adapted for performing, or for use in the performance of, the relevant processes.

Claims

1 . Method for the removal of waste from a network of waste inlets in an automated waste collection system, said inlets being adapted to be loaded with at least one type of waste fraction, said network having a root node where the collection facility is, and said system comprising at least one valve that defines at least two sectors, any sector comprising the root node and the inlets connected thereto under one condition of the valve, either open or closed,

the method comprising:

- ordering all the inlets of the waste collection system;

2. Method according to claim 1 , wherein the step of selecting the next sequence of inlets to be unloaded is performed in parallel with the step of transporting the waste from the inlets of the last selected sequence.

3. Method according to claim 2, wherein the estimation of the cost of the consumed energy is made separately for the transitory energy consumed when changing, from one sequence to the next, the sector where the unloading is to take place or the air speed to be applied to the unloaded waste, and for the stationary energy consumed during the actual waste transportation.

4. Method according to claim 3, wherein the cost function comprises the sum of the estimation of the cost of said transitory energy and the estimation of the cost of said stationary energy.

5. Method according to claim 3 or 4, wherein the estimation of the cost of the transitory energy is a function of at least the respective types of waste fraction transported in two consecutive unloading sequences, the respective air speeds for the waste transportation in two consecutive unloading sequences, and the amount of air to be removed in one unloading sequence before the actual waste transportation is started.

6. Method according to any of claims 3 to 5, wherein the estimation of the cost of the stationary energy is a function of at least the air speed for the waste transportation in an unloading sequence, the amount of waste to be transported in an unloading sequence, and the inlets included in an unloading sequence and the order in which said inlets are to be unloaded.

7. Method according to any of the preceding claims, wherein the network is tree-shaped.

8. Method according to claim 7, wherein the step of ordering the inlets comprises the substeps of:

9. Method according to any of the preceding claims, wherein at least one of the following is another operational constraint in the minimization of the cost function:

- at most one sector is active in the next unloading sequence;

- inlets belong to at least one sector;

- a least one inlet is active if a sector is active;

- the air speed is upper and lower bounded for each type of waste fraction; - only inlets loaded at a level above a threshold can be unloaded.

10. Method according to any of the preceding claims, which comprises modelling the waste collection system and encoding the resulting model as a constraint integer program.

11 . Method according to any of the preceding claims, which comprises the step of planning the future unloading sequences with a time horizon of at least one hundred such sequences.

12. Method according to claim 11 , wherein said planning comprises assigning a value to each state of the waste collection system, any such state being a selectable distinct unloading sequence.

13. Method according to claim 12, wherein said assignation is based on historical data compiled from the past operation of the waste collection system.

14. Method according to claim 12 or 13, wherein said planning comprises defining and solving a problem of dynamic programming, in which the solving step includes said minimization of the cost function given the current state of the waste collection system and the value assigned to each state thereof.

15. A computer program product comprising program instructions for causing a computer system to perform the method for the removal of waste from a network of waste inlets in an automated waste collection system according to any of claims 1 to 14.

16. A computer program product according to claim 15, embodied on a storage medium.

17. A computer program product according to claim 15, carried on a carrier signal.