A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. (October 2015)

• Record Type: Journal Article
• Authors: Cherkesly, Marilène; Desaulniers, Guy; Laporte, Gilbert
• Is Part Of: Computers & operations research. Volume 62(2015)
• Page Start: 23
• Page End: 35
• Publication Date: 2015-10
• Subjects: Vehicle routing with pickup and delivery -- Last-in-first-out loading -- Genetic algorithm -- GRASP -- Adaptive large neighborhood search; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2015.04.002
• Languages: English
• ISSNs: 0305-0548

Abstract

Abstract: In this paper, we solve the pickup and delivery problem with time windows and last-in-first-out (LIFO) loading. LIFO loading minimizes handling while unloading items from the vehicle: the items are loaded according to a linear stack structure, and an item can only be delivered if it is the one on top of the stack. Three exact branch-price-and-cut algorithms are available for this problem. These can solve instances with up to 75 requests within one hour. We propose a population-based metaheuristic capable of handling larger instances much faster. First, a set of initial solutions is generated with a greedy randomized adaptive search procedure. For each of these solutions, local search is applied in order to first decrease the total number of vehicles and then the total traveled distance. Two different strategies are used to create offspring. The first selects vehicle routes from the solution pool. The second selects two parents to create an offspring with a crossover operator. For both strategies, local search is then performed on the child solution. Finally, the offspring is added to the population and the best survivors are kept. The population is managed so as to maintain good quality solutions with respect to total cost and population diversity. Computational results on medium to large instances confirm the effectiveness of the proposed metaheuristic.