检索结果-内蒙古大学图书馆

Vehicle routing problem with fuzzy time windows

FUZZY SETS AND SYSTEMS 2009年第5期160卷 683-695页

作者： Tang, Jiafu Pan, Zhendong Fung, Richard Y. K. Lau, Henry Northeastern Univ Dept Syst Engn Key Lab Integrated Automat Proc Ind MOE Shenyang 110004 Peoples R China City Univ Hong Kong Dept Mfg Engn & Engn Management Kowloon Hong Kong Peoples R China Hong Kong Polytech Univ Dept Ind & Syst Engn Kowloon Hong Kong Peoples R China

In this paper, a vehicle routing problem with fuzzy time windows (VRPFTW) is proposed and solved. In the transportation business, time windows are not always strictly obeyed and the deviation of service time from the customer-specific time window determines the customer's satisfaction level, which can also be regarded as the Supplier's service level. This paper applies fuzzy membership functions to characterize the service level issues associated with time window violation in a vehicle routing problem and propose VRPFTW. VRPFTW is formulated as a multi-objective model with two goals: (I) to minimize the travel distance and (2) to maximize the service level of the supplier to customers. To solve this multi-objective model, a two stage algorithm is developed to obtain a Pareto solution for VRPFTW. Using the two-stage algorithm, VRPFTW is decomposed into two subproblems, namely a traditional vehicle routing problem with time windows (VRPTW-alpha) and a service improvement problem,and each of the objective, is sequentially solved. The service improvement problem is solved under two different scenarios. When the fuzzy membership function is linear, it is shown that the service improvement problem can be solved by the cutting plane algorithm within finite iterations, and when the fuzzy membership function is concave, the service improvement problem can be solved by a subgradient-based algorithm. Moreover, an alternative formulation of VRPFTW is also proposed and analyzed. Experiments are conducted to compare different models of vehicle routing problems with time windows in situations where violation of time windows is allowed, and the results show that the VRPFTW model can achieve considerable cost-savings, while at the same time maintaining an acceptable service level. Published by Elsevier B.V.

关键词： Vehicle routing problem (VRP) Time windows Service level Fuzzy constraints multi-objective programming

来源：评论

学校读者我要写书评

暂无评论

Optimizing Circular Economy Planning and Risk Analysis Using System Dynamics

引用

HUMAN AND ECOLOGICAL RISK ASSESSMENT 2009年第2期15卷 316-331页

作者： Xu, Jiuping Li, Xiaofei Wu, Desheng Dash Reykjavik Univ Sch Sci & Engn IS-103 Reykjavik Iceland Sichuan Univ Sch Business & Adm Uncertainty Decis Making Lab Chengdu 610064 Peoples R China Univ Toronto RiskLab Toronto ON Canada

This article develops a systems dynamics and multi-objective programming model (SDMOP) for planning a regional circular economy. Various risk analyses are conducted using the technique of sensitivity analysis. This SDMOP model includes two modules: the MOP module used to derive optimized parameters as inputs to the systems dynamics model, and the systems dynamics module used to plan the regional circular economy. We demonstrate the application of this SDMOP model to a problem of planning the circular economy of a county in the Sichuan Province of China.

关键词： circular economy system dynamics multi-objective programming risk analysis sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

New approach to determine common weights in DEA efficiency evaluation model

引用

Chinese Journal of Systems Engineering and Electronics 2010年第4期000卷

作者： Feng Yang Chenchen Yang Liang Liang Shaofu Du School of Management University of Science and Technology of ChinaHefei 230026P.R.China

Data envelopment analysis(DEA)is a mathematical programming approach to appraise the relative efficiencies of peer decision-making unit(DMU),which is widely used in ranking ***,almost all DEA-related ranking approaches are based on the self-evaluation *** other words,each DMU chooses the weights it prefers to most,so the resulted efficiencies are not suitable to be used as ranking *** this paper proposes a new approach to determine a bundle of common weights in DEA efficiency evaluation model by introducing a multi-objective integer *** paper also gives the solving process of this multi-objective integer programming,and the solution is proven a Paroto efficient *** solving process ensures that the obtained common weight bundle is acceptable by a groat number of *** a numeral example is given to demonstrate the approach.

关键词： data envelopment analysis(DEA) common weight ranking multi-objective programming

来源：评论

学校读者我要写书评

暂无评论

Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks

引用

OPERATIONS RESEARCH LETTERS 2009年第3期37卷 201-205页

作者： Pretolani, Daniele Nielsen, Lars Relund Andersen, Kim Allan Ehrgott, Matthias Univ Modena Dept Sci & Methods Engn I-42100 Reggio Emilia Italy Univ Aarhus Dept Genet & Biotechnol DK-8830 Tjele Denmark Univ Aarhus Aarhus Sch Business Dept Business Studies DK-8210 Aarhus V Denmark Univ Auckland Dept Engn Sci Auckland 1142 New Zealand

We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic "time-adaptive" model and the more flexible "history-adaptive" one. We point out several properties of the sets of efficient solutions found under the two models. We also devise a method for finding supported history-adaptive solutions. (C) 2009 Elsevier B.V. All rights reserved.

关键词： multi-objective programming Shortest paths Stochastic time-dependent networks Time-adaptive strategies History-adaptive strategies

来源：评论

学校读者我要写书评

暂无评论

Mine Ore Blending planning and management Based on the Fuzzy multi-objective Optimization Algorithm

Mine Ore Blending planning and management Based on the Fuzzy...

引用

International Seminar on Business and Information Management (ISBIM 2008)

作者： Xu, T. J. Yang, P. Liu, Z. Q. Minist Educ Key Lab High Efficient Min Metall Ore Deposit Beijing 100083 Peoples R China Jinchengxin Min Construct Grp Co Ltd Beijing 100089 Peoples R China

ISBN: (纸本)9780769535609

In a time of digitalization and informationization for Mine enterprise, based on the complication of multiobjective ore blending planning and management, a question of fuzzy multi-objective ore blending is proposed. Then according to linguistic preference information and satisfying degree of decision maker, a fuzzy multi-objective optimization algorithm is designed. The algorithm effectively solves the difficulties in multi-objective decisions, such as difficult to quantify certain objectives and restrictions and to weigh decision objectives subjectively, and different dimensions of objectives. It has also the Characteristics of flexibility and sensitivity, which is verified through a application example of certain mine, it is a practical, great universal method or means for the mine ore blending planning and management.

关键词： multi-objective programming ore blending model fuzzy optimization algorithm satisfying degree ore blending

来源：评论

学校读者我要写书评

暂无评论

The Study of Model for Portfolio Investment Based on Ant Colony Algorithm

引用

1st International Conference on Future Computer and Communication (FCC 2009)

作者： Ting, Wang Xia, Yang North China Elect Power Univ Dept Econ Management Baoding 071003 Hebei Peoples R China

ISBN: (纸本)9783642023415

The risk and benefits are consided synthesizely in portforio investment based on the Markowitz portfolio theory. A multi-objective programming model of portforio investment is established and studied the model solution with the ant group algorithm, then obtained a better result compared to using the Lingo model. Unified the ant group algorithm and the modem computer's formidable operational capability, making the investor to be more convenient in the actual operation.

关键词： multi-objective programming portfolio investment ant colony algorithm Lingo 1

来源：评论

学校读者我要写书评

暂无评论

An Efficient Heuristic for multi-objective Bulk Transportation Problem

An Efficient Heuristic for Multi-Objective Bulk Transportati...

引用

International Conference on Computers and Industrial Engineering (CIE39)

作者： Prakash, Satya Sharma, Mahesh K. Singh, Amarinder Amity Sch Engn & Technol New Delhi India Thapar Univ SMCA Patiala 147004 Punjab India Baba Banda Singh Bahadur Engn Coll Fatehgarh Sahib India

ISBN: (纸本)9781424441358

A cost-time trade-off bulk transportation problem (BTP) with the objectives to minimize the total cost and duration of the bulk transportation without according priorities to them is considered. The entire requirement of each destination is to be met from a single source only;however a source can supply to any number of destinations subject to the availability of the commodity at it. The Extremum Difference Method (EDM) is applied to obtain the set of Pareto optimal solutions of this problem. This work provides an alternate procedure to obtain the solutions obtained by Prakash et al. [9].

关键词： multi-objective programming Transportation problem Bulk transportation problem Heuristics Pareto optimal

来源：评论

学校读者我要写书评

暂无评论

A multi-objective DEA Approach in Chinese University Evaluation

A Multi-objective DEA Approach in Chinese University Evaluat...

引用

2nd International Conference on Information Management, Innovation Management and Industrial Engineering

作者： Yang, Zheng Liang, Liang Univ Sci & Technol China Sch Management Hefei 230026 Anhui Peoples R China

ISBN: (纸本)9780769538761

Weight flexibility is the main reason why the traditional DEA models can't be directly used in ranking. The current paper proposes a multi-objective DEA model to derive common weights to weaken or eliminate the weight flexibility. In out proposed approach the obtained common weights can be accepted by at least half of all decision making units. The proposed technique is used in the university evaluation in China.

关键词： Data envelopment analysis (DEA) multi-objective programming Commom weigh

来源：评论

学校读者我要写书评

暂无评论

Designing Efficient Subsidy Policies in a Regional Economy: A multicriteria Decision-Making (MCDM)-Computable General Equilibrium (CGE) Approach

引用

REGIONAL STUDIES 2009年第8期43卷 1035-1046页

作者： Andre, Francisco J. Cardenete Flores, Manuel Alejandro Univ Pablo Olavide Dept Econ E-41013 Seville Spain

Andre F. J. and Cardenete M. A. Designing efficient subsidy policies in a regional economy: a multicriteria decision-making (MCDM)-computable general equilibrium (CGE) approach, Regional Studies. Since policy-makers usually pursue several conflicting objectives, policy-making can be understood as a multicriteria decision problem. Following the methodological proposal by Andre and Cardenete (2005), multi-objective programming is used in connection with a computable general equilibrium model to represent optimal policy-making and to obtain so-called efficient policies in an application to a regional economy (Andalusia, Spain). This approach is applied to the design of subsidy policies under two different scenarios. In the first scenario, it is assumed that the government is concerned just about two objectives: ensuring the profitability of a key strategic sector and increasing overall output. Finally, the scope of the exercise is enlarged by solving a problem with seven policy objectives, including both general and sectorial objectives. It is concluded that the observed policy could have been Pareto-improved in several directions.

关键词： multi-objective programming Computable general equilibrium model Efficient policy Subsidies

来源：评论

学校读者我要写书评

暂无评论

Study on Passenger Train Stopping Scheme Based on Improved Particle Swarm Optimization Algorithm

Study on Passenger Train Stopping Scheme Based on Improved P...

引用

IEEE International Conference on Intelligent Computing and Intelligent Systems

作者： Wang, Shuang Zhao, Peng Qiao, Ke Beijing Jiaotong Univ Sch Traff & Transportat Beijing Peoples R China

ISBN: (纸本)9781424447541

This paper develops a multi-objective optimization model for the passenger train stopping scheme on high-speed railway lines Minimizing the stopping times for all passenger trains, minimizing travel distance of empty trains and minimizing the number of transfer passengers are the three planning objectives of the model For a given travel demand and specified capacity of stops, the model is solved by heuristic algorithm An improved discrete Particle Swarm Optimization (PSO) algorithm is presented to determine the best-compromise train stopping scheme with high effectiveness and stability In the algorithm, a stop based representation is designed, and a new method is used to update the position and velocity of particles In order to keep the particle swarm algorithm from premature stagnation, the simulated annealing algorithm, which has local search ability, is combined with the PSO algorithm to make elaborate search near the optimal solution, then the quality of solutions is improved effectively An empirical study on a given small railway network is conducted to demonstrate the effectiveness of the model and the performance of the algorithm The experimental results show that the hybrid algorithm has great advantages in both success rate and convergence speed compared with other discrete PSO algorithm and genetic algorithm, and an optimal set of stopping schemes can always be generated for a given demand To achieve the best planning outcome, the stopping schemes should be flexibly planned, and not constrained by specific ones as often set by the planner

关键词： high-speed railway lines passenger train stopping scheme multi-objective programming particle swarm optimization algorithm simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：