Detail An optimized restriction driven TSP model for delivery business in cloud environment   Oleh:  Mizuno, Shinya ; Iwamoto, Shogo ; Yamaki, Naokazu ; Zhu, Yishui Jenis: Article from Proceeding Dalam koleksi: The 14th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS), 3-6 December 2013 Cebu, Philippines, page 1-7. Topik: restriction driven; Traveling Salesman Problem; optimization Fulltext: 1163.pdf (1.0MB) Isi artikel There are many restrictions considered in delivery business such as time cost, labor cost, quality cost. But no one effective criterion for the cost restrictions existed. In this research we focused on a solution for the traveling salesman problems. We proposed an optimized restriction driven TSP model by using digital geographical distributions (e.g. Google Map) in cloud computing environment. This enhanced m-TSP model has two excellent points than others. First, it can provide a visible result to user because of using many opened APIs of digital geographical distributions. Second, a scalable computation environment can be prepared by using cloud computing technology. It can calculate the delivery round route by multiple labor cost in one delivery job. We implemented a demo system that submitted the calculation method of the model by taking the time restriction for m-TSP. We also introduced the box lunch delivery profit problem as a numerical instance. Opini Anda Klik untuk menuliskan opini Anda tentang koleksi ini! Kembali

Copyright © 2006, 2007 Unika Atma Jaya, all rights reserved