Hasil Pencarian  ::  Simpan CSV :: Kembali

Abstrak :
ABSTRAK
Number Portability merupakan salah satu langkah yang harus dicapai menuju tercapainya tujuan utama deregulasi dan lingkungan kompetisi layanan telekomunikasi. Kemampuan pelanggan untuk tetap menggunakan nomor telepon mereka walaupun sebenamya mereka telah pindah dari pcnyelenggara telekomunikasi yang satu menuju penyelenggara yang lain, mutlak diperlukan dalam lingkungan kompetisi yang sesungguhnya. Dengan Number Portability, pelanggan dapat dengan leluasa memilih dan menentukan sendiri penyelenggara telekomunikasi yang diinginkan berdasarkan tarif, service dan service feature yang diberikan, tanpa harus menanggung resiko perubahan nomor telepon. Salah satu jenis portability adalah Service Provider Portability dimana pelanggan dapat menentukan sendiri penyelenggara telekomunikasi yang diinginkan.

Skripsi ini akan membahas mengenai implementasi Local Sevice Provider Portability dimana daerah atau wilayah yang dapat dilayani Number Portabilrty adalah suatu daerah tertentu dalam sua.u kode area tertentu. Metode yang akan digunakan dalam implementasi adalah Location Routing Number yang merupakan metode berdasarkan Intelligent Network. Dalam skripsi ini .iuga akan dianalisa mengenai proses atau tahapan dan skenario implementasi Local Service Provider Portability, dampak implemetantasi terhadap jaringan penyelenggara dan perencanaan sistem penomoran. Selain itu akan dianalisa juga mengenai masalah interkoneksi jaringan dan kesiapan infrastruktur jaringan penyelenggara.

---

Abstrak :
ABSTRACT
Zone pricing is one of the most important pricing policies that are prevalently used by very companies. This paper considers integrating zone pricing and location-routing problems for profit maximization. Hence, a node-based model is proposed as mixed integer nonlinear programming to solve the problem. In order to handle the nonlinearity elements and change the model to a mixed integer linear programming, a piecewise linearization method is employed to approximate the problem. Moreover, we introduce a new heuristic variable neighborhood search (VNS) and tabu search algorithm for large-scale problems. The proposed algorithms consist of four intra-tour and seven inter-tour operators in its local search. Finally, some test instances with 20, 200, 400, and 600 nodes are solved and the results of them confirm the efficiency of the proposed algorithms and comparative superiority of the VNS algorithm over the tabu search algorithm.

Abstrak :
ABSTRACT
In this paper, we introduce a new variant of Location Routing Problem with the name of Location Routing Problem with Arc Time Windows (LRP ATW), which emerges from the need of safe transportation in terror zones. In this specific problem, there are arc time windows on the arcs (roads) for transferring the vehicles like trucks and articulated lorries which means that these roads can be used for a specific period of time during a day. Within the scope of this paper, the problem and assumptions are described, and a Mixed Integer Programming (MIP) formulation is developed to solve the problem. Bounds are also improved using valid inequalities. The quality of the formulation is measured using the test problems in the literature. Computational results show that the proposed MIP formulation gives good quality results in a short computation time.