共查询到20条相似文献,搜索用时 15 毫秒
1.
Location selection is a crucial decision in cost/benefit analysis of restaurants, coffee shops and others. However, it is difficult to be solved because there are many conflicting multiple goals in the problem of location selection. In order to solve the problem, this study integrates analytic hierarchy process (AHP) and multi-choice goal programming (MCGP) as a decision aid to obtain an appropriate house from many alternative locations that better suit the preferences of renters under their needs. This study obtains weights from AHP and implements it upon each goal using MCGP for the location selection problem. According to the function of multi-aspiration provided by MCGP, decision makers can set multi-aspiration for each location goal to rank the candidate locations. Compared to the unaided selection processes, the integrated approach of AHP and MCGP is a better scientific and efficient method than traditional methods in finding a suitable location for buying or renting a house for business, especially under multiple qualitative and quantitative criteria within a shorter evaluation time. In addition, a real case is provided to demonstrate the usefulness of the proposed method. The results show that the proposed method is able to provide better quality decision than normal manual methods. 相似文献
2.
This paper presents a coal blending management system incorporating a goal programming (GP) model. The main aim of this paper is to develop a goal programming (GP) model with an objective to provide a decision support system for coal stockyard managers. This model determines appropriate quantities of coal from different stockpiles for a consistent feeding of blended coal while meeting environmental and boiler performance requirements. Finally, the model is implemented as an operational decision making support system so that a novice operator will have no difficulty is using it. A real-world case is presented to illustrate the application of the model. 相似文献
4.
In this paper, we introduce the cross-border logistics problem with fleet management. A major phenomenon of implementation of open-door policy in China is the move of Hong Kong-based manufacturers’ production lines to China, crossing the border to take advantages of lower production costs, lower wages and lower rental costs. The finished products are then transshipped to Hong Kong, an efficient logistics hub well-equipped with reliable transportation facility, for exporting. We present a preemptive goal programming model for multi-objective cross-border logistics problem, in which three objectives are optimized hierarchically. We also describe a framework for incorporating decision-makers’ opinions for determination of goal priorities and target values. A set of Hong Kong data have been used to test the effectiveness and efficiency of the proposed model. Results demonstrate the decision-makers can find the flexibility and robustness of the proposed model by adjusting the goal priorities with respect to the importance of each objective. 相似文献
5.
Millions of affected people and thousands of victims are consequences of earthquakes, every year. Therefore, it is necessary to prepare a proper preparedness and response planning. The objectives of this paper are i) minimizing the expected value of the total costs of relief supply chain, ii) minimizing the maximum number of unsatisfied demands for relief staff and iii) minimizing the total probability of unsuccessful evacuation in routes. In this paper, a scenario based stochastic multi-objective location-allocation-routing model is proposed for a real humanitarian relief logistics problem which focused on both pre- and post-disaster situations in presence of uncertainty. To cope with demand uncertainty, a simulation approach is used. The proposed model integrates these two phases simultaneously. Then, both strategic and operational decisions (pre-disaster and post-disaster), fairness in the evacuation, and relief item distribution including commodities and relief workers, victim evacuation including injured people, corpses and homeless people are also considered simultaneously in this paper. The presented model is solved utilizing the Epsilon-constraint method for small- and medium-scale problems and using three metaheuristic algorithms for the large-scale problem (case study). Empirical results illustrate that the model can be used to locate the shelters and relief distribution centers, determine appropriate routes and allocate resources in uncertain and real-life disaster situations. 相似文献
6.
In recent years, determining the best supplier has become a key strategic consideration in the competitive market. Since the decision commonly involves evaluating different criteria or attributes, supplier selection process is a multiple criteria decision-making (MCDM) problem. This study integrates the Taguchi loss function, analytical hierarchy process (AHP) and multi-choice goal programming (MCGP) model for solving the supplier selection problem. The advantage of this proposed method is that it allows decision makers to set multiple aspiration levels for the decision criteria. A numerical example of application is also presented. 相似文献
7.
In this paper we describe a branch and bound algorithm for solving the unconstrained quadratic 0–1 programming problem. The salient features of it are the use of quadratic programming heuristics in the transformation of subproblems and exploiting some classes of facets of the polytope related to the quadratic problem in deriving upper bounds on the objective function. We develop facet selection procedures that form a basis of the bound computation algorithm. We present computational experience on four series of randomly generated problems and 14 real instances of a quadratic problem arising in design automation. We remark that the same ideas can also be applied to some other combinatorial optimization problems. 相似文献
9.
A minimax solution to a stochastic program occurs when the objective function is maximized subject to the random parameters jointly taking on their most adverse or pessimistic values. Minimax solutions have been proposed for decision making in agricultural planning, and to provide a lower bound to the values of the objective function of the “wait and see” stochastic program. In this paper a non-convex minimax problem and the occurrence of local optima are discussed. A global algorithm is presented for the minimax problem of a stochastic program in which some of the right hand side parameters are stochastic. It is also shown how minimax solutions may be obtained where stochastic parameters occur solely in the objective function, and in the objective function and right hand sides simultaneously. 相似文献
12.
This paper proposes a two-stage stochastic programming model for the parallel machine scheduling problem where the objective is to determine the machines' capacities that maximize the expected net profit of on-time jobs when the due dates are uncertain. The stochastic model decomposes the problem into two stages: The first (FS) determines the optimal capacities of the machines whereas the second (SS) computes an estimate of the expected profit of the on-time jobs for given machines' capacities. For a given sample of due dates, SS reduces to the deterministic parallel weighted number of on-time jobs problem which can be solved using the efficient branch and bound of M’Hallah and Bulfin [16]. FS is tackled using a sample average approximation (SAA) sampling approach which iteratively solves the problem for a number of random samples of due dates. SAA converges to the optimum in the expected sense as the sample size increases. In this implementation, SAA applies a ranking and selection procedure to obtain a good estimate of the expected profit with a reduced number of random samples. Extensive computational experiments show the efficacy of the stochastic model. 相似文献
13.
The reorganization of the electricity industry in Spain completed a new step with the start-up of the Derivatives Market. One main characteristic of MIBEL's Derivatives Market is the existence of physical futures contracts; they imply the obligation to physically settle the energy. The market regulation establishes the mechanism for including those physical futures in the day-ahead bidding of the generation companies. The goal of this work is to optimize coordination between physical futures contracts and the day-ahead bidding which follow this regulation. We propose a stochastic quadratic mixed-integer programming model which maximizes the expected profits, taking into account futures contracts settlement. The model gives the simultaneous optimization for the Day-Ahead Market bidding strategy and power planning production (unit commitment) for the thermal units of a price-taker generation company. The uncertainty of the Day-Ahead Market price is included in the stochastic model through a set of scenarios. Implementation details and some first computational experiences for small real cases are presented. 相似文献
14.
The decomposition approach has received increasing attention in recent years not only as ft computational technique for large-scale management models but also as a systematic tool for designing organizational structure and information systems in decentralized organizations. In this paper, a revised iterative algorithm is developed for multicriteria decomposition in an organization by utilizing goal programming. The algorithm not only has the capability of dealing with multicriteria decomposition problems but is also useful for evaluating organizational effectiveness of a decentralized organization. A simple example is presented for an illustrative purpose of the algorithm application. 相似文献
15.
This paper examines the problem of clustering highway sections for purposes of forming preventive maintenance contracts. In order to achieve the desired low unit costs which contractors can provide, a sufficient number of sections must be grouped together. The preventive maintenance clustering problem is formulated as a fixed charge goal programming model. An algorithm for solving this model is presented. 相似文献
16.
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained optimization problems. The constraints express physical feasibility and the requirements to be satisfied; the objectives are market-driven performances of the aircraft. These optimizations are currently manually conducted as many input data frequently evolve during the study. This work introduced mathematical methods that are useful in a sizing tool to ease, fasten and enhance the aircraft configuration optimization problem. Using genetic algorithms, large amounts of design points satisfying the requirements were rapidly produced, despite some issues inherent to the aircraft model: numerical noise or physically meaningless design points due to the vast design space. Then, multicriteria optimization methods were introduced, as several criteria were considered concurrently. As calculation times became important, the aircraft model was substituted by a surrogate model. Radial basis functions approximated the constraint and the objective functions. Finally, a possible outcome of the integration of these different techniques was proposed in order to yield the engineers a global and operational perception of the design space. 相似文献
17.
In this study we address scheduling the assignments of the residents and the senior academic staff to outpatient clinics (OCs) in a physical medicine and rehabilitation (PMR) department. The current schedules are prepared manually. The department is not satisfied with the schedules because of frequent changes and incapabilities in handling the preferences of the residents. We propose a hierarchical goal programming (HGP) model to address these issues. Our proposed model reduces the frequent changes within monthly schedules, allow the residents to work with different specialists until their graduation, satisfies the preferences of the residents and conforms with the requirements of the department. Problems of realistic size can be solved to optimality in a reasonable amount of time. 相似文献
19.
Options are designed to hedge against risks to their underlying assets such as stocks. One method of forming option-hedging portfolios is using stochastic programming models. Stochastic programming models depend heavily on scenario generation, a challenging task. Another method is neutralizing the Greek risks derived from the Black–Scholes formula for pricing options. The formula expresses the option price as a function of the stock price, strike price, volatility, risk-free interest rate, and time to maturity. Greek risks are the derivatives of the option price with respect to these variables. Hedging Greek risks requires no human intervention for generating scenarios. Linear programming models have been proposed for constructing option portfolios with neutralized risks and maximized investment profit. However, problems with these models exist. First, feasible solutions that can perfectly neutralize the Greek risks might not exist. Second, models that involve multiple assets and their derivatives were incorrectly formulated. Finally, these models lack practicability because they consider no minimum transaction lots. Considering minimum transaction lots can exacerbate the infeasibility problem. These problems must be resolved before option hedging models can be applied further. This study presents a revised linear programming model for option portfolios with multiple underlying assets, and extends the model by incorporating it with a fuzzy goal programming method for considering minimum transaction lots. Numerical examples show that current models failed to obtain feasible solutions when minimum transaction lots were considered. By contrast, while the proposed model solved the problems efficiently. 相似文献
20.
Two-sided assembly lines are especially used at the assembly of large-sized products, such as trucks and buses. In this type of a production line, both sides of the line are used in parallel. In practice, it may be necessary to optimize more than one conflicting objectives simultaneously to obtain effective and realistic solutions. This paper presents a mathematical model, a pre-emptive goal programming model for precise goals and a fuzzy goal programming model for imprecise goals for two-sided assembly line balancing. The mathematical model minimizes the number of mated-stations as the primary objective and it minimizes the number of stations as a secondary objective for a given cycle time. The zoning constraints are also considered in this model, and a set of test problems taken from literature is solved. The proposed goal programming models are the first multiple-criteria decision-making approaches for two-sided assembly line balancing problem with multiple objectives. The number of mated-stations, cycle time and the number of tasks assigned per station are considered as goals. An example problem is solved and a computational study is conducted to illustrate the flexibility and the efficiency of the proposed goal programming models. Based on the decision maker's preferences, the proposed models are capable of improving the value of goals. 相似文献
|