A GRASP for a multi-depot multi-commodity pickup and delivery problem with time windows and heterogeneous fleet in the bottled beverage industry

6Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A pickup and delivery vehicle routing problem from a real-world bottled-beverage distribution company is addressed. The problem consists of deciding how to load every trailer, how to configure the vehicles in terms of the trailers, and how to route the vehicles, so as to minimize routing and fixed costs. The problem includes several features such as time windows on both customers and vehicles, multiple depots, multiple product delivery, split delivery, heterogeneous fleet, and dock capacity, to name a few. To solve this problem a GRASP-based heuristic is proposed. Problem decomposition, vehicle composition and route construction mechanisms, and local search procedures for different types of neighborhoods are developed. The heuristic is empirically assessed over a wide set of instances. Empirical results show that the proposed method obtains solutions of better quality than those reported by the company. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Ríos-Mercado, R. Z., López-Pérez, J. F., & Castrillón-Escobar, A. (2013). A GRASP for a multi-depot multi-commodity pickup and delivery problem with time windows and heterogeneous fleet in the bottled beverage industry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8197 LNCS, pp. 143–157). Springer Verlag. https://doi.org/10.1007/978-3-642-41019-2_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free