Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up

OR SpectrumPublished 1 February 2001

Jan Dethloff

DOI10.1007/pl00013346

Source URL

Citations405

SJR quartileQ1

SJR score0.89

SNIP1.32

TL;DR

The proposed algorithm is successfully applied to a real-life problem as well as test instances introduced in the literature earlier and randomly generated instances are tackled in order to try to determine favorable settings for the parameters used in the solution approach.

Abstract

Recently, the increasing focus on environmental protection has led to significant changes in logistics processes. In addition to the distribution process to the customers, re-usable packaging and goods to be recycled or remanufactured have to be transported in the reverse direction. If both tasks have to be performed simultaneously at the customers' locations which are serviced by a fleet of vehicles stationed in a depot or distribution/redistribution center, the vehicle routing problem with simultaneous delivery and pick-up arises. In this paper, the relation between this problem and other vehicle routing problems is investigated. A heuristic construction procedure is suggested. The proposed algorithm is successfully applied to a real-life problem as well as test instances introduced in the literature earlier. In addition, randomly generated instances are tackled in order to try to determine favorable settings for the parameters used in the solution approach.

Keywords

EngineeringBusiness, Management and Accounting

European Journal of Operational ResearchQuantitative models for reverse logistics: A review

1,865 Citations1997Moritz Fleischmann, Jacqueline M. Bloemhof‐Ruwaard +4 more

This article subdivides the recently emerged field of reverse logistics into three main areas, namely distribution planning, inventory control, and production planning, and discusses the implications of the emerging reuse efforts.

View PDF

European Journal of Operational ResearchThe pickup and delivery problem with time windows

641 Citations1991Yvan Dumas, Jacques Desrosiers +1 more

This paper presents an exact algorithm which solves the pickup and delivery problem when transporting goods using a column generation scheme with a constrained shortest path as a subproblem.

European Journal of Operational ResearchThe vehicle routing problem with backhauls

258 Citations1989Marc Goetschalckx, Charlotte Jacobs‐Blecha

An extensive computational analysis of several initial solution algorithms is presented, which identifies the tradeoffs between solution quality and computational requirements and concludes that the greedy procedure reduces the required number of trucks and increases the truck utilization.

European Journal of Operational ResearchThe Travelling Salesman Problem with pick-up and delivery

159 Citations1994Gur Mosheiov

This work develops a simple heuristic consisting of pick-up and delivery along the travelling salesman tour along the Cheapest Insertion heuristic and introduces an alternative solution method which is an extension of the well known Cheapest insertion heuristic.

Naval Research Logistics (NRL)The vehicle-routing problem with delivery and back-haul options

61 Citations1996Shoshana Anily

A lower bound on the optimal total cost and a heuristic solution for the vehicle-routing problem are developed, which is shown to converge to the optimal solution, under mildprobabilistic conditions, as fast as N-0.5.

Management Science and Financial EngineeringA HEURISTIC ALGORITHM FOR VEHICLE ROUTING PROBLEM WITH BACKHAULS

2 Citations1997Nae-Heon Kim, Suk-Chul Rim +1 more

Computational results using random problems indicate that the proposed heuristic outperforms existing methods for practical range of the number of nodes in reasonable computation time.