• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索
High Impact Results & Cited Count Trend for Year Keyword Cloud and Partner Relationship

Query:

学者姓名:吴鹏

Refining:

Source

Submit Unfold

Co-

Submit Unfold

Language

Submit

Clean All

Sort by:
Default
  • Default
  • Title
  • Year
  • WOS Cited Count
  • Impact factor
  • Ascending
  • Descending
< Page ,Total 11 >
自动驾驶背景下停车换乘点和共享停车位的优化管理
期刊论文 | 2025 , 33 (3) , 223-230 | 中国管理科学
Abstract&Keyword Cite

Abstract :

本文研究自动驾驶汽车(autonomous vehicles,AV)背景下,如何设定停车换乘的位置及共享停车位定价来达到预期的目标.假设一个线性城市不允许单人私家车进入市中心,出行者只能选择停车换乘或乘坐共享自动驾驶汽车(shared autonomous vehicles,SAV)到达市中心.自动驾驶条件下,由于汽车能够自主停车,因此有三种停车方式:将车停回家、将车停在换乘点附近的免费停车位、将车停在换乘点附近居民提供的共享停车位.本文从利润最大化以及社会成本最小化两个目标出发,分别探讨两个目标下的最优参数设定.结果表明,两个目标下的最优停车换乘点和最优共享停车位定价均在共享停车位供等于求处取得.本研究可为自动驾驶时代的资源优化配置提供理论参考和决策依据.

Keyword :

优化管理 优化管理 停车换乘 停车换乘 共享停车 共享停车 自动驾驶汽车 自动驾驶汽车

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 蹇娅婷 , 田丽君 , 吴鹏 . 自动驾驶背景下停车换乘点和共享停车位的优化管理 [J]. | 中国管理科学 , 2025 , 33 (3) : 223-230 .
MLA 蹇娅婷 等. "自动驾驶背景下停车换乘点和共享停车位的优化管理" . | 中国管理科学 33 . 3 (2025) : 223-230 .
APA 蹇娅婷 , 田丽君 , 吴鹏 . 自动驾驶背景下停车换乘点和共享停车位的优化管理 . | 中国管理科学 , 2025 , 33 (3) , 223-230 .
Export to NoteExpress RIS BibTex

Version :

MILP models and effective heuristic for energy-aware parallel machine scheduling with shared manufacturing SCIE
期刊论文 | 2025 , 271 | EXPERT SYSTEMS WITH APPLICATIONS
Abstract&Keyword Cite

Abstract :

Driven by advancements in information technology and the modernization of the manufacturing industry, shared manufacturing has emerged as a novel industrial organization mode that enables manufacturing enterprises to mutually utilize external idle resources. Concurrently, to meet the requirements of sustainable development, manufacturing enterprises need to balance economic efficiency with energy consumption in their production practices. This study investigates a new energy-aware parallel machine scheduling problem shared manufacturing environments, where production time, cost, and energy consumption vary across different jobs and machines. The objective is to minimize the weighted sum of makespan, total energy consumption, and overall sharing costs. We first formulate the problem as a mixed-integer linear programming (MILP) model. Then the problem is further refined into an improved MILP model with fewer integer variables. Given the strong NP-hard nature of the problem, an effective tailored heuristic (ETH) is developed based on analyzed problem properties to solve large-scale instances. It includes three main phases: pre-processing, job assignment, and local search. Extensive experimental results demonstrate that the improved MILP model significantly outperforms the original one, and the ETH can solve large-sized instances with up to 400 machines and 20000 jobs within one second, with gaps of less than 1%. The proposed MILP models and ETH can assist manufacturing enterprises in making more informed decisions and scheduling resource allocation while considering economic and environmental factors.

Keyword :

Energy consumption Energy consumption Heuristic Heuristic Mixed-integer linear programming Mixed-integer linear programming Parallel machine scheduling Parallel machine scheduling Shared manufacturing Shared manufacturing

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Cheng, Junheng , Cheng, Jingya , Lin, Yanhong et al. MILP models and effective heuristic for energy-aware parallel machine scheduling with shared manufacturing [J]. | EXPERT SYSTEMS WITH APPLICATIONS , 2025 , 271 .
MLA Cheng, Junheng et al. "MILP models and effective heuristic for energy-aware parallel machine scheduling with shared manufacturing" . | EXPERT SYSTEMS WITH APPLICATIONS 271 (2025) .
APA Cheng, Junheng , Cheng, Jingya , Lin, Yanhong , Lu, Shu , Wu, Peng . MILP models and effective heuristic for energy-aware parallel machine scheduling with shared manufacturing . | EXPERT SYSTEMS WITH APPLICATIONS , 2025 , 271 .
Export to NoteExpress RIS BibTex

Version :

Resilient retailer facility planning: optimizing location and service quality amidst competitors' reactions SCIE
期刊论文 | 2025 | ANNALS OF OPERATIONS RESEARCH
Abstract&Keyword Cite

Abstract :

In today's dynamic and highly competitive market environment, enhancing enterprise resilience has become increasingly critical, imperative and strategic. In this work, we examine a novel approach to resilient retail facility planning, focusing on the strategic location and quality design of retailer facilities. It involves the optimal placement of multiple retail facilities and design of their service quality for a new entrant enterprise by considering the anticipated reactions of existing competitors and the service radius of the facilities. The objective is to maximize the entrant enterprise's net profit while taking into account the existing competitors' reactions reflected by improving their facilities' service quality. For this problem, we first adapt a multiplicative interaction model to analyze the market share captured by each facility. We then use a Stackelberg game to model the competitive decision-making process between the new entrant company and its competitor. Based on this, we formulate the problem into a mixed-integer nonlinear programming model. To solve it, we first develop a tailored Branch & Bound-based exact algorithm. Given the high complexity of the problem, we further develop a problem-specific improved genetic algorithm to solve large-scale instances. The effectiveness and efficiency of the proposed algorithms are confirmed by numerical experimental results from both a real case and randomly generated instances. Our findings indicate that (i) Adopting proactive strategies can empower the supply chain to effectively counteract competitors' reactions; (ii) Considering the limited service radius can assist practitioners in achieving a trade-off between enhancing service quality and increasing the number of facilities, thereby minimizing invalid losses; and (iii) In a competitive market, an increase in budgets does not always lead to an improvement in net profits.

Keyword :

Branch & bound algorithm Branch & bound algorithm Meta-heuristic Meta-heuristic Quality design Quality design Retailer facility location Retailer facility location Service radius Service radius

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Wu, Peng , Li, Shanxing , Zhang, Xinyi et al. Resilient retailer facility planning: optimizing location and service quality amidst competitors' reactions [J]. | ANNALS OF OPERATIONS RESEARCH , 2025 .
MLA Wu, Peng et al. "Resilient retailer facility planning: optimizing location and service quality amidst competitors' reactions" . | ANNALS OF OPERATIONS RESEARCH (2025) .
APA Wu, Peng , Li, Shanxing , Zhang, Xinyi , You, Liping . Resilient retailer facility planning: optimizing location and service quality amidst competitors' reactions . | ANNALS OF OPERATIONS RESEARCH , 2025 .
Export to NoteExpress RIS BibTex

Version :

Effective MILP and matheuristic for multi-echelon green supply chain operations and financing considering carbon emission reduction investment SCIE
期刊论文 | 2025 , 493 | JOURNAL OF CLEANER PRODUCTION
Abstract&Keyword Cite

Abstract :

Carbon emission trading schemes have been widely implemented in many countries to achieve carbon peaking and carbon neutrality goals, significantly encouraging manufacturers to proactively invest in carbon emission reduction. The core manufacturer in green supply chain needs to comprehensively determine carbon emission reduction investments, raw material procurement, product production, transportation, distribution, and financing decisions by considering consumers' green preferences and financial constraints. To effectively tackle this newly emerged practical decision-making problem, a mixed-integer linear programming (MILP) model with the objective of profit maximization is formulated. To address large-scale problems efficiently, a two-stage matheuristic algorithm (TSMA) is developed. Numerous test results indicate that TSMA significantly enhances solution efficiency and achieves high-quality solutions with gaps of less than 1.07%. The results confirm that carbon emission reduction investments and carbon pledge financing can simultaneously decrease manufacturers' carbon emissions and improve the profitability of supply chains. Sensitivity analysis demonstrates that carbon quota prices and consumers' green preferences positively impact profit and carbon emission reduction in green supply chains.

Keyword :

Carbon emission reduction investment Carbon emission reduction investment Financing Financing Green supply chain management Green supply chain management Mixed-integer linear programming Mixed-integer linear programming Two-stage matheuristic Two-stage matheuristic

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Cheng, Junheng , Liao, Lintong , Lu, Shu et al. Effective MILP and matheuristic for multi-echelon green supply chain operations and financing considering carbon emission reduction investment [J]. | JOURNAL OF CLEANER PRODUCTION , 2025 , 493 .
MLA Cheng, Junheng et al. "Effective MILP and matheuristic for multi-echelon green supply chain operations and financing considering carbon emission reduction investment" . | JOURNAL OF CLEANER PRODUCTION 493 (2025) .
APA Cheng, Junheng , Liao, Lintong , Lu, Shu , Sun, Tongtong , Wu, Peng . Effective MILP and matheuristic for multi-echelon green supply chain operations and financing considering carbon emission reduction investment . | JOURNAL OF CLEANER PRODUCTION , 2025 , 493 .
Export to NoteExpress RIS BibTex

Version :

韧性城市运营管理:新兴研究热点及其进展
期刊论文 | 2025 , 33 (1) , 34-51 | 中国管理科学
Abstract&Keyword Cite

Abstract :

在城市风险增加和政府政策推动的双重背景下,韧性城市的建设进程加快,随之而来的运营管理问题已逐渐成为一个新兴的研究热点.韧性城市运营管理旨在运用复杂运营管理的思想、方法和技术,提升城市风险应对能力,优化城市资源配置,为增强城市安全韧性和推动城市治理体系现代化提供决策支持.本文基于2013-2023年国内外韧性城市运营管理相关文献,结合韧性城市运营管理内涵,运用定量分析与定性分析相结合的方式,归纳出韧性城市运营管理的交通管理、物流管理、水资源与能源管理、环境管理、安全管理和智慧发展六大主要研究领域,总结了各领域的研究进展,提炼出韧性城市运营管理研究的关注热点,并结合最新的研究成果分析了相关领域研究的必要性和紧迫性.

Keyword :

资源优化 资源优化 运营管理 运营管理 韧性城市 韧性城市 风险应对 风险应对

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 吴鹏 , 王琦 , 霍红 et al. 韧性城市运营管理:新兴研究热点及其进展 [J]. | 中国管理科学 , 2025 , 33 (1) : 34-51 .
MLA 吴鹏 et al. "韧性城市运营管理:新兴研究热点及其进展" . | 中国管理科学 33 . 1 (2025) : 34-51 .
APA 吴鹏 , 王琦 , 霍红 , 刘作仪 . 韧性城市运营管理:新兴研究热点及其进展 . | 中国管理科学 , 2025 , 33 (1) , 34-51 .
Export to NoteExpress RIS BibTex

Version :

福建省新型工业化发展现状、问题和对策
期刊论文 | 2025 , PageCount-页数: 6 (03) , 142-146,190 | 海峡科学
Abstract&Keyword Cite

Abstract :

在国家推进新型工业化、建设制造业强国的战略背景下,福建省电子信息、先进装备制造等优势产业发展成效显著,但在推进新型工业化进程中仍面临诸多挑战。该文剖析了福建省新型工业化发展现状,指出了福建新型工业化发展面临着产业结构不合理、创新能力薄弱、资源环境压力大、人才储备不足和区域发展不均衡等问题。为此,提出针对性对策建议,包括优化产业结构、提升创新与数字化转型能力、推进绿色工业化、完善人才机制和促进区域协调发展等。本文旨在为推动福建省制造业转型升级、区域经济发展和产业结构升级提供实践经验,助力打造新型工业化可持续发展的“福建模式”。

Keyword :

制造业 制造业 对策建议 对策建议 新型工业化 新型工业化 福建省 福建省

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 吴鹏 , 吴月燕 , 赵子龙 et al. 福建省新型工业化发展现状、问题和对策 [J]. | 海峡科学 , 2025 , PageCount-页数: 6 (03) : 142-146,190 .
MLA 吴鹏 et al. "福建省新型工业化发展现状、问题和对策" . | 海峡科学 PageCount-页数: 6 . 03 (2025) : 142-146,190 .
APA 吴鹏 , 吴月燕 , 赵子龙 , 李泽 , 谢银辉 , 陈栩彬 . 福建省新型工业化发展现状、问题和对策 . | 海峡科学 , 2025 , PageCount-页数: 6 (03) , 142-146,190 .
Export to NoteExpress RIS BibTex

Version :

Robust commuting customized bus network design under uncertain road conditions EI
期刊论文 | 2025 , 45 (4) , 1358-1374 | System Engineering Theory and Practice
Abstract&Keyword Cite

Abstract :

In recent years, the emergence of customized buses has provided convenient services for commuters. However, changes in road conditions, attributed to factors such as traffic congestion, bad weather, and car accidents, have increased passenger travel time and significantly impacted the punctuality of bus operations, diminishing the appeal of customized bus services. This study addresses a new commuting customized bus network design problem. It takes into account uncertain road conditions, passenger separation, and the presence of heterogeneous vehicle models. We first formulate it into a multi-objective robust optimization model based on the minimum-maximum regret criterion. This model optimizes the selection of heterogeneous vehicle models, fleet routes, travel times, and passenger assignments with the aim of minimizing both passenger travel costs and bus system operating costs. Then, to effectively solve the model, we propose a multi-objective hybrid adaptive large neighborhood search algorithm. This algorithm incorporates problem-specific characteristics, introduces a passenger separation destruction operator based on these characteristics, and integrates a crossover operator to enhance the algorithm’s optimization capability. Results of extensive numerical experimental results indicate that: i) The consideration of passenger separation and heterogeneous vehicles leads to improved vehicle resource utilization efficiency. Considering passenger separation results in an average time savings of 2.44% and a reduction of 11.46% in operating costs. Similarly, the inclusion of heterogeneous vehicle models yields an average time savings of 1.74% and a decrease in operating cost by 24.95%. ii) Compared with the traditional large neighborhood search algorithm and NSGA-II, our proposed algorithm consistently produces higher-quality Pareto solutions. iii) when compared to solutions obtained under deterministic road conditions, the solutions obtained in the presence of uncertainty in road conditions achieve an average reduction of 1.42% in passenger travel cost and a decrease of 18.24% in operating cost. This confirms the necessity of conducting robust commuting customized bus network design research under uncertain road conditions. © 2025 Systems Engineering Society of China. All rights reserved.

Keyword :

Bus transportation Bus transportation Fleet operations Fleet operations Multiobjective optimization Multiobjective optimization Traffic congestion Traffic congestion Transportation routes Transportation routes Travel time Travel time

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Wu, Peng , Yu, Zewei , Chu, Chengbin . Robust commuting customized bus network design under uncertain road conditions [J]. | System Engineering Theory and Practice , 2025 , 45 (4) : 1358-1374 .
MLA Wu, Peng et al. "Robust commuting customized bus network design under uncertain road conditions" . | System Engineering Theory and Practice 45 . 4 (2025) : 1358-1374 .
APA Wu, Peng , Yu, Zewei , Chu, Chengbin . Robust commuting customized bus network design under uncertain road conditions . | System Engineering Theory and Practice , 2025 , 45 (4) , 1358-1374 .
Export to NoteExpress RIS BibTex

Version :

路况不确定下通勤定制公交网络设计鲁棒优化
期刊论文 | 2025 , 45 (04) , 1358-1374 | 系统工程理论与实践
Abstract&Keyword Cite

Abstract :

近年来新兴的定制公交为通勤人群提供了便利的服务,然而交通拥堵、恶劣天气及交通事故等因素带来的路况变化增加乘客出行时间并严重影响公交运营的准时性,降低了定制公交服务的吸引力.针对一类考虑不确定路况、乘客分流和异质车型的通勤定制公交网络设计优化问题,首先基于最小最大后悔准则,构建了一个多目标鲁棒优化模型,同时优化异质车型选择、车队路线、行车时刻以及乘客分配,以最小化乘客旅行成本和公交系统运营成本.为有效求解该模型,提出了融合问题特征的多目标混合自适应大邻域搜索算法,设计了基于问题特性的乘客分流破坏算子并融合了交叉算子以提升算法寻优能力.大量数值实验结果表明:1)考虑乘客分流和异质车型可以提高车辆资源利用效率,考虑乘客分流平均节约2.44%旅行时间和11.46%运营成本,考虑异质车型平均节约1.74%旅行时间和24.95%运营成本;2)传统大邻域搜索算法和NSGA-Ⅱ相比,所提出算法能获得更高质量的Pareto解; 3)与路况确定情形下获得的方案相比,所获得的方案平均节约1.42%乘客旅行成本和18.24%运营成本,验证了考虑不确定路况研究的必要性.

Keyword :

乘客分流 乘客分流 异质车型 异质车型 混合大邻域搜索 混合大邻域搜索 路况不确定 路况不确定 通勤定制公交 通勤定制公交

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 吴鹏 , 余泽威 , 储诚斌 . 路况不确定下通勤定制公交网络设计鲁棒优化 [J]. | 系统工程理论与实践 , 2025 , 45 (04) : 1358-1374 .
MLA 吴鹏 et al. "路况不确定下通勤定制公交网络设计鲁棒优化" . | 系统工程理论与实践 45 . 04 (2025) : 1358-1374 .
APA 吴鹏 , 余泽威 , 储诚斌 . 路况不确定下通勤定制公交网络设计鲁棒优化 . | 系统工程理论与实践 , 2025 , 45 (04) , 1358-1374 .
Export to NoteExpress RIS BibTex

Version :

Eco-friendly lane reservation-based autonomous truck transportation network design SCIE
期刊论文 | 2024 , 62 (23) , 8239-8259 | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
WoS CC Cited Count: 2
Abstract&Keyword Cite

Abstract :

As one of the primary sources of carbon emissions, transportation sector has proposed various measures to reduce its carbon emissions. Introducing energy-efficient and low-carbon autonomous trucks into freight transportation is highly promising, but faces various challenges, especially safety issues. This study addresses eco-friendly lane reservation-based autonomous truck transportation network design for transportation safety and low carbon emissions. It aims to optimally implement dedicated truck lanes in an existing network and design dedicated routes for autonomous truck transportation to simultaneously minimise the negative impact caused by dedicated truck lanes and carbon emissions of the entire transportation system. We first formulate this problem into a bi-objective integer linear program. Then, an epsilon-constraint-based two-stage algorithm (ETSA) is proposed to solve it based on explored problem properties. A case study based on the well-known Sioux Falls network is conducted to demonstrate the applicability of the proposed model and algorithm. Computational results for 310 instances from the literature demonstrate that the proposed algorithm significantly outperforms the epsilon-constraint combined with the proposed ILP in obtaining the Pareto front. Moreover, helpful managerial insights are derived based on sensitivity analysis.

Keyword :

Autonomous truck Autonomous truck carbon emissions carbon emissions lane reservation lane reservation multi-objective optimisation multi-objective optimisation two-stage algorithm two-stage algorithm

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Xu, Ling , Wu, Peng , Chu, Chengbin et al. Eco-friendly lane reservation-based autonomous truck transportation network design [J]. | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH , 2024 , 62 (23) : 8239-8259 .
MLA Xu, Ling et al. "Eco-friendly lane reservation-based autonomous truck transportation network design" . | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 62 . 23 (2024) : 8239-8259 .
APA Xu, Ling , Wu, Peng , Chu, Chengbin , D'Ariano, Andrea . Eco-friendly lane reservation-based autonomous truck transportation network design . | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH , 2024 , 62 (23) , 8239-8259 .
Export to NoteExpress RIS BibTex

Version :

Resource Allocation to Minimize the Makespan with Multi-Resource Operations SCIE
期刊论文 | 2024 , 37 (5) , 2054-2070 | JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
Abstract&Keyword Cite

Abstract :

This paper investigates a new resource-allocation problem involving multi-resource operations, where completing an operation requires simultaneous use of multiple (renewable) resources, probably of different types. The goal of the study is to provide a solution method that minimizes the makespan. The authors formulate the problem into a novel mixed-integer linear program (MILP) model. To efficiently solve practical-sized instances, an exact Benders decomposition algorithm is developed. This algorithm divides the original problem into a master problem of allocating resources and a subproblem of calculating the makespan, and both are linked via Benders cuts. The convergence is sped up by improving the mathematical model and embedding the variable neighborhood search algorithm. Compared with CPLEX, a commonly used MILP solver, the computational results demonstrate that the proposed algorithm provides tighter upper and lower bounds in most instances. In particular, compared with CPLEX, the proposed method can on average improve the upper and lower bounds by 4.76% and 4.39%, respectively, in solving practical-sized instances.

Keyword :

Benders decomposition Benders decomposition multi-resources operations multi-resources operations resource allocation resource allocation

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Weng, Wuyan , Chu, Chengbin , Wu, Peng . Resource Allocation to Minimize the Makespan with Multi-Resource Operations [J]. | JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY , 2024 , 37 (5) : 2054-2070 .
MLA Weng, Wuyan et al. "Resource Allocation to Minimize the Makespan with Multi-Resource Operations" . | JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY 37 . 5 (2024) : 2054-2070 .
APA Weng, Wuyan , Chu, Chengbin , Wu, Peng . Resource Allocation to Minimize the Makespan with Multi-Resource Operations . | JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY , 2024 , 37 (5) , 2054-2070 .
Export to NoteExpress RIS BibTex

Version :

10| 20| 50 per page
< Page ,Total 11 >

Export

Results:

Selected

to

Format:
Online/Total:66/10383196
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1