Paper Title:
A Stochastic Savings Algorithm for Vehicle Routing Problem with a Centralized Distribution Center and Delivery Time Window
  Abstract

The vehicle routing problem (VRP) under study involves managing a fleet of trucks existing to provide transportation services from a centralized distribution center (DC) to a set of geographically dispersed customers. The problem is motivated by a real problem from one of the large chains of high-end retail stores in Thailand. The objective of this study is to develop a simple and effective algorithm that can help the user manage the fleet in order to reduce the total transportation cost. The developed algorithm is based on the parallel savings algorithm but with a stochastic component that has a capability of escaping the local optima. The stochastic component applied a biased random sampling (BRS) and regret based random sampling (RBRS) to the selection of customers to add to delivery routes. Specifically, the selection probabilities are computed proportionally from the savings value of merging customers. The algorithm generates solutions containing delivery routes and schedules for all trucks in the fleet that satisfy daily store demands under limited truck capacity and delivery time window restrictions. Three measures of performance include the total distance, total travel time, and total cost. Computational test of the algorithm was performed on a set of standard problems, and promising results are obtained.

  Info
Periodical
Chapter
Chapter 20: Manufacturing Process Planning and Scheduling
Edited by
Wu Fan
Pages
3972-3981
DOI
10.4028/www.scientific.net/AMM.110-116.3972
Citation
M. Sanjaiya, J. Buddhakulsomsiri, P. Parthanadee, "A Stochastic Savings Algorithm for Vehicle Routing Problem with a Centralized Distribution Center and Delivery Time Window", Applied Mechanics and Materials, Vols. 110-116, pp. 3972-3981, 2012
Online since
October 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Chun Yu Ren
Abstract:The paper is focused on the Min-Max Vehicle Routing Problem (MMVRP). Tabu search algorithm is an algorithm based on neighborhood search....
160
Authors: Si Lian Xie, Tie Bin Wu, Shui Ping Wu, Yun Lian Liu
Chapter 18: Computer Applications in Industry and Engineering
Abstract:Evolutionary algorithms are amongst the best known methods of solving difficult constrained optimization problems, for which traditional...
2846
Authors: Zi Xu, Jing Yu
Chapter 6: Computational Simulation, Monitoring and Analysis in Manufacture
Abstract:This paper proposes the combined direction stochastic approximation method for solving simulation-based optimization problems. The new...
688
Authors: Hai Yan Wang
Chapter 6: Production Management
Abstract:This paper presents a hybrid algorithm to address the flexible job-shop scheduling problem (FJSP). Based on Differential Evolution (DE), a...
502
Authors: Sun Xin Wang, Yan Li, Yan Rong Zhang
Chapter 15: Economics, Marketing and Engineering Management
Abstract:In this paper a hybrid algorithm named IPSO-VND is proposed and applied to solving the vehicle routing problem with simultaneous pickup and...
2326