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

Tactical vessel deployment and empty container repositioning considering container turnover times

COMPUTERS & INDUSTRIAL ENGINEERING 2024年 190卷

作者： Xiang, Xi Liu, Changchun Jia, Shuai Beijing Inst Technol Sch Mech Engn Beijing 100081 Peoples R China Natl Univ Singapore Inst Operat Res & Analyt Singapore 117602 Singapore Hong Kong Univ Sci & Technol Guangzhou Thrust Intelligent Transportat Guangzhou 511453 Peoples R China Hong Kong Univ Sci & Technol Dept Civil & Environm Engn Hong Kong Peoples R China

Global trade imbalances lead to the common occurrence of empty container flows from export -dominated to import -dominated ports in container shipping networks. Efficient strategies for repositioning empty containers are essential for addressing deficits at major ports. Existing studies often assume an arbitrary supply of empty containers at a port before repositioning. However, the actual quantity depends on laden containers shipped and turnover times. Considering this interdependence is crucial for reliable repositioning plans, especially at the tactical planning level. This paper explores an integrated problem of vessel deployment and empty container repositioning, aiming to deploy vessels along a route and periodically reposition empty containers, accounting for turnover times. We present an integer programming model minimizing operational and container shortage costs. A novel branchand -price algorithm is developed, efficiently solving the master problem at each branching tree node using a novel approach that combines column generation and Lagrangian relaxation. Performance evaluation and computational experiments on instances generated from container port turnover statistics and shipping line operational data demonstrate the algorithm's efficacy. The study highlights the impact of container turnover times on repositioning decisions, emphasizing the need for a comprehensive understanding of this dynamic in strategic planning.

关键词： Maritime shipping Vessel deployment Empty container repositioning Container turnover times branch-and-price algorithm

来源：评论

学校读者我要写书评

暂无评论

Passenger-oriented rolling stock scheduling in the metro system with multiple depots: Network flow based approaches

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2024年 180卷

作者： Wang, Entai Yang, Lixing Yin, Jiateng Zhang, Jinlei Gao, Ziyou Beijing Jiaotong Univ Sch Syst Sci Beijing 100044 Peoples R China Beijing Jiaotong Univ State Key Lab Adv Rail Autonomous Operat Beijing 100044 Peoples R China

This study investigates a rolling stock scheduling problem on a metro line with multiple depots. Two novel optimization models, i.e., an arc -based and a path -based network -flow models, are formulated with the aim of improving the service level and reducing the operation cost simultaneously, in which the flexible train composition mode is also taken into consideration to well match the transport capacity and time -varying passenger demand. To solve the proposed models, a branch -and -price (B&P) approach is designed to find the near optimal operation schemes, in which the column generation is used to solve the relaxed problem at each node of the searching tree, where a dynamic programming approach is embedded to solve the pricing sub -problem associated with each depot to generate promising paths (columns) for each rolling stock unit, and then the branch -and -bound (B&B) procedure is incorporated to find integral solutions. To test the performance of the proposed approaches, a series of numerical experiments are conducted both on small-scale and real -life cases of the Beijing metro Batong line with historically recorded passenger data. The computation results have verified the improved operational efficiency and a better service level of the solutions found by our proposed approaches.

关键词： Passenger-oriented train operation Flexible train compositions Rolling stock scheduling Column generation branch-and-price algorithm

来源：评论

学校读者我要写书评

暂无评论

Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost

引用

OR SPECTRUM 2025年第1期47卷 129-176页

作者： Li, Kai Xie, Fulong Chen, Jianfu Xiao, Wei Zhou, Tao Hefei Univ Technol Sch Management Hefei 230009 Peoples R China Minist Educ Key Lab Proc Optimizat & Intelligent Decis Making Hefei 230009 Peoples R China Hohai Univ Business Sch Nanjing 211100 Peoples R China

This paper investigates unrelated parallel machine scheduling problems, considering machine- and sequence-dependent family setup times and machine usage costs to minimise the sum of the total weighted completion time and the total machine usage cost. The machine usage cost consists of a fixed cost and a variable cost proportional to the processing times of jobs. These features align with numerous real-world applications that include machine usage costs, for example, rental fees when customers rent machines via a cloud manufacturing platform. To address the problem, five integer programming models are developed from different perspectives. Afterwards, a modified branch-and-price algorithm (B&P) based on the set-partitioning model is proposed. To enhance the performance of B&P, we introduce two dynamic programming algorithms and a heuristic pricing algorithm, and the initial solution is generated by an improved variable neighbourhood search algorithm. Extensive experimental results show that the proposed B&P outperforms state-of-the-art mathematical models and algorithms. Notably, B&P can optimally solve instances with up to 10 machines, 100 jobs, and 12 families within half an hour. Interestingly, experimental results also show that the B&P performs significantly better when total completion time is dominated by the total variable cost of machine usage.

关键词： Scheduling Unrelated parallel machines Family setup times Machine cost branch-and-price algorithm

来源：评论

学校读者我要写书评

暂无评论

Electric bus charging scheduling on a bus network

引用

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2024年 161卷

作者： Zhou, Yu Meng, Qiang Ong, Ghim Ping Wang, Hua Beihang Univ Sch Transportat Sci & Engn Beijing 100191 Peoples R China Beihang Univ Sch Transportat Sci & Engn Key Lab Intelligent Transportat Technol & Syst Minist Educ Beijing 100191 Peoples R China Natl Univ Singapore Dept Civil & Environm Engn Singapore 117576 Singapore Hefei Univ Technol Sch Automot & Transportat Engn Hefei 230009 Peoples R China

This study addresses the electric bus charging scheduling problem (EBCSP) within a bus network comprising multiple bus routes, depots, and a fleet of heterogeneous electric buses (EBs) operated by a public transport (PT) operator. The EBCSP aims to minimize total costs by concurrently determining the assignment of EBs to trips(i.e., EB-to-trip assignment) and their corresponding charging schedules. A partial charging policy allows for flexible charging durations, considering a published timetable consisting of trip tasks. We formulate the EBCSP as a mixed-integer linear programming model and a set-covering formulation. For small-scale EBCSPs, we propose a branch-and-price algorithm utilizing the set-covering formulation for exact solutions. As large-scale EBCSPs pose computational challenges, we develop an optimizationbased adaptive large neighborhood search ( opt -ALNS) method. The opt -ALNS method employs ALNS operators for EB-to-trip assignment and solves the remaining linear programming problem efficiently. To enhance the opt -ALNS process, we introduce a labeling method to assess solution feasibility and rebuild solutions. Moreover, we incorporate EB battery degradation effects into the proposed method. Finally, we assess the performance of the opt -ALNS method on real-life instances and compare it with the branch-and-price algorithm.

关键词： Electric bus charging scheduling Bus network Mixed-integer linear programming model Set-covering model branch-and-price algorithm Adaptive large neighborhood search method Battery degradation

来源：评论

学校读者我要写书评

暂无评论

algorithms for the bin packing problem with scenarios

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2024年第4期48卷 1-28页

作者： Borges, Yulle G. F. de Lima, Vinicius L. Miyazawa, Flavio K. Pedrosa, Lehilton L. C. de Queiroz, Thiago A. Schouery, Rafael C. S. Univ Estadual Campinas Inst Comp Campinas SP Brazil Fed Univ Catalao Inst Math & Technol Catalao GO Brazil

This paper presents theoretical and practical results for the bin packing problem with scenarios, a generalization of the classical bin packing problem which considers the presence of uncertain scenarios, of which only one is realized. For this problem, we propose approximation algorithms whose ratios are bounded by the square root of the number of scenarios times the approximation ratio for an algorithm for the vector bin packing problem. We also show how an asymptotic polynomial-time approximation scheme is derived when the number of scenarios is constant, that is, not a part of the input. As a practical study of the problem, we present a branch-and-price algorithm to solve an exponential set-cover model and a variable neighborhood search heuristic. Experiments show the competence of the branch-and-price in obtaining optimal solutions for about 59% of the instances considered, while the combined heuristic and branch-and-price optimally solved 62% of the instances considered.

关键词： Bin packing problem Scenarios Approximation algorithm Variable neighborhood search branch-and-price algorithm

来源：评论

学校读者我要写书评

暂无评论

A branch-and-price Framework for Decomposing Graphs into Relaxed Cliques

引用

INFORMS JOURNAL ON COMPUTING 2021年第3期33卷 1070-1090页

作者： Gschwind, Timo Irnich, Stefan Furini, Fabio Calvo, Roberto Wolfler Johannes Gutenberg Univ Mainz Gutenberg Sch Management & Econ Dept Logist Management D-55122 Mainz Germany Tech Univ Kaiserslautern Dept Business Studies & Econ Chair Logist D-67663 Kaiserslautern Germany Consiglio Naziona Ric IASI CNR Ist Anal Sistemi Informat Antonio Ruberti I-00185 Rome Italy Univ Sorbonne Paris Nord LIPN CNRS UMR 7030 F-93430 Villetaneuse France Univ Cagliari Dept Math & Comp Sci I-09124 Cagliari Italy

We study the family of problems of partitioning and covering a graph into/with a minimum number of relaxed cliques. Relaxed cliques are subsets of vertices of a graph for which a clique-defining property-for example, the degree of the vertices, the distance between the vertices, the density of the edges, or the connectivity between the vertices-is relaxed. These graph partitioning and covering problems have important applications in many areas such as social network analysis, biology, and disease-spread prevention. We propose a unified framework based on branch-and-price techniques to compute optimal decompositions. For this purpose, new, effective pricing algorithms are developed, and new branching schemes are invented. In extensive computational studies, we compare several algorithmic designs, such as structure-preserving versus dichotomous branching, and their interplay with different pricing algorithms. The final chosen branch-and-price setup produces results that demonstrate the effectiveness of all components of the newly developed framework and the validity of our approach when applied to social network instances.

关键词： graph decomposition clique relaxations branch-and-price algorithm social networks

来源：评论

学校读者我要写书评

暂无评论

Improved benders-and-price algorithm for the multi-product assembly routing problem with time windows: A domain decomposition strategy for the benders-master model

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2023年 186卷

作者： Chi, Jushang He, Shiwei Beijing Jiaotong Univ Key Lab Transport Ind Big Data Applicat Technol Co Beijing Peoples R China

To meet the optimization requirements of many-to-one assembly systems comprising a plant and multiple suppliers, the multi-product assembly routing problem with time windows (MPARPTW) is investigated in this study. Besides optimizing the assembly of different types of products in a plant to satisfy the periodic market demand within a specific planning horizon, MPARPTW factors in the vehicle routes for collecting many components from suppliers to meet the inventory requirements that are imposed by the production. The MPARPTW is formulated as a mixed-integer linear programming model to minimize the setup, production, transportation, and inventory costs. The model is solved using an improved Benders-and-price algorithm that combines Benders decomposition and branch-and-price algorithm. The MPARPTW model is decomposed into a lot-sizing Benders master (BM) model and a vehicle-routing Benders-sub (BS) model. A domain decomposition strategy is developed in this study to further decompose the BM model, thereby generating Benders cuts efficiently and increasing the convergence speed. Numerical experiments are designed to test the performance of the proposed algorithm. Within a limited maximum computing time (compared with the off-the-shelf solver), the improved algorithm reduces the average cost and computing time by 0.6% and 59.3%, respectively. The significance of the proposed model and algorithm in determining the plant investment directions is demonstrated. Moreover, compared with the conventional algorithm, the improved algorithm exhibits overall improvements. In large-scale instances, the cost is reduced by 1.8% on average and 4.2% maximum. The computing time yields average and maximum reductions of 35.2% and 76.0%, respectively.

关键词： Assembly routing problem Benders decomposition branch-and-price algorithm Domain decomposition

来源：评论

学校读者我要写书评

暂无评论

A branch-and-price method for a two-echelon location routing problem with recommended satellites

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2023年 184卷

作者： Tian, Xi-Dan Hu, Zhi-Hua Shanghai Maritime Univ Logist Res Ctr Shanghai 200135 Peoples R China

In city logistics, the two-echelon location routing problem is crucial in coordinating resources and radiating nodes, enabling the efficient planning of relay stations and vehicle distribution routes. However, with the expansion of distribution scopes and changes in urban development, fixed relay stations may not be able to adapt to the evolving network demand structure, leading to reduced efficiency. This paper proposes a two-echelon location routing problem with recommended satellites (2E-LRPRS) to address this issue. These satellites are chosen from the customer set and can be reoptimized to enhance the network's adaptability. A mixed-integer linear program (MILP) is formulated to minimize the distribution cost of the two-echelon network. To solve this problem, a column-generation algorithm (CG) is proposed, which decomposes the original problem into a linear relaxation main problem and a series of two-stage shortest-path subproblems with resource constraints. The branch-and-pricing algorithm (B&P) is then designed to obtain the integer solution. The experimental results demonstrate that the proposed B&P is significantly more efficient and effective than the MILP solver - Cplex. Furthermore, by selecting relay stations from customers, the recommended satellites can be flexibly adjusted based on the locations and demands of distribution customers, leading to an average operating cost savings of 8.43%.

关键词： Logistics Two-echelon location routing problem Recommended satellites Column generation branch-and-price algorithm

来源：评论

学校读者我要写书评

暂无评论

Pickup capacitated vehicle routing problem with three-dimensional loading constraints: Model and algorithms

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2023年第1期176卷

作者： Chi, Jushang He, Shiwei Beijing Jiaotong Univ Key Lab Transport Ind Big Data Applicat Technol Co Beijing Peoples R China

This study addresses the pickup capacitated vehicle routing problem with three-dimensional loading constraints (3L-PCVRP), which combined the container loading problem (CLP) and the capacitated vehicle routing problem (CVRP). A mixed-integer linear programming model for 3LPCVRP is designed with the objective of minimizing the total transportation cost. The basic constraints of CLP and CVRP as well as the practical constraints imposed by the pickup operations are incorporated in 3L-PCVRP. An improved branch-and-price-based (B & P) algorithm is proposed to solve 3L-PCVRP. The 3L-PCVRP model is decomposed into the restricted master problem (RMP) for selecting routes and the subproblem (SP) for generating routes that satisfy the loading and routing constraints. A label-correcting-based algorithm (LCA) is presented to solve the SP, which employs a two-stage method and two enhanced loading algorithms to ensure the loading feasibility of the routes. The two loading algorithms (tree search and greedy heuristic algorithms) are improved by a new evaluation function and an improved space-merging method. The twostage method is designed to call the two loading algorithms at different frequencies to investigate the route feasibility accurately and efficiently. Numerical experiments are designed to test the performance of the proposed algorithms. The efficiency and effectiveness of the improved loading algorithms are demonstrated in hundreds randomly generated instances. For small-scale 3L-PCVRP instances, the B & P algorithm can generate solutions that are not worse than those of the solver within 0.14% of the solver's running time. The efficiency and effectiveness of the improved B & P algorithm are also validated in large-scale benchmark instances.

关键词： Three-dimensional loading Routing Pickup operation Loading algorithm branch-and-price algorithm

来源：评论

学校读者我要写书评

暂无评论

An exact method for vehicle routing problem with backhaul discounts in urban express delivery network

引用

CLEANER LOGISTICS AND SUPPLY CHAIN 2024年 11卷

作者： Zhao, Jinqiu Liu, Yongwu Zhang, Jinwei Zhang, Jing Huang, Yixiao Yu, Le Xie, Binglei Harbin Inst Technol Shenzhen Sch Architecture Shenzhen 518000 Guangdong Peoples R China Hong Kong Polytech Univ Dept Aeronaut & Aviat Engn Hong Kong 999077 Peoples R China Southern Power Grid Supply Chain Grp Co Ltd Guangzhou 511466 Guangdong Peoples R China Liaoning Tech Univ Sch Software Huludao 125000 Liaoning Peoples R China SF Express Grp Co Ltd Shenzhen 518000 Guangdong Peoples R China Shenzhen Technol Univ Coll Urban Transportat & Logist Shenzhen 518000 Guangdong Peoples R China

The surge in e -commerce has led to an increased demand for urban express services, requiring the strategic development of delivery networks that are both efficient and cost-effective. This study addresses a practical vehicle routing problem (VRP) in an urban express delivery network to minimize transportation costs. Specifically, it considers the implementation of backhaul discounts, a factor disregarded in the existing literature. This VRP is further complicated by various realistic constraints, including pickup and delivery, time windows, multiple trips, heterogeneous fleets, and docking capacity limitations, which make most general VRP solvers inapplicable. This study proposes a trip-based formulation to overcome this challenge and develop a tailored branchand-price algorithm. Feasible trips are classified into four types to simplify the computation of backhaul discounts, thereby enhancing solution efficiency. Validation with real-world data from SF Express substantiates the efficacy of our method and yields insights for sustainable city logistics management. Moreover, our simplified column generation algorithm exhibits competitive performance, achieving optimal solutions expeditiously for the tested instances.

关键词： Vehicle routing Backhaul discounts Pickup and delivery Multiple trips branch-and-price algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：