Query：
学者姓名：方云飞
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
This work studies an emergency routing scheduling problem for the forest fire patrol. It aims to plan the optimal routes for patrolling the high-risk places with priority levels. The objective of the problem is to minimize the total travel time of all the patrol vehicles, so that the forest fire can be discovered at early time if it happens. To study the problem, an integer programming (IP) model is formulated for it. Then a fast tabu search based algorithm is proposed to solve the problem. Numerical experiments are conducted and computational results are compared with CPLEX. It is shown that the formulated model is effective and the proposed algorithm is efficient to obtain near-optimal solutions, which can provide useful information decision makers for emergence management. © 2024 IEEE.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Fang, Y. , Li, C. , Zha, J. et al. A Fast Tabu Search Algorithm for the Emergency Route Planning for Forest Fires with Priority Level [未知]. |
| MLA | Fang, Y. et al. "A Fast Tabu Search Algorithm for the Emergency Route Planning for Forest Fires with Priority Level" [未知]. |
| APA | Fang, Y. , Li, C. , Zha, J. , Liu, J. , Wang, Y. , Deng, Y. . A Fast Tabu Search Algorithm for the Emergency Route Planning for Forest Fires with Priority Level [未知]. |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
为解决1种新的叫车接送问题(DARP)——灵活多车场多类型的叫车接送问题(MDHDARP-FD),建立以总行驶成本最小为目标的混合整数非线性规划数学模型.由于模型非常复杂,难以直接求解,对模型进行约束线性化、变量聚合和添加有效不等式等处理.在约束线性化过程中,非线性约束被重写为等价的线性约束;在变量聚合过程中,将具有相同性质的决策变量进行聚合,以减少变量数量;还引入了一些有效不等式来强化模型.从而获得1个解空间较小易于求解的新线性规划模型,并结合不同类型的车辆和乘客需求进行叫车接送问题的仿真测试.算例结果表明,相比于传统叫车接送问题,该模型能在满足复杂约束的基础上,得到1组实现乘客接送需求的最优车辆路线,并且能有效降低总行驶成本、车辆行驶时间和求解时间,总行驶成本在不同类型的DARP上可平均降低1.51％～6.69％,证实了叫车接送问题的总行驶成本可以随着灵活车场的引入而减少.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 陈可嘉 , 方云飞 , 骆佳艺 . 灵活多车场多类型的叫车接送问题的规划模型 [J]. | 交通信息与安全 , 2021 , 39 (3) : 103-110 . |
| MLA | 陈可嘉 et al. "灵活多车场多类型的叫车接送问题的规划模型" . | 交通信息与安全 39 . 3 (2021) : 103-110 . |
| APA | 陈可嘉 , 方云飞 , 骆佳艺 . 灵活多车场多类型的叫车接送问题的规划模型 . | 交通信息与安全 , 2021 , 39 (3) , 103-110 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Recycling of end-of-life (EOL) products has drawn much attention from both researchers and practitioners over the recent decades due to the environmental protection, sustainable development and economic benefits. For an EOL product recycling system, a core problem is to separate their useful and hazardous parts by an efficient disassembly line in which there exist uncertain factors, such as stochastic task processing time. The corresponding combinatorial optimization problems aim to optimally choose alternative task processes, determine the number of workstations to be opened, and assign the disassembly tasks to the opened workstations. In most existing studies, the probability distribution of task processing time is assumed to be known. However, the complete information of probability distribution is often unavailable due to various factors. In this study, we address a disassembly line balancing problem to minimize the total disassembly cost in which only limited information of probability distribution, i.e., the mean, lower and upper bounds of task processing time, is known. Based on problem analysis, some properties are derived for the construction of a new distribution-free model. Furthermore, an effective second-order cone program approximation-based method is developed to solve the proposed model. Experimental results of benchmark examples and newly generated instances demonstrate the effectiveness and efficiency of the proposed method in dealing with stochastic disassembly line balancing with limited distributional information. Finally, managerial insights and future research are discussed.
Keyword ：
Disassembly line balancing Disassembly line balancing Distribution-free Distribution-free End-of-life End-of-life Second-order cone approximation Second-order cone approximation Stochastic optimization Stochastic optimization
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Hu, Peng , Chu, Feng , Fang, Yunfei et al. Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2021 , 43 (5) : 1423-1446 . |
| MLA | Hu, Peng et al. "Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 43 . 5 (2021) : 1423-1446 . |
| APA | Hu, Peng , Chu, Feng , Fang, Yunfei , Wu, Peng . Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2021 , 43 (5) , 1423-1446 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
为提高公共交通系统的吸引力,从公共自行车和公交车接驳的角度,提出以公交站点为中心的公共自行车选址及自行车道设置的网络构建问题。首先,建立以最大化满足用户需求量为优化目标的非线性优化模型,并与只考虑站点选址的传统模型进行比较分析;在分析问题基础上,构造基于问题特性的邻域结构和邻域解生成准则,并最终设计基于禁忌搜索的问题求解方法。通过MATLAB编程进行仿真实验测试大量算例,结果表明所设计算法能够高效地求解各类规模算例,并给出高质量的公共自行车网络构建近似最优方案;此外,敏感性分析实验为规划者制定决策方案提供参考依据。
Keyword ：
优化模型 优化模型 公共自行车 公共自行车 禁忌搜索 禁忌搜索 自行车道 自行车道 选址 选址
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 方云飞 , 王晓园 , 周珍 et al. 基于禁忌搜索的公共自行车站点及车道选址优化 [J]. | 重庆大学学报:自然科学版 , 2020 , 0 (1) : 19-27 . |
| MLA | 方云飞 et al. "基于禁忌搜索的公共自行车站点及车道选址优化" . | 重庆大学学报:自然科学版 0 . 1 (2020) : 19-27 . |
| APA | 方云飞 , 王晓园 , 周珍 , 宋焰 . 基于禁忌搜索的公共自行车站点及车道选址优化 . | 重庆大学学报:自然科学版 , 2020 , 0 (1) , 19-27 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
针对地铁与自驾车两种出行方式并存的双模式交通系统,考虑通勤者出行与活动之间的关联,用量化的净效用函数代替Logit模型中的效用函数,分析了常数和线性边际活动效用下通勤者早高峰上班出行方式选择问题.研究发现,基于出行的方法估计的通勤人数介于基于常数和线性边际活动效用估计的通勤人数之间;基于边际活动效用的通勤者比基于出行方法的通勤者对早到惩罚更为敏感;基于出行方法与基于边际活动预测的通勤者对晚到惩罚敏感程度均弱.此外,在选择的参数范围内,系统总成本函数是一个分段函数,且存在最优发车间隔.
Keyword ：
Logit模型 Logit模型 出行方式选择 出行方式选择 城市交通 城市交通 基于活动的方法 基于活动的方法
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 吴苏萍 , 田丽君 , 方云飞 . 基于活动效用的通勤者出行方式选择研究 [J]. | 系统科学与数学 , 2020 , 40 (10) : 1737-1748 . |
| MLA | 吴苏萍 et al. "基于活动效用的通勤者出行方式选择研究" . | 系统科学与数学 40 . 10 (2020) : 1737-1748 . |
| APA | 吴苏萍 , 田丽君 , 方云飞 . 基于活动效用的通勤者出行方式选择研究 . | 系统科学与数学 , 2020 , 40 (10) , 1737-1748 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
为提高公共交通系统的吸引力,从公共自行车和公交车接驳的角度,提出以公交站点为中心的公共自行车选址及自行车道设置的网络构建问题.首先,建立以最大化满足用户需求量为优化目标的非线性优化模型,并与只考虑站点选址的传统模型进行比较分析;在分析问题基础上,构造基于问题特性的邻域结构和邻域解生成准则,并最终设计基于禁忌搜索的问题求解方法.通过MATLAB编程进行仿真实验测试大量算例,结果表明所设计算法能够高效地求解各类规模算例,并给出高质量的公共自行车网络构建近似最优方案;此外,敏感性分析实验为规划者制定决策方案提供参考依据.
Keyword ：
优化模型 优化模型 公共自行车 公共自行车 禁忌搜索 禁忌搜索 自行车道 自行车道 选址 选址
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 方云飞 , 王晓园 , 周珍 et al. 基于禁忌搜索的公共自行车站点及车道选址优化 [J]. | 重庆大学学报 , 2020 , 43 (1) : 19-27 . |
| MLA | 方云飞 et al. "基于禁忌搜索的公共自行车站点及车道选址优化" . | 重庆大学学报 43 . 1 (2020) : 19-27 . |
| APA | 方云飞 , 王晓园 , 周珍 , 宋焰 . 基于禁忌搜索的公共自行车站点及车道选址优化 . | 重庆大学学报 , 2020 , 43 (1) , 19-27 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
This paper investigates hazardous material transportation problem involving the lane reservation strategy. The strategy of reserving the lanes on some road segments for hazardous material transportation can reduce the transportation risk, but it will also affect the normal traffic. The considered problem is to choose lanes to be reserved on the network and select the path for each hazardous material shipment, with the aim of both minimizing the transportation risk and minimizing the impact of reserved lanes on normal traffic. A bi-objective model is developed for the considered problem, and then an improved \varepsilon-constraint method is proposed for obtaining all Pareto optimal solutions. The performance of the proposed algorithm is evaluated by randomly generated instances. Computational results demonstrate that for the considered problems, the improved \varepsilon-constraint method can solve all Pareto optimal solutions within a reasonable time. © 2019 IEEE.
Keyword ：
Hazardous materials Hazardous materials Hazards Hazards Materials handling Materials handling Optimal systems Optimal systems Pareto principle Pareto principle Risks Risks
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhou, Zhen , Tang, Shusong , Fang, Yunfei et al. Model and Method for Bi-objective Hazardous Material Transportation Problem based on Lane Reservation [C] . 2019 . |
| MLA | Zhou, Zhen et al. "Model and Method for Bi-objective Hazardous Material Transportation Problem based on Lane Reservation" . (2019) . |
| APA | Zhou, Zhen , Tang, Shusong , Fang, Yunfei , Lei, Weidong . Model and Method for Bi-objective Hazardous Material Transportation Problem based on Lane Reservation . (2019) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
This study addresses a new lane reservation problem in a transportation network with task merging and residual capacity constraints called the CLRP-TM. It aims to optimally convert some general-purpose lanes in the transportation network to be reserved and design reserved lane-based routes for some time-efficient transportation tasks emerging in large-scale special events. Once reserved, the lanes can only be used by the special tasks and their travel times can be reduced. However, the general-purpose vehicles on adjacent non-reserved lanes will burden travel delay due to the reduction of available lanes. To pre-merging some tasks that are geographically close can greatly reduce such negative impact because the required number of time-efficient transport routes is reduced. Besides, each road segment has a limited residual capacity for task vehicles if no lanes are reserved on it. The objective of the CLRP-TM is to minimize the total negative impact caused by all reserved lanes. For this problem, an integer linear programming model is developed and solved using existing commercial solver CPLEX. Computational results for a real-life example from the Guangzhou Asian Games in 2009 confirm the effectiveness and efficiency of the proposed approach.
Keyword ：
lane reservation lane reservation optimization optimization residual capacity residual capacity traffic control traffic control Transportation planning Transportation planning
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wu, Peng , Xu, Ling , Fang, Yunfei . A decision model for optimal lane reservation with task merging and residual capacity constraints [C] . 2019 : 528-532 . |
| MLA | Wu, Peng et al. "A decision model for optimal lane reservation with task merging and residual capacity constraints" . (2019) : 528-532 . |
| APA | Wu, Peng , Xu, Ling , Fang, Yunfei . A decision model for optimal lane reservation with task merging and residual capacity constraints . (2019) : 528-532 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
This work studies an emergency routing problem (ERP) for the forest fire. It aims to design the optimal fire-fighting routes for the multiple fire points with priority levels. The objective of the ERP is to minimize the total travel distance of all the rescue teams, so that the forest fire can be distinguished in an efficient way. To study the ERP, firstly it is described as an optimization problem, then an integer programming (IP) model is developed for it. The model is discussed as an extension of the emergency scheduling problem in the literature. A commercial IP solver CPLEX is applied for solving the developed model. Benchmark and random instances are tested in numerical experiments to evaluate the model. The computational results justify the correctness and effectiveness of the model.
Keyword ：
emergency routing emergency routing forest fire forest fire integer programming integer programming optimization optimization priority level priority level
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Fang, Yunfei , Deng, Yanjun , Zhou, Zhen . Formulation and solution of an emergency routing problem for forest fire with priority areas [C] . 2019 : 166-170 . |
| MLA | Fang, Yunfei et al. "Formulation and solution of an emergency routing problem for forest fire with priority areas" . (2019) : 166-170 . |
| APA | Fang, Yunfei , Deng, Yanjun , Zhou, Zhen . Formulation and solution of an emergency routing problem for forest fire with priority areas . (2019) : 166-170 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
This work studied a bike station location problem (BSLP) for the bike-sharing system. To promote the system, the problem aims at maximizing the service quality via optimal decision of locating the bike stations and design travel route for bike users. The service quality is evaluated by the satisfaction function which reflects the travel time of the bike journey. Then an integer programming model is formulated for the BSLP. To validate the proposed model, a commercial IP solver CPLEX is applied for solving it in extensive experiments. Computational results on sensitive analysis of parameters justify the correctness and effectiveness of the model. Moreover, useful remarks are drawn as suggestions for decision making of the location of bike-sharing system.
Keyword ：
bike-sharing bike-sharing integer programming integer programming optimization optimization service quality service quality station location station location
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Fang, Yunfei , Song, Yan , Chen, Ding et al. A location-routing problem for the public bike-sharing system with service level [C] . 2019 : 354-358 . |
| MLA | Fang, Yunfei et al. "A location-routing problem for the public bike-sharing system with service level" . (2019) : 354-358 . |
| APA | Fang, Yunfei , Song, Yan , Chen, Ding , Wu, Peng , Chu, Feng . A location-routing problem for the public bike-sharing system with service level . (2019) : 354-358 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
