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

Train scheduling for minimizing passenger waiting time with time-dependent demand and skip-stop patterns: nonlinear integer programming models with linear constraints

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2015年 76卷 117-135页

作者： Niu, Huimin Zhou, Xuesong Gao, Ruhu Lanzhou Jiaotong Univ Sch Traff & Transportat Lanzhou 730070 Peoples R China Arizona State Univ Sch Sustainable Engn & Built Environm Tempe AZ 85287 USA

This paper focuses on how to minimize the total passenger waiting time at stations by computing and adjusting train timetables for a rail corridor with given time-varying origin-to-destination passenger demand matrices. Given predetermined train skip-stop patterns, a unified quadratic integer programming model with linear constraints is developed to jointly synchronize effective passenger loading time windows and train arrival and departure times at each station. A set of quadratic and quasi-quadratic objective functions are proposed to precisely formulate the total waiting time under both minute-dependent demand and hour-dependent demand volumes from different origin-destination pairs. We construct mathematically rigorous and algorithmically tractable nonlinear mixed integer programming models for both real-time scheduling and medium-term planning applications. The proposed models are implemented using general purpose high-level optimization solvers, and the model effectiveness is further examined through numerical experiments of real-world rail train timetabling test cases. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Train timetable Passenger waiting time Time-varying demand Skip-stop pattern nonlinear mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

The redesign of a warranty distribution network with recovery processes

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2015年 77卷 184-197页

作者： Ashayeri, Jalal Ma, Ning Sotirov, Renata Tilburg Univ Dept Econometr & OR NL-5000 LE Tilburg Netherlands

A warranty distribution network provides aftersales warranty services to customers and resembles a closed-loop supply chain network with specific challenges for reverse flows management like recovery, repair, and reflow of refurbished products. We present here a nonlinear and nonconvex mixed integer programming model for the design of the warranty distribution network of a semiconductor company which is operated by an out-sourced third party logistics service provider. The application of the model to the real-life case provides an improved distribution network flow and rearranged warehouse and recovery locations, and resulted in weekly cost savings of 3.4% for the considered item. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Warranty distribution network Supply chain nonlinear mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Fuzzy programming Approach to an Environmental Supply Chain Network Design Problem

引用

JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING 2015年第1期25卷 81-103页

作者： Ozceylan, Eren Pehlivan, Nimet Yapici Paksoy, Turan Gaziantep Univ Dept Business Adm TR-27310 Gaziantep Turkey Selcuk Univ Dept Stat TR-42075 Konya Turkey Selcuk Univ Dept Ind Engn TR-42075 Konya Turkey

Increasing the environmental concerns with legislations and responsibilities are forcing enterprises to take an attention at the impact of their supply chain operations on the environment. An optimally designed supply chain network is required to provide economic, social and environmental requirements in good flows actualizing between suppliers, manufacturers and customers. A nonlinear mixed integer programming model is proposed with the aimed of optimally determining consumed fuel, emitted CO2, driver and transportation costs in this study. However, real world supply chain operations are occurred in a highly dynamic and imprecise environment. Thus, a fuzzy mathematical programming approach is applied to cope with uncertainty in the capacities and demands. The proposed fuzzy model is validated and also compared with different fuzzy mathematical programming approaches through an example, where its applicability is demonstrated for managerial insights.

关键词： Environmental impacts fuzzy mathematical programming nonlinear mixed integer programming supply chain network design

来源：评论

学校读者我要写书评

暂无评论

Fuzzy mathematical programming approaches for reverse supply chain optimization with disassembly line balancing problem

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2014年第4期26卷 1969-1985页

作者： Ozceylan, Eren Paksoy, Turan Selcuk Univ Dept Ind Engn Konya Turkey

Today, the requirement of reverse supply chain (RSC) optimization takes more attention due to environmental and competitive factors. However, increasing attention and existing uncertainty in RSC also increases the difficulties for decisions of production/distribution planning. Therefore, considering strategic and tactical decisions together under fuzziness is being essential. This paper presents a fuzzy programming approach to the integration of RSC optimization (strategic level) and disassembly line balancing (DLB) (tactical level) problems. The aim of this study is to apply fuzzy modeling to optimize a RSC that involves customers, collection/disassembly centers and plants while balancing the disassembly lines in disassembly centers, simultaneously. Two types of fuzzy mathematical programming models with different aggregation operators are used. Finally, accuracy and applicability of the model is illustrated and a comparison of fuzzy approaches is done via a hypothetical example.

关键词： Disassembly line balancing fuzzy mathematical programming nonlinear mixed integer programming reverse supply chain

来源：评论

学校读者我要写书评

暂无评论

Modeling and optimizing the integrated problem of closed-loop supply chain network design and disassembly line balancing

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2014年 61卷 142-164页

作者： Ozceylan, Eren Paksoy, Turan Bektas, Tolga Gaziantep Univ Dept Business Adm TR-27310 Gaziantep Turkey Univ Southampton Fac Business & Law Southampton Management Sch Southampton SO17 1BJ Hants England Selcuk Univ Dept Ind Engn TR-42031 Konya Turkey

This paper describes an integrated model that jointly optimizes the strategic and tactical decisions of a closed-loop supply chain (CLSC). The strategic level decisions relate to the amounts of goods flowing on the forward and reverse chains. The tactical level decisions concern balancing disassembly lines in the reverse chain. The objective is to minimize costs of transportation, purchasing, refurbishing, and operating the disassembly workstations. A nonlinear mixed integer programming formulation is described for the problem. Numerical examples are presented using the proposed model. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： nonlinear mixed integer programming Closed-loop supply chain network design Disassembly line balancing

来源：评论

学校读者我要写书评

暂无评论

An exact penalty function method for nonlinear mixed discrete programming problems

引用

OPTIMIZATION LETTERS 2013年第1期7卷 23-38页

作者： Yu, Changjun Teo, Kok Lay Bai, Yanqin Shanghai Univ Shanghai Peoples R China Curtin Univ Technol Perth WA Australia

In this paper, we consider a general class of nonlinear mixed discrete programming problems. By introducing continuous variables to replace the discrete variables, the problem is first transformed into an equivalent nonlinear continuous optimization problem subject to original constraints and additional linear and quadratic constraints. Then, an exact penalty function is employed to construct a sequence of unconstrained optimization problems, each of which can be solved effectively by unconstrained optimization techniques, such as conjugate gradient or quasi-Newton methods. It is shown that any local optimal solution of the unconstrained optimization problem is a local optimal solution of the transformed nonlinear constrained continuous optimization problem when the penalty parameter is sufficiently large. Numerical experiments are carried out to test the efficiency of the proposed method.

关键词： nonlinear mixed integer programming Exact penalty function

来源：评论

学校读者我要写书评

暂无评论

Optimal progressive group censoring scheme under cost considerations for pareto distribution

引用

JOURNAL OF APPLIED STATISTICS 2013年第11期40卷 2437-2450页

作者： Kus, Coskun Akdogan, Yunus Wu, Shuo-Jye Selcuk Univ Dept Stat Fac Sci TR-42225 Konya Turkey Tamkang Univ Dept Stat New Taipei City 25137 Taiwan

In this article, optimal design under the restriction of pre-determined budget of experiment is developed for the Pareto distribution when the life test is progressively group censored. We use the maximum-likelihood method to obtain the point estimator of the Pareto parameter. We propose two approaches to decide the number of test units, the number of inspections, and the length of inspection interval under limited budget such that the asymptotic variance of estimator of Pareto parameter is minimum. A numerical example is given to illustrate the proposed method. Some sensitivity analysis is also studied.

关键词： grouped data interval censoring maximum-likelihood method nonlinear mixed integer programming variance optimality

来源：评论

学校读者我要写书评

暂无评论

A Modified Branch and Bound Algorithm to Solve the Transmission Expansion Planning Problem

A Modified Branch and Bound Algorithm to Solve the Transmiss...

引用

13th International Conference on Environment and Electrical Engineering (EEEIC)

作者： Delgado, M. A. J. Pourakbari-Kasmaei, M. Rider, M. J. UNESP Dept Elect & Elect Engn Ilha Solteira Brazil

ISBN: (纸本)9781479928026

In this paper a novel Branch and Bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the options of the separating variables and makes a search in breadth, we call this algorithm a B&BML algorithm. The proposed algorithm is implemented in AMPL and an open source Ipopt solver is used to solve the nonlinear programming (NLP) problems of all candidates in the B&B tree. Strategies have been developed to address the problem of non-linearity and non-convexity of the search region. The proposed algorithm is applied to the problem of long-term transmission expansion planning modeled as an MINLP problem. The proposed algorithm has carried out on five commonly used test systems such as Garver 6-Bus, IEEE 24-Bus, 46-Bus South Brazilian test systems, Bolivian 57-Bus, and Colombian 93-Bus. Results show that the proposed methodology not only can find the best known solution but it also yields a large reduction between 24% to 77.6% in the number of NLP problems regarding to the size of the systems.

关键词： Branch and Bound algorithm nonlinear mixed integer programming transmission expansion planning

来源：评论

学校读者我要写书评

暂无评论

Analysis of the single-vehicle cyclic inventory routing problem

引用

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE 2012年第11期43卷 2040-2049页

作者： Aghezzaf, El-Houssaine Zhong, Yiqing Raa, Birger Mateo, Manel Ghent Univ UGent Fac Engn Dept Ind Management B-9052 Zwijnaarde Belgium Univ Ghent Fac Econ Dept Informat & Operat Management B-9000 Ghent Belgium Univ Politecn Cataluna ETSEIB Dept Enterprise Management E-08028 Barcelona Spain

The single-vehicle cyclic inventory routing problem (SV-CIRP) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer, selected for replenishments, the supplier collects a corresponding fixed reward. The objective is to determine the subset of customers to replenish, the quantity of the product to be delivered to each and to design the vehicle route so that the resulting profit (difference between the total reward and the total logistical cost) is maximised while preventing stockouts at each of the selected customers. This problem appears often as a sub-problem in many logistical problems. In this article, the SV-CIRP is formulated as a mixed-integer program with a nonlinear objective function. After a thorough analysis of the structure of the problem and its features, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of linear mixed-integer programs. Values of a savings-based heuristic for this problem are compared to the optimal values obtained for a set of some test problems. In general, the gap may get as large as 25%, which justifies the effort to continue exploring and developing exact and approximation algorithms for the SV-CIRP.

关键词： inventory-routing nonlinear mixed integer programming exact algorithms

来源：评论

学校读者我要写书评

暂无评论

Planning Life Tests for Burr XII Distributed Products Under Progressive Group-censoring with Cost Considerations

引用

GAZI UNIVERSITY JOURNAL OF SCIENCE 2012年第2期25卷 425-434页

作者： Akdogan, Yunus Kus, Coskun Wu, Shuo-Jye Selcuk Univ Fac Sci Dept Stat 42250 Campus Konya Turkey Tamkang Univ Dept Stat New Taipei 25137 Taiwan

In this paper, a progressive type I group-censoring life test for Burr XII distribution is considered. We use the maximum likelihood method to obtain the point estimators of the Burr XII parameters. The approximate confidence intervals for the parameters of Burr XII distribution are also obtained. We use modified algorithm proposed by Kus et al. [20] to decide the number of test units, number of inspections, and length of inspection interval under a restricted budget of experiment such that the determinant of the asymptotic variances-covariance of estimators of parameters is minimum. A numerical example is presented to illustrate the proposed approach. The sensitivity analysis is also investigated.

关键词： D-Optimality Grouped data Interval censoring nonlinear mixed integer programming Maximum likelihood method Progressive censoring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：