scholarly journals Application of Optimization Principle in Landmark University Project Selection under Multi-Period Capital Rationing Using Linear and Integer Programming

2019 ◽  
Vol 08 (03) ◽  
pp. 73-82
Author(s):  
Nathaniel Kayode Oladejo
Author(s):  
Zhaohua Wang ◽  
Yichang (James) Tsai ◽  
Menghua Ding

Crack sealing (CS) and crack filling (CF) are commonly used crack treatment methods. However, the study of their performance is still very limited, making it difficult for highway agencies to systematically and optimally select network-level CS-CF projects within available budgets. To address this issue, a generalized performance model for CS-CF–treated pavements is proposed. Detailed crack characteristics—including crack type, density, and width—are employed in the model. In the proposed performance model, crack density related to three types of cracks (transverse cracks, nonwheelpath longitudinal cracks, and wheelpath longitudinal cracks) is used to determine performance gain. Two discount functions are incorporated to consider the negative impact caused by alligator cracks and cracks that are very tight or very wide. The proposed model is instantiated and estimated using the practices of the Georgia Department of Transportation on CS and CF and the department’s pavement distress survey protocol. The case study—which uses three-dimensional laser data collected from a 1-mi pavement section on State Route 26 (US-80) near Savannah, Georgia, from 2011 to 2016—validates the feasibility and reasonableness of the model. An integer programming method is formulated for network-level CS-CF project selection. The testing results of 53 pavement segments show that the model and programming method can be used to select CS-CF projects within budget constraints while maximizing the length-weighted average performance gain. The proposed performance model and integer programming method show promise for use in incorporating CS and CF into a highway agency’s pavement management system. Conclusions and recommendations are offered.


2021 ◽  
Vol 11 (3) ◽  
pp. 70-75
Author(s):  
Kizito Paul Mubiru ◽  
Christopher Senfuka ◽  
Maureen Ssempijja

Joint activities for global water partnerships in regional development programs are usually facilitated by implementing transboundary water projects. Most projects are however hampered by the absence of a clear economic base for making investment decisions. In this paper, we propose a zero-one integer programming model to determine the optimal decisions for selection of project portfolios on transboundary waters; where project selection is based on several time periods in the future.The objective is to determine whether to undertake a project or not; so that the net present value of investment returns is maximized to support needy communities. A numerical example is presented for illustration; demonstrating the optimal choice of investment projects under budget constraints. The zero-one integer programming model provides a feasible solution for choice of transboundary project investment decisions; given the competing nature of capital budgets prior project implementation. The proposed model can be efficient; where limited funds among competing projects serve as a basis for project selection criteria; a decision for facilitation enhancement towards water partnership for regional development.


Author(s):  
Fransiskus Lauson Matondang ◽  
Rosnani Ginting

PT XYZ sering mengalami keterlambatan waktu karena dalam setiap keterlambatan yang dilakukan selalu ada penalty yang diberikan kepada perusahaan dan hal ini mengakibatkan tambahan biaya , oleh karena itu hal ini harus dihindari dengan membuat penjadwalan yang efisien, dalam hal ini dilakukanlah perbaikan dengan meminimisasi waktu penyelesaian maksimum Cmax pada mesin paralel yang berpola aliran flowshop (dan tidak boleh dilakukan interupsi yang dilakukan pada pekerjaan yang sedang diproses, untuk melakukan pekerjaan lainnya, satu lintasan hanya memproduksi satu produk dan hanya satu produk juga yang dikerjakan secara langsung. Waktu penyelesaian yang berbeda dari setiap mesin dengan pengerjaannya juga adalah masalah yang dihadapi untuk menjadikan mesin mesin ini sesuai menjadi satu penjadwalan yang terintegrasi dengan metode integer programming yang membuat penjadwalan dengan konsep riset operasi dengan metode pendekatan 0-1 utuk menjadi lebih efisien lagi , dihasilkan minimisasi keterlambatan total penyelesaian order dengan 42,28 menit lebih baik dari sebelumnya.   PT XYZ often experiences time delays because in every delay made there is always a penalty given to the company and this results in additional costs, therefore this must be avoided by making efficient scheduling, in this case repairs are carried out by minimizing the maximum completion time of Cmax on parallel machines that are patterned with flowshop flow (and no interruptions should be carried out on the work being processed, to do other work, one track only produces one product and only one product is directly worked. Different completion times of each machine with the workmanship is also the problem faced to make this machine suitable to be one scheduling integrated with integer programming methods that makes scheduling with the operational research concept with the 0-1 approach method to be more efficient, resulting in minimization of the delay in the total settlement of orders with 42.28 minutes was better than before.


Sign in / Sign up

Export Citation Format

Share Document