Goal programming

About: Goal programming is a research topic. Over the lifetime, 4330 publications have been published within this topic receiving 117758 citations.

Multi-objective optimization of the ecm process

Abstract: Optimization of process parameters is helpful in efficient working of the process and, hence, in lowering the cost of machining. Optimization of ECM process parameters has been achieved by considering only one objective at a time from metal removal rate, geometrical accuracy, and total process cost. From a practical point of view, a solution of the ecm problem satisfying all three objectives simultaneously is highly desirable. In the proposed model, a multi-objective problem involving the ecm process is formulated producing highly nonlinearized equations. These are then linearized by regression analysis and converted into a goal programming format. Finally, the problem is solved by the partitioning algorithm. It is concluded that the tool, or cathode, remains safe at the optimal values of design variables obtained in the examples discussed. The optimal value of voltage when metal removal rate is the only objective, is found to be higher than the case when the geometrical accuracy requirement is also to be satisfied.

Single-objective linear goal programming problem with neutrosophic numbers

Abstract: This paper deals with single-objective linear goal programming problem with neutrosophic numbers. The coefficients of objective function and the constraints are considered as neutrosophic numbers of the form (p +qI), where p, q are real numbers and I denotes indeterminacy. In the solution process, the neutrosophic numbers are transformed into interval numbers.

Hybrid Multiobjective Optimization Model for Regional Pavement-Preservation Resource Allocation

Abstract: Because of a lack of reliable performance prediction models, many state departments of transportation (DOTs) use a needs-based budgeting process, namely, annual budget requests. Allocations of funding across maintenance activities and districts are developed on the basis of pavement maintenance needs derived from pavement inventory and annual or biannual condition data. This allocation of funding across maintenance activities and districts is challenging and often involves negotiation and balancing. A decision support model is proposed for the optimization of short-term pavement preservation budgeting based on two proven operations research techniques: goal programming for handling multiple objectives and an analytic hierarchy process for priority setting under multiple criteria. The model simultaneously considers two incommensurable and conflicting objectives: maximization of the preservation effectiveness in terms of extended service life and minimization of the total preservation cost. Application of the model is demonstrated with a short-term pavement preservation budgeting problem for a decentralized state DOT with nine maintenance districts. The illustrative example reveals that the proposed model is practical for supporting needs-based budgeting.