4,121 research outputs found

    A matheuristic approach for the Pollution-Routing Problem

    Full text link
    This paper deals with the Pollution-Routing Problem (PRP), a Vehicle Routing Problem (VRP) with environmental considerations, recently introduced in the literature by [Bektas and Laporte (2011), Transport. Res. B-Meth. 45 (8), 1232-1250]. The objective is to minimize operational and environmental costs while respecting capacity constraints and service time windows. Costs are based on driver wages and fuel consumption, which depends on many factors, such as travel distance and vehicle load. The vehicle speeds are considered as decision variables. They complement routing decisions, impacting the total cost, the travel time between locations, and thus the set of feasible routes. We propose a method which combines a local search-based metaheuristic with an integer programming approach over a set covering formulation and a recursive speed-optimization algorithm. This hybridization enables to integrate more tightly route and speed decisions. Moreover, two other "green" VRP variants, the Fuel Consumption VRP (FCVRP) and the Energy Minimizing VRP (EMVRP), are addressed. The proposed method compares very favorably with previous algorithms from the literature and many new improved solutions are reported.Comment: Working Paper -- UFPB, 26 page

    On green routing and scheduling problem

    Full text link
    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools

    Optimizing Urban Distribution Routes for Perishable Foods Considering Carbon Emission Reduction

    Get PDF
    The increasing demand for urban distribution increases the number of transportation vehicles which intensifies the congestion of urban traffic and leads to a lot of carbon emissions. This paper focuses on carbon emission reduction in urban distribution, taking perishable foods as the object. It carries out optimization analysis of urban distribution routes to explore the impact of low carbon policy on urban distribution routes planning. On the base of analysis of the cost components and corresponding constraints of urban distribution, two optimization models of urban distribution route with and without carbon emissions cost are constructed, and fuel quantity related to cost and carbon emissions in the model is calculated based on traffic speed, vehicle fuel quantity and passable time period of distribution. Then an improved algorithm which combines genetic algorithm and tabu search algorithm is designed to solve models. Moreover, an analysis of the influence of carbon tax price is also carried out. It is concluded that in the process of urban distribution based on the actual network information, the path optimization considering the low carbon factor can effectively reduce the distribution process of CO2, and reduce the total cost of the enterprise and society, thus achieving greater social benefits at a lower cost. In addition, the government can encourage low-carbon distribution by rationally adjusting the price of carbon tax to achieve a higher social benefit

    Multi-objective Vehicle Routing Problem with Cost and Emission Functions

    Get PDF
    AbstractAmong the logistics activities, transportation, is presented as a major source of air pollution in Europe, generating harmful levels of air pollutants and is responsible for up to 24% of greenhouse gases (GHGs) emissions in the European Union. The growing environmental concern related to the economic activity has been transferred to the field of transport and logistics in recent decades. Therefore, environmental targets are to be added to economic targets in the decision-making, to find the right balance between these two dimensions. In real life, there are many situations and problems that are recognized as multi-objective problems. This type of problems containing multiple criteria to be met or must be taken into account. Often these criteria are in conflict with each other and there is no single solution that simultaneously satisfies everyone. Vehicle routing problems (VRP) are frequently used to model real cases, which are often established with the sole objective of minimizing the internal costs. However, in real life other factors could be taken into account, such as environmental issues. Moreover, in industry, a fleet of vehicles is rarely homogeneous. The need to be present in different segments of the market, forcing many companies to have vehicles that suit the type of goods transported. Similarly, to have vehicles of different load capacities enables a better adaptation to the customer demand. This paper proposes a multi-objective model based on Tchebycheff methods for VRP with a heterogeneous fleet, in which vehicles are characterized by different capacities, costs and emissions factors. Three objective functions are used to minimize the total internal costs, while minimizing the CO2 emissions and the emission of air pollutants such as NOx. Moreover, this study develops an algorithm based on C&W savings heuristic to solve the model when time windows are not considered. Finally, a real case application is analyzed to confirm the practicality of the model and the algorithm

    Sustainable maritime crude oil transportation: a split pickup and split delivery problem with time windows

    Get PDF
    This paper studies a novel sustainable vessel routing problem modeling considering the multi-compartment, split pickup and split delivery, and time windows concepts. In the presented problem, oil tankers transport crude oil from supply ports to demand ports around the globe. The objective is to find ship routes, as well as port arrival and departure times, in a way that minimizes transportation costs. As a second objective, we considered the sustainability aspect by minimizing the vessel energy efficiency operational indicator. Multiple products are transported by a heterogeneous fleet of tankers. Small realistic test instances are solved with the exact method

    A Two-Stage Approach for Routing Multiple Unmanned Aerial Vehicles with Stochastic Fuel Consumption

    Full text link
    The past decade has seen a substantial increase in the use of small unmanned aerial vehicles (UAVs) in both civil and military applications. This article addresses an important aspect of refueling in the context of routing multiple small UAVs to complete a surveillance or data collection mission. Specifically, this article formulates a multiple-UAV routing problem with the refueling constraint of minimizing the overall fuel consumption for all of the vehicles as a two-stage stochastic optimization problem with uncertainty associated with the fuel consumption of each vehicle. The two-stage model allows for the application of sample average approximation (SAA). Although the SAA solution asymptotically converges to the optimal solution for the two-stage model, the SAA run time can be prohibitive for medium- and large-scale test instances. Hence, we develop a tabu-search-based heuristic that exploits the model structure while considering the uncertainty in fuel consumption. Extensive computational experiments corroborate the benefits of the two-stage model compared to a deterministic model and the effectiveness of the heuristic for obtaining high-quality solutions.Comment: 18 page
    • …
    corecore