Henry Yuliando
Department of Agroindustrial Technology, Gadjah Mada University, Indonesia
Endy Suwondo
Department of Agroindustrial Technology, Gadjah Mada University, Indonesia
Adi Djoko Guritno
Department of Agroindustrial Technology, Gadjah Mada University, Indonesia
Arianti
Department of Agroindustrial Technology, Gadjah Mada University, Indonesia
ABSTRACT
A process of distribution should be managed attentively in order to achieve a high growth and profitable output. It is necessary for the company to design a route arranging and scheduling to meet the companys revenue target. In this study, canvassing strategy was followed for determining best route in term of combining length of distance as well as revenue gains for PT Andrawina Company, Yogyakarta, Indonesia. It was based on the application of Tabu Search (TS) to define the best routes for the company. The method used here covered the features of initial solution by Greedy approach, nodes interchange as the selection of move, candidate lists strategy, and aspiration criteria. According to the result of TS, the available routes could be modified into five (5) daily and a buffer day for the after admission of the distribution. In addition, the best routes generated by TS did outweigh both over the nearest customers and profitable revenue (potential retailers).
PDF References
How to cite this article
Henry Yuliando, Endy Suwondo, Adi Djoko Guritno and Arianti, 2013. Tabu Search to Define Best Routes in Canvassing Distribution System: A Case
Study. Journal of Applied Sciences, 13: 5638-5648.
DOI: 10.3923/jas.2013.5638.5648
URL: https://scialert.net/abstract/?doi=jas.2013.5638.5648
DOI: 10.3923/jas.2013.5638.5648
URL: https://scialert.net/abstract/?doi=jas.2013.5638.5648
REFERENCES
- Archetti, C., M.G. Speranza and A. Hertz, 2006. A tabu search algorithm for the split delivery vehicle routing problem. Trans. Sci., 40: 64-73.
CrossRefDirect Link - Baldacci, R., E. Hadjiconstantinou and A. Mingozzi, 2004. An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res., 52: 723-738.
CrossRefDirect Link - Brandao, J., 2006. A new tabu search algorithm for the vehicle routing problem with backhauls. Eur. J. Oper. Res., 173: 540-555.
CrossRef - Cesaret, B., C. Oguz and F.S. Salman, 2010. A tabu search algorithm for order acceptance and scheduling. Comp. Oper. Res., 39: 1197-1205.
CrossRef - Cordeau, J.F. and G. Laporte, 2001. A tabu search algorithm for the site dependent vehicle routing problem with time windows. NFOR, 39: 292-298.
Direct Link - Cordeau, J.F., M. Gendreau, G. Laporte, J.Y. Potvin and F. Semet, 2002. A guide to vehicle routing heuristics. J. Oper. Res. Soc., 53: 512-522.
Direct Link - El Fallahi, A., C. Prins and R.W. Calvo, 2008. A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput. Oper. Res., 35: 1725-1741.
CrossRef - Gendreau, M., A. Hertz and G. Laporte, 1994. A tabu search heuristic for the vehicle routing problem. Manage. Sci., 40: 1276-1290.
CrossRef - Gendreau, M., F. Guertin, J.Y. Potvin and E. Taillard, 1999. Parallel tabu search for real-time vehicle routing and dispatching. Trans. Sci., 33: 381-390.
CrossRef - Montane, F.A.T. and R.D. Galvao, 2006. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. J. Comput. Operat. Res., 33: 595-619.
CrossRefDirect Link - Moncrief, W.C. and G.W. Marshall, 2005. The evolution of the seven steps of selling. Ind. Market. Manage., 34: 13-22.
CrossRef - Rochat, Y. and E.D. Taillard, 1995. Probabilistic diversification and intensification in local search for vehicle routing. J. Heurist., 1: 147-167.
CrossRefDirect Link - Taillard, E.D., 1990. Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Operat. Res., 47: 65-74.
CrossRefDirect Link - Taillard, E.D., 1991. Robust taboo search for the quadratic assignment problem. Parallel Comput., 17: 443-455.
CrossRef - Taillard, E.D., G. Laporte and M. Gendreau, 1996. Vehicle routing with multiple use of vehicles. J. Oper. Res. Soc., 47: 1065-1070.
Direct Link