The variable exponent BV-Sobolev capacity

Abstract In this article we study basic properties of the mixed BV-Sobolev capacity with variable exponent p. We give an alternative way to define mixed type BV-Sobolev-space which was originally introduced by Harjulehto, Hästö, and Latvala. Our definition is based on relaxing the p-energy functional with respect to the Lebesgue space topology. We prove that this procedure produces a Banach space that coincides with the space defined by Harjulehto et al. for bounded domain Ω and log-Hölder continuous exponent p. Then we show that this induces a type of variable exponent BV-capacity and that this is a Choquet capacity with many usual properties. Finally, we prove that this capacity has the same null sets as the variable exponent Sobolev capacity when p is log-Hölder continuous

Dynamic Collection Scheduling Using Remote Asset Monitoring: Case Study in the UK Charity Sector

Remote sensing technology is now coming onto the market in the waste collection sector. This technology allows waste and recycling receptacles to report their fill levels at regular intervals. This reporting enables collection schedules to be optimized dynamically to meet true servicing needs in a better way and so reduce transport costs and ensure that visits to clients are made in a timely fashion. This paper describes a real-life logistics problem faced by a leading UK charity that services its textile and book donation banks and its high street stores by using a common fleet of vehicles with various carrying capacities. Use of a common fleet gives rise to a vehicle routing problem in which visits to stores are on fixed days of the week with time window constraints and visits to banks (fitted with remote fill-monitoring technology) are made in a timely fashion so that the banks do not become full before collection. A tabu search algorithm was developed to provide vehicle routes for the next day of operation on the basis of the maximization of profit. A longer look-ahead period was not considered because donation rates to banks are highly variable. The algorithm included parameters that specified the minimum fill level (e.g., 50%) required to allow a visit to a bank and a penalty function used to encourage visits to banks that are becoming full. The results showed that the algorithm significantly reduced visits to banks and increased profit by up to 2.4%, with the best performance obtained when the donation rates were more variable

Yritystukien uudistamista koskeva parlamentaarinen työryhmä, loppuraportti

Parlamentaarisen yritystukityöryhmän toimeksiantona on ollut laatia tiekartta yritystukien uudistamiseksi. Työryhmä päätti, että se ei laadi yritystukien tiekarttaa vuosille 2019-2023 koskien nykyisten yritystukien supistamista ja tukien uudelleen suuntaamista. Työryhmän ehdotukset koskevat yritystukien arvioinnin yhteisiä kriteereitä. Lisäksi työryhmä ehdottaa, että yritystukineuvottelukunnan toimintaa vahvistetaan tutkimusjaostolla ja elinkeinopoliittisella jaostolla. Tutkimusjaoston statuksena olisi toimia riippumattomana arviointielimenä. Elinkeinopoliittisen jaoston statuksena olisi toimia sidosryhmien yhteisenä keskustelufoorumina yritystukien toimivuudesta ja vaikuttavuudesta. Työryhmän hankesivut: http://tem.fi/hankesivu?tunnus=TEM082:00/201

Quantifying the transport impacts of domestic waste collection strategies

This paper models the effects of three different options for domestic waste collection using data from three Hampshire authorities: (i) joint working between neighbouring waste collection authorities; (ii) basing vehicles at waste disposal sites; (iii) alternate weekly collection of residual waste and dry recyclables. A vehicle mileage saving of 3% was modelled for joint working, where existing vehicle allocations to depots were maintained, which increased to 5.9% when vehicles were re-allocated to depots optimally. Vehicle mileage was reduced by 13.5% when the collection rounds were based out of the two waste disposal sites rather than out of the existing depots, suggesting that the former could be the most effective place to keep vehicles providing that travel arrangements for the crews could be made. Alternate weekly collection was modelled to reduce vehicle mileage by around 8% and time taken by 14%, when compared with a typical scenario of weekly collection of residual and fortnightly collection of recyclable waste. These results were based on an assumption that 20% of the residual waste would be directly diverted into the dry recyclables waste strea

Using Simulation to Assess the Opportunities of Dynamic Waste Collection

In this paper, we illustrate the use of discrete event simulation to evaluate how dynamic planning methodologies can be best applied for the collection of waste from underground containers. We present a case study that took place at the waste collection company Twente Milieu, located in The Netherlands. Even though the underground containers are already equipped with motion sensors, the planning of container emptying’s is still based on static cyclic schedules. It is expected that the use of a dynamic planning methodology, that employs sensor information, will result in a more efficient collection process with respect to customer satisfaction, profits, and CO2 emissions. In this research we use simulation to (i) evaluate the current planning methodology, (ii) evaluate various dynamic planning possibilities, (iii) quantify the benefits of switching to a dynamic collection process, and (iv) quantify the benefits of investing in fill‐level sensors. After simulating all scenarios, we conclude that major improvements can be achieved, both with respect to logistical costs as well as customer satisfaction

Waste collection routing-limited multiple landfills and heterogeneous fleet

This article deals with a real-life waste collection routing problem. To efficiently plan waste collection, large municipalities may be partitioned into convenient sectors and only then can routing problems be solved in each sector. Three diverse situations are described, resulting in three different new models. In the first situation, there is a single point of waste disposal from where the vehicles depart and to where they return. The vehicle fleet comprises three types of collection vehicles. In the second, the garage does not match any of the points of disposal. The vehicle is unique and the points of disposal (landfills or transfer stations) may have limitations in terms of the number of visits per day. In the third situation, disposal points are multiple (they do not coincide with the garage), they are limited in the number of visits, and the fleet is composed of two types of vehicles. Computational results based not only on instances adapted from the literature but also on real cases are presented and analyzed. In particular, the results also show the effectiveness of combining sectorization and routing to solve waste collection problems