The Pickup and Delivery Problem with Cross-Docking

Authors:
Fernando Afonso Santos;Geraldo Robson Mateus;Alexandre Salles Da Cunha
Affiliations:
Universidade Federal de Minas Gerais, Departamento de Ciência da Computação, Avenida Antônio Carlos, 6627 Belo Horizonte, Brazil;Universidade Federal de Minas Gerais, Departamento de Ciência da Computação, Avenida Antônio Carlos, 6627 Belo Horizonte, Brazil;Universidade Federal de Minas Gerais, Departamento de Ciência da Computação, Avenida Antônio Carlos, 6627 Belo Horizonte, Brazil
Venue:
Computers and Operations Research
Year:
2013

Citing 18
Cited 0

A tabu search heuristic for the vehicle routing problem

Management Science
Heuristic approaches to vehicle routing with backhauls and time windows

Computers and Operations Research
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
Vehicle routing scheduling for cross-docking in the supply chain

Computers and Industrial Engineering - Special issue: Logistics and supply chain management
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation

Operations Research
Selected Topics in Column Generation

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

Transportation Science
Formulations and exact algorithms for the vehicle routing problem with time windows

Computers and Operations Research
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

Mathematical Programming: Series A and B
Truck scheduling at zero-inventory cross docking terminals

Computers and Operations Research
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows

Transportation Science
Fifty Years of Vehicle Routing

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

Computers and Operations Research
A novel column generation algorithm for the vehicle routing problem with cross-docking

INOC'11 Proceedings of the 5th international conference on Network optimization
A column generation approach for the split delivery vehicle routing problem

Networks
An exact algorithm for IP column generation

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

Usual models that deal with the integration of vehicle routing and cross-docking operations impose that every vehicle must stop at the dock even if the vehicle collects and delivers the same set of goods. In order to allow vehicles to avoid the stop at the dock and thus, reduce transportation costs, we introduce the Pickup and Delivery Problem with Cross-Docking (PDPCD). An Integer Programming formulation and a Branch-and-price algorithm for the problem are discussed. Our computational results indicate that optimal or near optimal solutions for PDPCD indeed allow total costs to be significantly reduced. Due to improvements in the resolution of the pricing problems, the Branch-and-price algorithm for PDPCD works better than similar algorithms for other models in the literature.