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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Intelligence heuristics to solve a Balanced Routing Problem in Supply Chain

by N. Kannan, S. Jayanthi, R. Dhanalakshmi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 176 - Number 9
Year of Publication: 2017
Authors: N. Kannan, S. Jayanthi, R. Dhanalakshmi
10.5120/ijca2017915518

N. Kannan, S. Jayanthi, R. Dhanalakshmi . Intelligence heuristics to solve a Balanced Routing Problem in Supply Chain. International Journal of Computer Applications. 176, 9 ( Oct 2017), 13-25. DOI=10.5120/ijca2017915518

@article{ 10.5120/ijca2017915518,
author = { N. Kannan, S. Jayanthi, R. Dhanalakshmi },
title = { Intelligence heuristics to solve a Balanced Routing Problem in Supply Chain },
journal = { International Journal of Computer Applications },
issue_date = { Oct 2017 },
volume = { 176 },
number = { 9 },
month = { Oct },
year = { 2017 },
issn = { 0975-8887 },
pages = { 13-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume176/number9/28584-2017915518/ },
doi = { 10.5120/ijca2017915518 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:42:04.523538+05:30
%A N. Kannan
%A S. Jayanthi
%A R. Dhanalakshmi
%T Intelligence heuristics to solve a Balanced Routing Problem in Supply Chain
%J International Journal of Computer Applications
%@ 0975-8887
%V 176
%N 9
%P 13-25
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In today’s business system, supply chain competitiveness greatly depends on its capability to handle the challenges of cost reduction, service level improvement and quality enhancement. In this competitive market, customer service level is the most significant factor for the success of the firm. Supply chain network needs to be efficient enough to handle the changing demand patterns. Balanced routing of goods among supply chain entities will improve the asset utilization and customer service level in a supply chain system. Over or under utilization of the supply chain entity will impact the customer service. We develop a decision support system based on three-stage heuristics to solve this balanced routing problem. A case study is illustrated and the DSS is validated for this case study.

References
  1. Anderberg, M.R. (1973) ‘Cluster analysis for applications’, Academic press, New York.
  2. Bedeian, A.W. and Mossholder, K.W. (2000) ‘On the Use of the Coefficient of Variation as a Measure of Diversity’, Organizational Research Methods, Vol. 3, No. 3, pp. 285-297.
  3. Bektas, T. (2006) ‘The multiple traveling salesman problem: an overview of formulations and solution procedures’ Omega, In Press, Corrected Proof, Available online www.sciencedirect.com.
  4. Berenguer, X (1979) A characterization of linear admissible transformations for the m-travelling salesmen problem, European Journal of Operational Research. Volume 3, Issue 3, Pages 232–238.
  5. Bodin L, Golden B, Assad A, Ball M (1983). Routing and scheduling of vehicles and crews: The state of the art. Comput Oper Res 10: 63–211.
  6. Brumitt, B; Stentz, A; Hebert, M and The Cmu Ugv Group. (2001) Autonomous Driving with Concurrent Goals and Multiple Vehicles: Mission Planning and Architecture, Autonomous Robots 11, 103–115.
  7. Calvo, R.W. and Cordone, R. (2003) ‘A heuristic approach to the overnight security service problem’, Computers and Operations Research, Vol. 30, pp.1269–1287.
  8. Carter, A.E. and Ragsdale, C.T (2006). “A new approach to solving the multiple traveling salesperson problem using genetic algorithms”, European journal of operational research, Vol.175, no.1, pp. 246-257.
  9. Chandran, N., Narendran, T.T. and Ganesh, K. (2006) ‘A clustering approach to solve the multiple travelling salesmen problem’, Int. J. Industrial and Systems Engineering, Vol. 1, No. 3, pp.372–387.
  10. Chan, F.T.S. and Kumar, N. (2007), ‘Effective allocation of customers to distribution centres: A multiple ant colony optimization approach’, Robotics and Computer-Integrated Manufacturing, In Press, Corrected Proof, Available online 13 August 2007
  11. Christofides Nicos , A. Mingozzi and P. Toth (1981) State-space relaxation procedures for the computation of bounds to routing problems. DOI: 10.1002/net.3230110207 Volume 11, Issue 2, pages 145–164.
  12. Clarke G and Wright J (1964). Scheduling of vehicles from central depot to number of delivery points. Operations Research, 12(4):568–581.
  13. Conley. W (1990) Multi-stage Monte Carlo optimization applied to a large travelling salesman problem. International Journal of Systems Science DOI: 10.1080/00207729008910387 Volume 21, Issue 3.
  14. Cordeau, Jean-Francois Gendreau, M, and Laporte G (1997) A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems. Inc. Networks 30: 105 –119.
  15. Fisher.M. L. and R. Jaikumar.(1981) “A Generalized Assignment Heuristic for Vehicle Routing”. Networks, Vol.11, pp.109-124.
  16. Ganesh, K and Narendran, T.T. (2007) ‘CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up’, European Journal of Operational Research, Volume 178, Issue 3, Pages 699-717
  17. Gilbert and Hofstra,(1992) "A Multiperiod Multiple Traveling Salesman Problem with Heuristic and Application to a Scheduling Problem,"  Decision Sciences.
  18. Gillett, B., and Miller, L; (1974). “A Heuristic Algorithm for the Vehicle Dispatch Problem," Operations Research, Vol.22, pp.340-350.
  19. Golden, B.L; A.A. Assad, L. Levy, and F.G. Gheysens.(1984) The fleet size and mix vehicle routing problem. Computers & OR, 11(1):49–66.
  20. Gorenstein S (1970) Printing Press Scheduling for Multi-Edition Periodicals http://dx.doi.org/10.1287/mnsc.16.6.B373 Volume 16 Issue 6, pp. B-373-B-383.
  21. Kara, I. and Bektas, T.( 2006) “Integer Linear programming Formulations of Multiple Salesman problems and its variations”, European Journal of Operational Research, Vol. 174, No. 3, pp. 1449-1458.
  22. Kolen. A. W. J., Rinnooy Kan. A. H. G and Trienekens. H. W. J. M.(1987) Vehicle Routing with Time Windows  http://dx.doi.org/10.1287/opre.35.2.266 OR Volume 35 Issue 2, pp. 266-273.
  23. Laporte, G. and Osman, I.H. (1995) ‘Routing problems: a bibliography’, Annals of Operational Research, Vol. 61, pp. 227-262.
  24. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. (1985) ‘The traveling salesman problem: a guided tour of combinatorial optimization’, Chichester: Wiley.
  25. Ledesma. J.R and Juan-Jose´ Salazar-Gonza´lez (2012) Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach Computers & Operations Research 39 (2012) 391–404.
  26. Lenstra, J.K. and Rinnooy Kan, A.H.G. (1975) ‘Some simple applications of the traveling salesman problem’, Operational Research Quarterly, Vol. 26, pp. 717–733.
  27. Mandell Bellmore, Saman Hong (1974) Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem. Journal of the ACM (JACM), Volume 21 Issue 3, Pages 500-504.
  28. Mitrovic-Minic, S. and Krishnamurti, R ( 2006) “The multiple TSP with time windows: vehicle bounds based on precedence graphs”, Operations Research Letters, Vol. 34, No. 1, pp. 111-120 .
  29. Okonjo-Adigwe, C. (1988) ‘An effective method of balancing the workload amongst salesmen’, Omega, Vol. 16, No. 2, pp. 159-163
  30. Potvin Jean-Yves  and Rousseau Jean-Marc (1995) An Exchange Heuristic for Routing Problems with Time Windows. Journal of the Operational Research Society 46, 1433–1446. doi:10.1057/jors.1995.204.
  31. Parthiban P., P. Venkateswara Reddy, and S. Arunachalam (2011). A review of evolutionary algorithms for multi objective multi product multi modal distribution problem with a possible new approach. Int. J. Logistics economics and globalization vol.3. no.1.
  32. Radharamanan. R.,  Choi L.I. (1986) A branch and bound algorithm for the travelling salesman and the transportation routing problems. Computers & Industrial Engineering Volume 11, Issues 1–4, Pages 236–240.
  33. Saleh, H.A. & Chelouah, R. (2004). The design of the global navigation satellite system surveying networks using genetic algorithms. Engineering Applications of Artificial Intelligence, Vol. 17, pp. 111–22.
  34. Solomon, M. M (1987). Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. OR, http://dx.doi.org/10.1287/opre.35.2.254 pp. 254-265.
  35. Somhom,S, Modares, A Enkawa T (1999) Competition-based neural network for the multiple travelling salesmen problem with minmax objective. Computers & Operations Research 26 395-407.
  36. Svestka, J.A & Huckfeld, V.E (1973). Computational experience with an m-salesman travelling salesman algorithm . Management Science Vol.19, 790-799.
  37. Tang. L, Liu. j, Rong. A, and Yang. Z (2000) A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex. European Journal of Operational Research 124 , 267-282.
  38. Torki,A, Somhon.S and Enkawa, T (1997) A Competitive Neural Network Algorithm for Solving vehicle Routing Problem. Computers ind. Engng Vol. 33, Nos 3-4, pp. 473—476.
  39. Wang, X and A.C. Regan (2002), Local Truckload Pickup and Delivery with Hard Time Window Constraints, Transportation Research, Part B, Methodological, 36 (2), 97-112.
Index Terms

Computer Science
Information Sciences

Keywords

Balanced Routing Problem Supply Chain System Decision Support System

Powered by PhDFocusTM