Query：
学者姓名：吴鹏
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
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 . |
| MLA | Xu, Ling et al. "Eco-friendly lane reservation-based autonomous truck transportation network design" . | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2024) . |
| 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 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The concept of green manufacturing emphasizes the importance of product disassembly in achieving energyefficient recycling and remanufacturing operations. Disassembly line balancing (DLB) is a critical component of the product disassembly process, wherein a set of tasks must be allocated to workstations for disassembly. This study proposes a multi-objective DLB model that aims to minimize multiple conflicting objectives simultaneously including idle rate, smoothness, labor cost, and energy consumption. A key innovation of this study involves the creation of a tailored adaptive large neighborhood search (ALNS) algorithm which is one of the first studies in the literature on product disassembly algorithms. The developed ALNS employs efficient construction and destruction heuristics to solve the proposed multi-objective DLB problem. The ALNS algorithm aims to destroy and repair solutions effectively, while a local search procedure helps it escape from local optimum solutions. The provided DLB model is effectively solved by applying the proposed ALNS algorithm to the disassembly process of a turbine reducer. The obtained results from this application serve as a compelling demonstration of the efficiency and effectiveness of the proposed approach. Furthermore, comparisons conducted with various state-ofthe-art algorithms using small and large instance sets consistently highlight the superiority of the proposed ALNS approach.
Keyword ：
Construction and destruction heuristics Construction and destruction heuristics Disassembly line balancing Disassembly line balancing Green manufacturing Green manufacturing Large neighborhood search Large neighborhood search Local search Local search
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Fathollahi-Fard, Amir M. , Wu, Peng , Tian, Guangdong et al. An efficient multi-objective adaptive large neighborhood search algorithm for solving a disassembly line balancing model considering idle rate, smoothness, labor cost, and energy consumption [J]. | EXPERT SYSTEMS WITH APPLICATIONS , 2024 , 250 . |
| MLA | Fathollahi-Fard, Amir M. et al. "An efficient multi-objective adaptive large neighborhood search algorithm for solving a disassembly line balancing model considering idle rate, smoothness, labor cost, and energy consumption" . | EXPERT SYSTEMS WITH APPLICATIONS 250 (2024) . |
| APA | Fathollahi-Fard, Amir M. , Wu, Peng , Tian, Guangdong , Yu, Dexin , Zhang, Tongzhu , Yang, Jianwei et al. An efficient multi-objective adaptive large neighborhood search algorithm for solving a disassembly line balancing model considering idle rate, smoothness, labor cost, and energy consumption . | EXPERT SYSTEMS WITH APPLICATIONS , 2024 , 250 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
为保障突发应急事件下乘客的出行效率与安全，研究一类全新的面向突发应急事件的定制公交线网优化问题，旨在降低乘客出行时间、提高救援效率。首先引入风险系数概念，以描述不同乘客受突发应急事件的影响程度。其次，以所有乘客的出行时间最小化为目标，考虑需求点优先级、车辆容量、车辆到达时间等约束，构建一个混合整数非线性规划模型。同时针对模型特点，设计基于应急服务特点的破坏算子，改进自适应大邻域搜索算法，通过大量仿真算例验证模型与算法的可行性。实验结果表明：求解大规模算例时，改进算法相较于文献中的遗传算法，获取最优解的能力更强，平均节约出行时间1.38%。最后，将常规情境与突发应急事件下的优化方案进行对比，在相同出行需求下，应急定制公交线网优化的总运行时长比常规情况增加9.624 min;高风险需求点接受服务的时间相较于常规情况降低4.5%。与常规情况相比，该模型得到的线网优化方案更能实现乘客安全高效的转移，可为城市应急救援方案提供参考。
Keyword ：
大邻域搜索算法 大邻域搜索算法 定制公交 定制公交 应急交通 应急交通 突发应急事件 突发应急事件 线网优化 线网优化
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 付文涵 , 吴鹏 . 面向突发应急事件的定制公交线网优化研究 [J]. | 交通科技与经济 , 2024 , 26 (03) : 1-9 . |
| MLA | 付文涵 et al. "面向突发应急事件的定制公交线网优化研究" . | 交通科技与经济 26 . 03 (2024) : 1-9 . |
| APA | 付文涵 , 吴鹏 . 面向突发应急事件的定制公交线网优化研究 . | 交通科技与经济 , 2024 , 26 (03) , 1-9 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
This paper addresses a real life scheduling problem characterised by multi-resource operations whose completion simultaneously requires more than one (renewable) resource of different types. Such problems arise in various companies not only in manufacturing but also in services. Solving such a problem needs to address two interconnected subproblems: a sequencing subproblem and a resource-allocation subproblem if more than one resource is available in some types. The resource-allocation subproblem consists of allocating to each operation the resources it requires while the sequencing subproblem consists of determining the order in which each resource performs the operations assigned to it. This paper focuses on the resource-allocation subproblem. It generalises the basic scheduling problems which consist of determining the operations' starting or completion times for a given processing sequence for every resource. We consider a cost function taking into account the makespan, the cost of resource utilisation, and the load imbalance among the resources of the same type. We first formulate the problem into a mixed-integer linear program (MILP). To efficiently solve it, even in practical-sized instances, an exact algorithm called BD (Benders decomposition with enhancing cuts) is developed where the master problem only considers integer variables. We prove that the slave problem can be transformed into finding the longest paths in a digraph and therefore can be solved with the Bellman-Ford algorithm. To enhance the efficiency of the method, equivalent solutions are limited in the master problem. The performance of the approach is evaluated by comparing it against CPLEX, a state-of-the-art commonplace MILP solver, used to directly solve the initial MILP. The computational results demonstrate that BD provides competitive solutions in all upper and lower bounds. In particular, it improves, compared with CPLEX, the upper and lower bounds by 5.07% and 4.63%, respectively, in solving practical-sized instances. The experiment also shows that considering load balancing can make more rational use of resources and avoid adverse effects caused by excessive workload of staff and imbalanced use of equipment, which is very important in real-world production.
Keyword ：
Benders decomposition Benders decomposition load balancing load balancing multi-resource operations multi-resource 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 . A Benders decomposition algorithm for resource allocation with multi-resource operations [J]. | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH , 2024 , 62 (21) : 7981-7997 . |
| MLA | Weng, Wuyan et al. "A Benders decomposition algorithm for resource allocation with multi-resource operations" . | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 62 . 21 (2024) : 7981-7997 . |
| APA | Weng, Wuyan , Chu, Chengbin , Wu, Peng . A Benders decomposition algorithm for resource allocation with multi-resource operations . | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH , 2024 , 62 (21) , 7981-7997 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
This work addresses a new bi-objective parallel machine selection and job scheduling problem with release dates and resource consumption. It consists in optimally selecting subcontractors (machines) from a set of geographically dispersed locations and scheduling the orders (jobs) to the selected subcontractors for processing while meeting the order release dates and resource consumption restrictions, so as to simultaneously minimize the maximum completion time, i.e., the makespan, and the total cost including machine usage cost and resource consumption cost. The problem is first formulated into a bi-objective mixed -integer linear program based on linear ordering (LO-MILP), and then valid inequalities are explored based on property analysis. To solve it, an e -constraint method based on LO-MILP (e-LO-MILP) is first proposed. To more efficiently solve it, we also develop a tailored logic -based Benders decomposition combined with e -constraint method (e-LBBD) where a novel method to obtain a tight lower bound of the identical parallel machine with machine -dependent release dates and some problem -specific cuts are proposed. Numerical experiments on an illustrative example are conducted to show the applicability of the model and algorithm and intuitively reveal the trade-off between production efficiency and cost. Experimental results on 200 instances with up to 100 orders demonstrate that e-LBBD can reduce the computation time by about 28.92% compared to e-LO-MILP and yields better Pareto solutions than e-LO-MILP and the well-known non -dominated sorted genetic algorithm II do.
Keyword ：
Logic-based Benders decomposition Logic-based Benders decomposition Parallel machine Parallel machine Release dates Release dates Resource consumption Resource consumption
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wu, Peng , Wang, Yun , Chu, Chengbin . Logic-based Benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption [J]. | COMPUTERS & OPERATIONS RESEARCH , 2024 , 164 . |
| MLA | Wu, Peng et al. "Logic-based Benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption" . | COMPUTERS & OPERATIONS RESEARCH 164 (2024) . |
| APA | Wu, Peng , Wang, Yun , Chu, Chengbin . Logic-based Benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption . | COMPUTERS & OPERATIONS RESEARCH , 2024 , 164 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
针对制造业和服务业等领域中广泛存在的多资源工序资源分配问题,考虑工件和可移动类资源的运输时间,以最小化最长完工时间为优化目标,构建一类新的资源分配混合整数线性规划模型.针对该问题特性,提出变邻域搜索模拟退火的混合算法.该算法结合变邻域搜索算法局部搜索能力强和模拟退火算法全局寻优的优势,同时克服前者容易陷入局部最优而后者局部收敛不佳的问题.在算法的设计中,引入自适应邻域结构和改进降温函数以提高算法的收敛效率.300 个不同规模的仿真算例实验结果表明,在求解大规模实例中,所提算法的性能均优于CPLEX求解器、变邻域搜索算法和模拟退火算法,能提供更好的资源分配方案.
Keyword ：
变邻域算法 变邻域算法 多资源工序 多资源工序 模拟退火算法 模拟退火算法 资源分配 资源分配 运输时间 运输时间
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 翁武燕 , 储诚斌 , 吴鹏 . 考虑运输时间的多资源工序的资源分配优化 [J]. | 福州大学学报（哲学社会科学版） , 2024 , 38 (4) : 72-80 . |
| MLA | 翁武燕 et al. "考虑运输时间的多资源工序的资源分配优化" . | 福州大学学报（哲学社会科学版） 38 . 4 (2024) : 72-80 . |
| APA | 翁武燕 , 储诚斌 , 吴鹏 . 考虑运输时间的多资源工序的资源分配优化 . | 福州大学学报（哲学社会科学版） , 2024 , 38 (4) , 72-80 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
在货物运输中，除考虑传统的成本目标外，最小化其对环境的影响具有重要的意义。本文研究了一类新的带服务时间窗的绿色公海多式联运多目标优化问题，旨在多式联运网络中决策货物运输路径和速度以满足货物运输需求，目的是同时最小化货物运输总成本和碳排放总量，并建立该问题的多目标混合整数非线性规划模型。为有效求解该问题，将上述非线性模型转化为线性模型，并提出了一种基于ε-约束法和模糊逻辑相结合的算法。最后以我国典型的绿色多式联运问题为例对模型和算法的有效性进行验证。计算结果表明，所提出的模型和算法能够有效求解所提出的带服务时间窗的绿色多式联运多目标优化问题，为决策者在进行绿色多式联运的路径和速度决策时提供参考。
Keyword ：
ε-约束法 ε-约束法 服务时间窗 服务时间窗 绿色多式联运 绿色多式联运 路径优化 路径优化 速度优化 速度优化
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 吴鹏 , 季海涛 , 林峰 et al. 带服务时间窗的绿色多式联运路径和速度多目标优化 [J]. | 运筹与管理 , 2024 , 33 (04) : 35-41 . |
| MLA | 吴鹏 et al. "带服务时间窗的绿色多式联运路径和速度多目标优化" . | 运筹与管理 33 . 04 (2024) : 35-41 . |
| APA | 吴鹏 , 季海涛 , 林峰 , 程俊恒 . 带服务时间窗的绿色多式联运路径和速度多目标优化 . | 运筹与管理 , 2024 , 33 (04) , 35-41 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
应用复杂网络理论,选取网络拓扑特征和度中心性、加权度中心性和介数中心性等指标,搜集2021 年第四季度全球班轮公司的1766 条航线构建航运网络,从海丝核心区航运网络整体连通程度和港口节点在连通海丝沿线航运网络中起到的重要性程度两个维度研究海丝核心区港口的连通性.结果表明,海丝核心区港口与海丝沿线港口有较为频繁的航线往来,厦门港在海丝核心区居于引领地位;海丝核心区港口对海丝沿线港口的航线联系的广度和深度在我国沿海处于中等水平,海丝沿线 7 个区域的航运互联互通对海丝核心区港口的依赖程度存在较大差异.为此,未来航线业务拓展要注重利用枢纽港的辐射效应,重点与连通性强的省份开展港口合作,不断提升海丝核心区的国际影响力.
Keyword ：
海丝核心区建设 海丝核心区建设 港口连通性 港口连通性 省域一体化 省域一体化
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 潘静静 , 吴鹏 , 张炜煌 . 省域一体化背景下海丝核心区港口连通性研究 [J]. | 福建江夏学院学报 , 2024 , 14 (3) : 54-61 . |
| MLA | 潘静静 et al. "省域一体化背景下海丝核心区港口连通性研究" . | 福建江夏学院学报 14 . 3 (2024) : 54-61 . |
| APA | 潘静静 , 吴鹏 , 张炜煌 . 省域一体化背景下海丝核心区港口连通性研究 . | 福建江夏学院学报 , 2024 , 14 (3) , 54-61 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
针对森林火灾发生后可能存在的交通路网受阻情况,探讨一类新的森林火灾应急资源联合调度优化策略,构建了兼顾资源受限和道路受阻的森林火灾应急资源联合调度的混合整数线性规划模型.为减少森林火灾造成的资源损失,优化目标设定为最小化消防救援时间,并且根据问题特性设计两种编码方式的改进人工蜂群算法.最后,通过典型实例和随机仿真算例进行实验验证.实验结果表明:1)对于实际案例和中小规模仿真案例,采用商业求解器CPLEX求解模型,能够在 5 min内获得最优的消防救援方案;2)对于大规模森林火灾,提出的改进人工蜂群算法求解性能优于商业求解器CPLEX,只需 10s就能够获得更高质量的消防救援方案,可为道路受阻下的森林火灾应急救援团队提供有效的消防救援方案.
Keyword ：
人工蜂群算法 人工蜂群算法 森林火灾 森林火灾 线性规划 线性规划 联合调度 联合调度 道路受阻 道路受阻
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 吴鹏 , 王路兵 , 储诚斌 . 考虑道路受阻的森林火灾应急资源联合调度优化研究 [J]. | 工业工程 , 2024 , 27 (4) : 121-131 . |
| MLA | 吴鹏 et al. "考虑道路受阻的森林火灾应急资源联合调度优化研究" . | 工业工程 27 . 4 (2024) : 121-131 . |
| APA | 吴鹏 , 王路兵 , 储诚斌 . 考虑道路受阻的森林火灾应急资源联合调度优化研究 . | 工业工程 , 2024 , 27 (4) , 121-131 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
This paper addresses a resource-allocation problem extracted from real life application involving multi-resource operations. A new mixed integer linear programming model is proposed to minimize the weighted completion time while considering resource-related precedence relationships. Then, a hybrid algorithm combining Benders decomposition and Tabu search is developed based on Benders decomposition as the basic framework. This method divides the original problem into a master problem for resource allocation and a subproblem of calculating the completion time of each operation. The convergence is sped up by improving the mathematical model and embedding the Tabu search approach. The experimental results on 300 randomly generated instances show that when solving small-scale problems, the proposed hybrid algorithm can yield satisfactory solutions with an average deviation of 0.86 % from optimal ones provided by the commercial CPLEX solver; when solving large-scale problems, the proposed algorithm outperforms the CPLEX solver, the pure Tabu search algorithm, the variable neighborhood search algorithm and the Benders decomposition with embedded genetic algorithm. Compared with the CPLEX, the upper bound and lower bound are improved by 4.74% and 9.62% respectively. © 2024 Northeast University. All rights reserved.
Keyword ：
Benders decomposition Benders decomposition multi-resource operation multi-resource operation resource allocation resource allocation Tabu search Tabu search the resource-related precedence relationships the resource-related precedence relationships
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Weng, W.-Y. , Chu, C.-B. , Wu, P. . Resource allocation to minimize the weighted completion time with multiresource operations; [极小化加权完工时间的多资源工序的资源分配问题] [J]. | Control and Decision , 2024 , 39 (8) : 2765-2772 . |
| MLA | Weng, W.-Y. et al. "Resource allocation to minimize the weighted completion time with multiresource operations; [极小化加权完工时间的多资源工序的资源分配问题]" . | Control and Decision 39 . 8 (2024) : 2765-2772 . |
| APA | Weng, W.-Y. , Chu, C.-B. , Wu, P. . Resource allocation to minimize the weighted completion time with multiresource operations; [极小化加权完工时间的多资源工序的资源分配问题] . | Control and Decision , 2024 , 39 (8) , 2765-2772 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
