In order to meet the demand of passengers for travelling and make their travelling more convenient, the railway operator must ascertain the operational train number, section, classes, stop stations and appropriate dep...
详细信息
ISBN:
(纸本)9780791849071
In order to meet the demand of passengers for travelling and make their travelling more convenient, the railway operator must ascertain the operational train number, section, classes, stop stations and appropriate departure and arrival stations for passenger trains. The nodes of railway passenger transport are the generation and attraction points of passenger flow in the railway transport network. Starting from the analysis of the economic and social attributes as well as railway resource allocation of the Passenger Dedicated Railway Line (PDRL) covered nodes, this paper introduces the concept of the importance of nodes. On the basis of analytical hierarchy process (AHP), the paper studies the quantitative index of the nodes transport distribution capacity in the PDRL network and calculates the evaluation indexes of importance of those city nodes. Thus, in the light of the assessment results, the paper sets up the three-level hierarchy in the importance of city nodes covered by the PDRL. Based on that, the paper proposes that the first-level nodes serve as the departure and arrival stations, the second-level nodes adopt the fluid and alternate stop stations, and the tertiary-level nodes take the form of "all-stop" for low-class trains so as to build a multi-objective programming model for the PDRL train line planning. With the lingo 8.0 program, the train line planning optimizes the calculation of stop stations. This method has been applied in the PDRL train line planning of Wuhan-GuangZhou High-Speed Railway Line and proved to be effective in reducing the complexity of the train line planning problem according to different modes of passenger flow.
At present, supply chain management has become not only a hot academic research, but also an important respect of the enterprise strategic management. A multiproduct, multistage integrated supply chain management mode...
详细信息
At present, supply chain management has become not only a hot academic research, but also an important respect of the enterprise strategic management. A multiproduct, multistage integrated supply chain management model was established by multipleobjectiveprogramming, which could describe the capability and profit of supply chain members and the coordination operation of supply chain. Then an example was given for testing the effectiveness and feasibility of the model, and the simulation result was compared with that of decentralization supply chain management model. The example shows that multiple objectiveprogramming can solve the problem of integrated supply chain management.
This study proposes a reformed data envelopment analysts (DEA) approach for group evaluation In the setting where multiple reviewers ale involved and who mea sure all factors independently, how to synthesize the resul...
详细信息
This study proposes a reformed data envelopment analysts (DEA) approach for group evaluation In the setting where multiple reviewers ale involved and who mea sure all factors independently, how to synthesize the results is a critical issue This work develops the enhanced DEA model with multiple objectiveprogramming (MOP) formulation for integrating the outcomes Based on general DEA methods, the first objective function is to maximize the average efficiency from all reviewers Because the mean efficiency tends to converge on the favorable score, we define a balancing objective to min maze the total deviation from the consensus The case study of anti phishing efficiency shows the proposed model's feasibility in obtaining consensus from group evaluation
From the view of operation researches, the operation problem for a class of closed-loop supply chain system with one manufacturer and one supplier is considered. Demands of ultimate products and collecting quantity of...
详细信息
ISBN:
(纸本)9781424451821
From the view of operation researches, the operation problem for a class of closed-loop supply chain system with one manufacturer and one supplier is considered. Demands of ultimate products and collecting quantity of used products are described by using prices and reference prices, a non-linear dynamic pricing model for new/used products in the processing of this system operation is established. The model is constructed as a dynamic programming problem and satisfying several conflict objectives, such as the operating coordination of system, making the maximum profit of all participants as much as possible. The model's validity to dynamic pricing for closed-loop supply chain system is verified by a numerical example. The results of the numerical example shows that, in the long run, through the regulations of price itself and price reference effect, the price of ultimate product and the collecting price of used product fix to a certain value without reference to the initial price of ultimate product and the collecting price of used product.
Due to the economic spillover effect in Higher Education, thus higher education can not be fully market-oriented. There is market failure in the economy of higher education from the perspective of whether demand or su...
详细信息
Due to the economic spillover effect in Higher Education, thus higher education can not be fully market-oriented. There is market failure in the economy of higher education from the perspective of whether demand or supply, it is impossible to achieve the situation of Pareto optimal allocation for the higher education resources rely solely on fund allocation. In view of this, this paper present a multi- objectiveprogramming model for balanced allocation of resources in china regional higher education, and we used the Pareto genetic algorithm to get the solution of the model. The method does not need artificial weighting factors, it is a natural evolutionary calculation method. We explored the Pareto Equilibrium configuration for regional higher education resources. We analyzed the sensitivity of the model by using the cost-benefit approach. The results show that this paper's approach is a generally applicable and easy way for the achievement of the regional higher education resources in a balanced situation.
Several classifications of the multiple objectives programming (MOP) models have been proposed in the literature. In general, these classifications are based on the timing of introducing the decision-maker's (DM) ...
详细信息
Several classifications of the multiple objectives programming (MOP) models have been proposed in the literature. In general, these classifications are based on the timing of introducing the decision-maker's (DM) preferences and the type of the required information about the parameters of the decision-making situation. The DM's preference information can take different forms such as: weights, priority levels, thresholds or trade-offs among the objectives. The Goal programming (GP) is one of the well-known MOP models. The different GP formulations deal differently with the DM's preferences. The aim of this paper is to propose a new typology of the GP variants based on the way that the DM's preferences are considered. Copyright (C) 2010 John Wiley & Sons, Ltd.
This paper deals with the bi-objectivemulti-dimensional knapsack problem. We propose the adaptation of the core concept that is effectively used in single-objectivemulti-dimensional knapsack problems. The main idea ...
详细信息
This paper deals with the bi-objectivemulti-dimensional knapsack problem. We propose the adaptation of the core concept that is effectively used in single-objectivemulti-dimensional knapsack problems. The main idea of the core concept is based on the "divide and conquer" principle. Namely, instead of solving one problem with n variables we solve several sub-problems with a fraction of n variables (core variables). The quality of the obtained solution can be adjusted according to the size of the core and there is always a trade off between the solution time and the quality of solution. In the specific study we de. ne the core problem for the multi-objectivemulti-dimensional knapsack problem. After de. ning the core we solve the bi-objective integer programming that comprises only the core variables using the multicriteria Branch and Bound algorithm that can generate the complete Pareto set in small and medium size multi-objective integer programming problems. A small example is used to illustrate the method while computational and economy issues are also discussed. Computational experiments are also presented using available or appropriately modified benchmarks in order to examine the quality of Pareto set approximation with respect to the solution time. Extensions to the general multi-objective case as well as to the computation of the exact solution are also mentioned. (C) 2009 Elsevier Inc. All rights reserved.
Recent literature on sustainable logistics networks points to two important questions: (i) How to spot the preferred solution(s) balancing environmental and business concerns? (ii) How to improve the understanding of ...
详细信息
Recent literature on sustainable logistics networks points to two important questions: (i) How to spot the preferred solution(s) balancing environmental and business concerns? (ii) How to improve the understanding of the trade-offs between these two dimensions? We posit that a visual exploration of the efficient frontier and trade-offs between profitability and environmental impacts are particularly suitable to answer these two questions. The visual representation of the efficient frontier, however, presents two challenges. The first is to obtain a good approximation for such frontier without enumerating all extreme efficient solutions. The second is to obtain a good visual representation of the efficient frontier. We propose a two-phased heuristic to handle these two problems. The algorithm is designed for the multi-objective linear problem with three objectives: minimize costs, cumulative energy demand and waste in a reverse logistics network. We illustrate our approach by designing a complex recycling logistics network in Germany. (C) 2007 Elsevier B.V. All rights reserved.
Previous methods for enterprise software selection generally take into account the attributes that are restricted to some financial factors, such as costs and benefits. However, the literature lacks studies on conside...
详细信息
Previous methods for enterprise software selection generally take into account the attributes that are restricted to some financial factors, such as costs and benefits. However, the literature lacks studies on considering the evaluation of both functional and non-functional suitability of software alternatives versus various requirements. This study presents a new decision support system for combining these two kinds of evaluation to select suitable enterprise software. A hierarchical objective structure that contains both qualitative and quantitative objectives is proposed to evaluate software products systematically. This approach uses a heuristic algorithm, a fuzzy multi-criteria decision making procedure and a multi-objective programming model to make final selection decision. All the phases of presented method are applied in an electronic company's ERP software selection project to validate it with a real application. The satisfactory results are obtained during this project. The company can select the right software to fit its business processes instead of adapting its business processes to fit the software. (C) 2008 Elsevier Ltd. All rights reserved.
multi-criteria routing and scheduling in a multimodal fixed scheduled network with time-dependent travel times involves the determination of the non-dominated itineraries (i.e., paths enhanced with scheduled departure...
详细信息
multi-criteria routing and scheduling in a multimodal fixed scheduled network with time-dependent travel times involves the determination of the non-dominated itineraries (i.e., paths enhanced with scheduled departures) under the following constraints: (i) visiting a given set of intermediate stops in a specified sequence, and (ii) strict time windows on the origin, the destination and the intermediate stops. The objective of this paper is to present the formulation and algorithmic solution for the multi-criteria itinerary planning problem that takes into account the aforementioned features. The algorithmic approach proposed is based on the decomposition of the problem to a sequence of elementary itinerary sub-problems, solved by a dynamic programming algorithm. The computational performance of the algorithms on a set of large scale test problems indicates non-prohibitive time requirements and encourages its integration into travel planning decision support systems. (C) 2007 Elsevier B.V. All rights reserved.
暂无评论