An Adaptive Neighborhood Simulated Annealing Heuristic for the Vehicle

Routing Problem with Cross-Docking

Vincent F. Yu †
Department of Industrial Management
National Taiwan University of Science and Technology, Taipei, Taiwan
Email: vincent@mail.ntust.edu.tw

Parida Jewpanya
Department of Industrial Engineering,
Rajamangala University of Technology Lanna, Tak, Thailand

Department of Industrial Management,

National Taiwan University of Science and Technology, Taipei, Taiwan
Email : parida.jewpanya@gmail.com

A. A. N. Perwira Redi
Department of Industrial Management
National Taiwan University of Science and Technology, Taipei, Taiwan
Email : wira.redi@gmail.com

Abstract. This paper presents the Adaptive Neighborhood Simulated Annealing (ANSA) heuristic for solving the
vehicle routing problem with cross-docking (VRPCD), which is an extension of the vehicle routing problem
(VRP). In VRPCD the objective is to minimize the total cost (vehicle hiring cost and transportation cost) for a set
of vehicles to accomplish the pickup and delivery tasks considering consolidation process in the cross-dock. The
proposed ANSA utilizes an adaptive mechanism to determine the probability of neighborhood selection at each
iteration. The ANSA is tested on the existing VRPCD benchmark instances. The results show that ANSA produces
competitive VRPCD solutions under a reasonable computational time.

Keywords: Vehicle Routing Problem, Cross-Docking, Adaptive Neighborhood, Simulated Annealing