Vehicle routing with cross-docking in the supply chain

Authors:
Ching-Jong Liao;Yaoming Lin;Stephen C. Shih
Affiliations:
Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan;Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan;School of Information Systems and Applied Technologies, Southern Illinois University, Carbondale, IL 62901, USA
Venue:
Expert Systems with Applications: An International Journal
Year:
2010

Citing 5
Cited 4

Vehicle routing with pick-up and delivery: tour-partitioning heuristics

Computers and Industrial Engineering
A tabu search algorithm for the vehicle routing problem

Computers and Operations Research
The vehicle routing problem with pickups and deliveries on some special graphs

Discrete Applied Mathematics
Designing And Managing The Supply Chain

Designing And Managing The Supply Chain
Vehicle routing scheduling for cross-docking in the supply chain

Computers and Industrial Engineering - Special issue: Logistics and supply chain management

Meta-heuristics implementation for scheduling of trucks in a cross-docking system with temporary storage

Expert Systems with Applications: An International Journal
Multi-objective genetic-based algorithms for a cross-docking scheduling problem

Applied Soft Computing
Applying an adaptive tabu search algorithm to optimize truck-dock assignment in the crossdock management system

Expert Systems with Applications: An International Journal
Survey of Green Vehicle Routing Problem: Past and future trends

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

Abstract

Cross-docking is considered as an efficient method to control the inventory flow, which is essential in supply chain management. In this paper, we consider a model that integrates cross-docking into the vehicle routing problem. In the model, a set of identical vehicles are used to transport goods from supplies to retailers through a cross-dock and the whole process must be completed in the planning horizon. Each supplier and retailer can be visited only once and the total quantity of goods in a vehicle must be less than its capacity. The objective of the problem is to determine the number of vehicles and a set of vehicle schedules with a minimum sum of operational cost and transportation cost. A new tabu search (TS) algorithm is proposed to obtain a good feasible solution for the problem. Through extensive computational experiments, it is shown that the proposed TS algorithm can achieve better performance than an existing TS algorithm while using much less computation time. The average improvements are as high as 10-36% for different size of problems.