Show simple item record

dc.contributor.authorHardi, Richki
dc.date.accessioned2014-12-02T05:59:43Z
dc.date.available2014-12-02T05:59:43Z
dc.date.issued2014-12-04
dc.identifier.citation[1] Boykov, O. Veksler, and R. Zabih, “Markov Random Fields with Efficient Approximations,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 648-655, 1998. [2] Y. Boykov, O. Veksler, and R. Zabih, “Fast Approximate Energy Minimization via Graph Cuts,” Proc. IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, Nov. 2001. [3] H. Ishikawa and D. Geiger, "Segmentation by Grouping Junction," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 125- 131, 1998. [4] C.-H. Lee, D. Lee, and M. Kim, “Optimal Task Assignment in Linear Array Networks,” IEEE Trans. Computers, vol. 41, no. 7, pp. 877-880, July 1992 [5] D. Snow, P. Viola, and R. Zabih, “Exact Voxel Occupancy with Graph Cuts,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 345-352, 2000. [6] H.S. Stone, “Multiprocessor Scheduling with the Aid of NetworkFlow Algorithms,” IEEE Trans. Software Eng., pp. 85-93, 1977. [7] A. Amini, T. Weymouth, and R. Jain, “Using Dynamic Programming for Solving Variational Problem is Vision”, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 9, pp. 855-867, Sept. 1990. [8] S.B. Akers, ‘‘Binary Decision Diagrams’’, IEEE Transactions on Computers, Vol. C-27, No. 6, June 1978,pp. 509-516 [9] R. Brayton, et al, ‘‘Fast Recursive Boolean Function Manipulation’’, International Symposium on Circuits and Systems, IEEE, Rome, Italy, May 1982, pp. 58-62. [10] C.E. Shannon, ‘‘A Symbolic Analysis of Relay and Switching Circuits’’, Transactions of the AIEE, Vol. 57, 1938, pp. 713-723. [11] C.S. Wallace, ‘‘A Suggestion for a Fast Multiplier’’, IEEE Transactions on Electronic Computing, Vol. EC-13, No. 1, January 1964, pp. 14-17 [12] R.P. Brent, and H.T. Kung, ‘‘The Area-Time Complexity of Binary Multiplication’’, Journal of the ACM, Vol. 28, No. 3, July 1981, pp. 521-534. [13] M.R. Garey and D.S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979. [14] H. Abelson, and P. Andreae, ‘‘Information Transfer and Area-Time Trade-Offs for VLSI Multiplication’’, Communications of the ACM, Vol. 23, No. 1, January 1980, pp. 20-23. [15] Richki, H, “Implementasi Algoritma Tsp Dalam Penyelesaian Tracking Paket Pada Unit Processing Center Pos Indonesia Kota Lhokseumawe Aceh” Jurnal Telematika, Vol. 11, No. 1, Juli 2014,Program Studi Teknik Informatika Universitas Pembangunan Nasional "Veteran" Yogyakarta, ISSN: 1829-667X Ien_US
dc.identifier.issn2407-4330
dc.identifier.urihttp://hdl.handle.net/11617/4944
dc.description.abstractoptimization problem to find the shortest way for shipping companies wishing to deliver goods to a number of cities and return to the original departure city is highly expected to be applied, because in addition to saving energy can also save on the budget. in that case it takes the appropriate algorithms and methods to solve them. several methods have been used to resolve the issue but so far have not found a reliable algorithm to solve it. there are some easy steps that can be applied to the problem is to try all possible routes are available or looking for the best route, and it is the duty of the algorithm traveling sales person problems. in the digital era nowadays, it is necessary that the algorithm can solve the problem quickly in order to obtain a solution that approaches the optimal solution. Traveling salesperson problem algorithm can be used for solving complex and difficult optimization solved by conventional methods.en_US
dc.publisherUniversitas Muhammadiyah Surakartaen_US
dc.subjectAlgorithmsen_US
dc.subjectExpeditionen_US
dc.subjectComputingen_US
dc.subjectOptimizationen_US
dc.subjectTravelling salesperson problemen_US
dc.titleAnalysis and Implementation of graph algorithms method of traveling salesperson problem in Determining the expedition route of delivery packageen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record