Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service

In recent years the urbanization to affect many countries of the world has made the significant changes to the material flow at all levels of the supply chain. The last mile logistics operating in the urban area has also changed notably. An increase in the volume of material flow within cities has led to a growth in the number of deliveries and the freight turnover, accordingly. The above-stated processes greatly reduce the sustainability of cities, which while keeping the urbanization trend, can lead to the serious negative results of the social and environmental nature not only for the cities, but also for the countries. One way to solve this problem is to create the green supply chains from the multi-echeloning principles. In the paper, the authors have presented a two-echelon green supply chain using the zero transport emissions within the second echelon. A multi-criteria function has been developed to assess the rational location of a transfer point in order to reduce the negative environmental impact from the transportation system. With the PTV Visum software product, a simulation has been conducted to evaluate the alternative scenarios for generating a green supply chain.

show abstract

“…М. Soysal et al [17] in routing problems. These papers consider either emissions or fuel consumption [19][20][21][22].…”

Section: Literature Reviewmentioning

confidence: 99%

A Two-Echelon Green Supply Chain for Urban Delivery

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Cattaruzza et al [18] provide a complete review of routing problems arising in city logistics, identifying four main challenges that capture the complexity of the urban environment: the consideration of time-dependent travel times [19,20], multilevel distribution [21,22], dynamic routing [23,24], and multitrip routing [25]. Other recent VRP applications for urban freight include the formulation of an inverse vehicle routing approach to estimate urban delivery vehicle flows [26], or the consideration of travel times as random variables, thus formulating the routing approach in order to maximize the probability of serving customers within their assigned time windows [27].…”

Section: Routing For Urban Freight: Access Time Windowsmentioning

confidence: 99%

Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows

et al. 2018

View full text Add to dashboard Cite

The application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access Time Windows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction. We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.

show abstract

“…Recently, two matheuristics were proposed in the literature. [Wang et al, 2017] employed a mixed-integer mathematical model for the 2E-CVRP, in which arc variables are used for the first level, and path variables for the second level. They used variable neighborhood search to construct the set of secondlevel routes, and they then solved the mathematical model to improve the obtained solution.…”

Section: Introductionmentioning

confidence: 99%

An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem

Marquès

Sadykov

Deschamps

et al. 2020

Computers & Operations Research

View full text Add to dashboard Cite

In the paper, we propose a branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem in which delivery of products from a depot to customers is performed using intermediate depots called satellites. Our algorithm incorporates significant improvements recently proposed in the literature for the standard capacitated vehicle routing problem such as bucket graph based labeling algorithm for the pricing problem, automatic stabilization, limited memory rank-1 cuts, and strong branching. In addition, we make some specific problem contributions. First, we introduce a new route based formulation for the problem which does not use variables to determine product flows in satellites. Second, we introduce a new branching strategy which significantly decreases the size of the branch-and-bound tree. Third, we introduce a new family of satellite supply inequalities, and we empirically show that it improves the quality of the dual bound at the root node of the branch-and-bound tree. Finally, extensive numerical experiments reveal that our algorithm can solve to optimality all literature instances with up to 200 customers and 10 satellites for the first time and thus double the size of instances which could be solved to optimality.

show abstract

Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service

Cited by 78 publications

References 27 publications

A Two-Echelon Green Supply Chain for Urban Delivery

A Two-Echelon Green Supply Chain for Urban Delivery

Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows

An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem

Contact Info

Product

Resources

About