An ILS based heuristic for the vehicle routing problem with simultaneous pickup and delivery and time limit

Authors:
Anand Subramanian;Lucídio Dos Anjos Formiga Cabral
Affiliations:
Universidade Federal da Paraíba, Departamento de Engenharia de Produção, Centro de Tecnologia, João Pessoa, PB, Brazil;Universidade Federal da Paraíba, Departamento de Estatística, Centro de Ciências Exatas e da Natureza, João Pessoa, PB, Brazil
Venue:
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Year:
2008

Citing 3
Cited 1

Variable neighborhood search

Computers and Operations Research
A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

Computers and Operations Research
A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection

Transportation Science

A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper deals with the Vehicle Routing Problem with Simultaneous Pick-up and Delivery and Time Limit (VRPSPDTL). Due to the combinatorial nature of the problem, heuristics methods are commonly used to generate good quality solutions within an acceptable computational time. Accordingly, an Iterated Local Search (ILS) procedure that uses a Variable Neighborhood Descent (VND) method to perform the local search is proposed. The algorithm was applied to test problems and, in most cases, was found to produce better results than those reported in the literature.