We consider the problem of utilizing the parcel locker network for the logistics solution in the metropolitan area. Two-echelon distribution systems are attractive from an economic standpoint, whereas the product from the depot can be distributed from or to intermediate facilities. In this case, the intermediate facilities are considered as locker facilities present in an accessible location in the vicinity of the final customers. In addition, the utilization of locker facilities can reduce the cost caused by the unattended deliveries. The problem is addressed as an optimization model that formulated into an integer linear programming model denoted as the two-echelon vehicle routing problem with locker facilities (2EVRP-LF). The objective is to minimize the cost of transportation with regards to the vehicle travelling cost, the intermediate facilities renting cost, and the additional cost to compensate the customer that needs to travel to access the intermediate facilities. Because of its complexity, a simulated annealing algorithm is proposed to solve the problem. On the other hand, the modelling approach can be conducted by generating two-phase optimization model approaches, which are the p-median problem and the capacitated vehicle routing problem. The results from both methods are compared in numerical experiments. The results show the effectiveness of 2EVRP-LF compared to the two-phase optimization. Furthermore, the simulated annealing algorithm showed an effective performance in solving 2EVRP-LF.

The decision to dispatch consumers demand has become a strategic and tactical consideration to be solved in an integrated manner. In this study, the problem of determining routing problem take case study of delivery of perishable product. The routes determination should take into account the unique characteristics of perishable products possess. Perishable products continuously decreases quality over their lifetime. The challenge for distributors is how to minimize the cost of delivering perishable products by taking into account the temperature so that it can serve a number of customers within the specified time frame. The problem of determining the route on delivery is included in the combinatorial optimization problem, thus causing this problem to be complex to be solved by the exact method. On the other hand, metaheuristic methods are increasingly being developed to be applied in the completion of combinatorial optimizations. This research started from mathematical model of perishable product delivery which pay attention to perishability (quality, temperature, quality loss) and time windows. Based on this model, this research develops the route settlement algorithm of delivery of perishable product using metaheuristic, particle swarm optimization. The algorithm development is required because route determination included in discrete issues. In addition, the development of algorithms to improve performance by combining (hybrid) algorithms, nearest neighbor and particle swarm optimization. Experiments were performed on 2 sets of Solomon data. From the experimental results with the metaheuristic hybrid algorithm is able to provide better performance than pure metaheuristik. Although the solution gap produced by these two algorithms is not very significant, but when viewed from the computation time and the number of iterations required to find the best solution, this metaheuristic hybrid algorithm can save an average time of 17 times from pure metaheuristic algorithm. AbstrakKeputusan pengiriman permintaan sekumpulan konsumen telah menjadi pertimbangan strategis maupun taktis untuk diselesaikan secara terintegrasi. Pada penelitian ini, permasalahan penentuan rute kendaraan (routing problem) mengambil studi kasus pengiriman produk perishable. Penentuan rute tersebut harus memerhatikan karakteristik unik yan dimiliki produk perishable. Produk perishable (tidak tahan lama) memiliki karakteristik mudah rusak dan secara kontinu mengalami penurunan kualitas selama umur hidupnya. Tantangan bagi distributor adalah bagaimana meminimumkan biaya pengiriman produk perishable dengan memperhatikan temperatur sehingga mampu melayani sejumlah pelanggan dalam rentang waktu yang telah ditentukan. Permasalahan penentuan rute pada pengiriman termasuk kedalam permasalahan optimasi kombinatorial, sehingga menyebabkan permasalahan ini menjadi kompleks untuk diselesaikan dengan metode eksak. Di sisi lain, metode metaheuristik semakin berkembang untuk diaplikasikan dalam penyelesaian optimasi kombinatorial. Penelitian ini berawal dari mo...

Abstract. Halal

Aviation industry often faced uncertainty demand and high level of cancellation. Revenue management in the airline is related to demand management policies to classify and estimate the various requests of pricing and capacity control. This study will develop airline revenue management model integrates luggage passengers with air cargo based on the control of air cargo space. The airline must pay attention to customer behavior due to high cancellation and no-show. In this case we deal with the aspect of the overbooking in which one of the ways to reduce the cost of spoilage due to cancellation or no show. Moreover, in this proposed model, we discuss the expected revenue function to maximize the expected revenue from the policies of accept or reject the booking requests between passengers and air cargo by the same airline. This study aims to develop expected revenue in the dynamic programming model in order to maximize the revenue expectations of the policy of accepting and rejecting booking request between passengers with air cargo in the same airline.

Transportasi saat ini merupakan bagian yang sangat fundamental dalam kehidupan untuk melakukan perpindahan. Salah satu moda transportasi yang sering digunakan adalah pesawat terbang yang memiliki keuntungan secara ekonomis dibandingkan jenis transportasi lain. Teknologi pada pesawat terbang memungkinkan terjadinya peningkatan demand dari tahun ke tahun. Padatnya demand dari penumpang di Bandara Internasional Juanda Surabaya membuat antrian pesawat pada runway, salah satunya runway 10. Runway tersebut adalah ujung dari landasan pacu yang digunakan untuk take off dan landing. Runway capacity dari bandara Internasional Juanda Surabaya mempunyai kapasitas yang terbatas. Mengkaji perubahan jadwal pesawat dengan menggunakan simulasi di Bandara diharapkan dapat mengoptimalkan antrian pesawat pada single runway Bandara Internasional Juanda Surabaya. Selain itu, penelitian ini dapat meminimasi waktu tunggu pesawat di runway sebelum keberangkatan dan sebelum landing di udara. Metode yang digunakan Time Space Diagram. Untuk menguji metode tersebut dikembangkan program berbasis Microsoft Excel. Dengan melakukan penelitian menggunakan program dan metode tersebut diharapkan mendapatkan hasil yang optimal dan harapannya menjadi masukan terhadap pihak Air Navigation, sehingga lebih memudahkan pihak perusahaan untuk mengambil keputusan.