مقاله انگلیسی رایگان در مورد یک الگوریتم شاخه و برش برای پیکاپ جداگانه – الزویر 2019

We study the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities (MT-PDTWCF), arising in two-tiered city logistics systems. The first tier refers to the transportation between the city distribution centers, in the outskirts of the city, and intermediate facilities, while the second tier refers to the transportation of goods between the intermediate facilities and the (pickup and delivery) customers. We focus on the second tier, and consider that customers and facilities have time windows in which they can be visited. Waiting is possible at waiting stations for free or at customers and facilities at a given cost or penalty. Therefore, it is relevant to coordinate the arrivals of vehicles at facilities and customers with the corresponding time windows. The MT-PDTWCF calls for determining minimum (fixed, routing and waiting) cost multi-trip routes, for a given fleet of vehicles, to service separately pickup and delivery customers, while taking into account vehicle capacity and time windows both at customers and facilities. We propose the first exact algorithm for MT-PDTWCF, namely a Branch-and-Cut-and-Price algorithm. It is based on column generation, where the pricing problem is solved by a bi-directional dynamic programming algorithm designed to cope with the features of the problem. Subset-row and rounded capacity inequalities are adapted to deal with MT-PDTWCF and inserted in the Branch-and-Cut-and-Price algorithm. The performance of the proposed algorithm is tested on benchmark instances with up to 200 customers, showing its effectiveness.

Introduction

We address the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities (MT-PDTWCF), which arises in the context of two-tiered City Logistics systems (Cattaruzza, Absi, Feillet, & González-Feliu, 2017; Crainic, Errico, Rei, & Ricciardi, 2012; Crainic, Ricciardi, & Storchi, 2009). In these systems, the first tier refers to the consolidation and transportation of loads between the city distribution centers (CDCs), in the outskirts of the city, and intermediate facilities without storage or waiting areas, called satellites, located inside the city (or close to it), by using large-capacity vehicles. The second tier considers the delivery/pickup of goods between the satellites and the customers, by using smaller-capacity vehicles that can travel inside the city. The usefulness of two-tier City Logistics systems stands in reducing the nuisances caused by freight transportation in urban areas (Crainic et al., 2009): larger trucks transport freight to satellites using corridors surrounding the city, while only small vehicles enter the city center, and the coordination of the two tiers at satellites allows the reduction of traffic congestion. In this paper, we focus on the second tier problem and consider that both customers and facilities have time windows, so that it is essential to coordinate the arrivals of vehicles at facilities and customers with the corresponding time windows. This class of problems has recently received significant attention (see, e.g., Crainic, Gajpal, & Gendreau, 2015b; Crainic, Nguyen, & Toulouse, 2016; Grangier, Gendreau, Lehuédé, & Rousseau, 2016; Guastaroba, Speranza, & Vigo, 2016; Nguyen, Crainic, & Toulouse, 2013; Nguyen, Crainic, & Toulouse, 2017), as environmental issues and traffic congestion have become more critical in every day life (Guastaroba et al., 2016).