CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Comparison between Two Algorithms for Multi-Depot Vehicle Routing Problem with Inventory Transfer between Depots in a Three-Echelon Supply Chain

by Farzaneh Amiri Fard, Mostafa Setak
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 28 - Number 6
Year of Publication: 2011
Authors: Farzaneh Amiri Fard, Mostafa Setak
10.5120/3388-4703

Farzaneh Amiri Fard, Mostafa Setak . Comparison between Two Algorithms for Multi-Depot Vehicle Routing Problem with Inventory Transfer between Depots in a Three-Echelon Supply Chain. International Journal of Computer Applications. 28, 6 ( August 2011), 39-45. DOI=10.5120/3388-4703

@article{ 10.5120/3388-4703,
author = { Farzaneh Amiri Fard, Mostafa Setak },
title = { Comparison between Two Algorithms for Multi-Depot Vehicle Routing Problem with Inventory Transfer between Depots in a Three-Echelon Supply Chain },
journal = { International Journal of Computer Applications },
issue_date = { August 2011 },
volume = { 28 },
number = { 6 },
month = { August },
year = { 2011 },
issn = { 0975-8887 },
pages = { 39-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume28/number6/3388-4703/ },
doi = { 10.5120/3388-4703 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:14:05.754771+05:30
%A Farzaneh Amiri Fard
%A Mostafa Setak
%T Comparison between Two Algorithms for Multi-Depot Vehicle Routing Problem with Inventory Transfer between Depots in a Three-Echelon Supply Chain
%J International Journal of Computer Applications
%@ 0975-8887
%V 28
%N 6
%P 39-45
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Coordination in supply chain plays an important role on the successful performance of all parts of supply chain. This paper studies an integrated distribution system in a three-echelon supply chain including a single plant, multiple distribution centers and a set of retailers with deterministic demands. Possibility of transferring goods between depots is taken into account. To solve the problem, first we formulate a mixed integer programming model to the overall system. Since solving mixed integer programming problems with optimization solvers is memory intensive and insufficient physical memory is one of the most common problems when running large size of these problems, we propose two approaches to solve the model and compare them. First approach is a constructive two-phase heuristic: The purpose of the first phase is to assign retailers to distribution centers and determine the source of inventory replenishment for each depot. After assigning retailers to the depots, sequence of routes for each depot is determined with a Simulated Annealing algorithm. Second approach is a Tabu search algorithm with different neighborhood structures that solve the model integrally, not in two phases. Computational results indicate the effectiveness of two proposed algorithms but when the integrated algorithm is used, better results achieved.

References
  1. Simchi-Levi, D., Kaminsky, P., and Simchi-Levi, E. 2003. Designing and managing the supply chain: concepts, strategies and case studies. Irwin, McGraw- Hill.
  2. G. Dantzig, R. Fulkerson, and S. Johnson, “Solution of a large-scale travelling salesman problem”, Operations Research, vol. 2, 1954, pp. 393–410.
  3. G. Clarke, and J. W. Wright, “Scheduling of vehicles from a depot to a number of delivery points”, Operations Research, vol. 12, 1964, pp. 568–581.
  4. B. L. Golden, A. Assad, and R. Dahl, “Analysis of a large scale vehicle routing problem with an inventory component”, Large Scale Systems, vol. 7, 1984, pp. 181-190.
  5. Campbell, A. M., Clarke, L., Kleywegt, A., and Savelsbergh, M. W. P. 1997. Inventory routing. Fleet management and logistics. Kluwer Academic Publishers.
  6. Z. Shen, and L. Qi, “Incorporating inventory and routing costs in strategic location models”, European Journal of Operational Research, vol. 172, 2007, pp. 372–389.
  7. Q. Zhao, S. Chen, and C. Zang, “Model and algorithm for inventory/routing decision in a three-echelon logistics system”, European Journal of Operational Research, vol. 191, 2008, pp. 623–635.
  8. R. G. Dondo, and J. Cerda, “A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows”, European Journal of Operational Research, vol. 176, 2007, pp. 1478–1507.
  9. B. Crevier, J. F. Cordeau, and G. Laporte, “The multi-depot vehicle routing problem with inter-depot routes”, European Journal of Operational Research, vol. 176, 2007, pp. 756–773.
  10. S. Shen, and M. Honda, “Incorporating lateral transfers of vehicles and inventory into an integrated replenishment and routing plan for a three-echelon supply chain”, Computers & Industrial Engineering, vol. 56, 2009, pp. 754–775.
  11. N. Metropolis, A.W. Rosenbluth, M. N. Rosenbluth, A. H. Teller and E. Teller, “Equation of state calculating by fast computing machines”, Journ. Of chem. Phys, vol. 21, 1953, pp. 1087-1091.
  12. S. Kirkpatrick, C.D. Gellat and M. P. Vecchi, “Optimization by simulated annealing”, Science, vol. 220, 1983, pp. 671-680.
  13. F. Glover, “Heuristic for integer programming using surrogate constraints”, Decision Sciences, vol.8, 1977, pp. 66-156.
Index Terms

Computer Science
Information Sciences

Keywords

Multi-depot vehicle routing problem inventory transfer mixed integer programming heuristic algorithm Simulated Annealing Tabu search

Powered by PhDFocusTM