Planning petrol station replenishment is an important logistics activity for all the major oil companies. The studied Multi-Depot Periodic Petrol Station Replenishment problem derives from a real case in which the company must replenish a set of petrol stations from a set of depots, during a weekly planning horizon. The company must ensure refuelling according to available visiting patterns, which can be different from customer to customer. A visiting pattern predefines how many times (days) the replenishment occurs during a week and in which visiting days a certain amount of fuel must be delivered. To fulfill the weekly demand of each petrol station, one of the available replenishment plans must be selected among a given set of visiting patterns. The aim is to minimize the total distance travelled by the fleet of tank trucks during the entire planning horizon. A matheuristic approach is proposed, based on the cluster-first route-second paradigm, to solve it. The proposed approach is thoroughly tested on a set of realistic random instances. Finally, a weekly large real instance is considered with 194 petrol stations and two depots.

E-commerce is a continuously growing sector worldwide, with important repercussions on the delivery system in urban areas and especially in the Business to Consumer (B2C) sector. The delivery of a package to a consumer's address involves not only high costs for couriers (greater number of kilometres travelled), but also increased congestion and greater environmental pollution (greater volume of pollutants released into the air). To rationalize deliveries in urban areas the use of collection points, equipped with lockers, to store the goods that users have ordered has been considered in literature. This work compares two alternative delivery options: deliveries to the consumer's home versus to Lockers. To make this comparison we used a cluster first route second math-heuristic approach. In the clustering phase, we experimented a new clustering function, while the routing phase consists in solving an instance of the Traveling Salesman Problem for each generated cluster. Finally, we applied the math-heuristic to a real case (the Italian municipality of Dolo near Venice) and compared the two delivery alternatives. We evaluate the performance considering two different fleets of vehicles, with small and medium capacity. In addition, since additional trips might be performed by consumers to pick up parcels at Lockers, a sensitivity analysis was carried out to analyse the sustainability of the proposed city logistics scheme.

This paper studies a scheduling problem application for the optimization of the employees used in aircrafts' refueling in a medium size airport. The problem is modelled as a particular resource leveling problem for which we provide a mixed integer mathematical formulation that we solve with CPLEX. The model allows to evaluate and analyse different scenarios that could be considered by the company in place of the current one in order to rearrange the available human resources used in refueling activity. Experimental results on a set of real test cases provided by an oil & gas company are discussed.

E-commerce is a sector in continual growth in all countries and, in particular, the increase in B2C (Business to Consumer) e-commerce market has important effects on last-mile deliveries in city areas. The delivery of a parcel to a consumer's address involves not only high costs for both couriers (extended car routes) and consumers (high prices) and also greater environmental pollution. The growing demand for deliveries in urban areas involves increases in traffic and congestion problems and, consequently, environmental issues. In recent years, many studies have focused on alternative measures to reduce the negative aspects and impact of last-mile deliveries. Good practice to rationalize last-mile delivery should involve the use of various systems, such as reception boxes, delivery boxes, controlled access systems, collection points and lockers. This paper compares two alternative options to home delivery. In particular, it makes comparisons between point-to-point and lockers, states the pro and cons of both, and defines the best positions to locate lockers to reduce consumers' deviations. The proposed method is applied to a real case: the Italian municipality of Dolo (near Venice).

ThŒis paper is focused on the comparison of results obtained by the resolution of the capacitated vehicle routing problem. A modi€ed algorithm of classical arti€cial bee colony (ABC) is described and implemented in this article, in particular, a new type of neighborhood operator is introduced. Œe idea on the base of ABC is creating an algorithm of Swarm - Intelligence which mimics the behavior of a honey bee swarm. Œe performance of the proposed metaheuristic is evaluated on two sets of standard benchmark instances and is compared with the well-known results obtained by savings algorithm of Clarke and Wright and with those calculated using ABC-enhanced by Szeto et al. Œe computational results show that the proposed ABC outperforms the Saving algorithm and that it can produce good solutions when compared with the ABC-enhanced.