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

An integer programming approach to the bloodmobile routing problem

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2016年第Feb.期86卷 94-115页

作者： Gunpinar, Serkan Centeno, Grisselle Univ S Florida Dept Ind & Management Syst Engn 4202 E Fowler Ave Tampa FL 33620 USA

Every day, a blood center must determine a set of locations among a group of potential sites to route their vehicles for blood collection so as to avoid shortfalls. In this study, a vehicle routing problem is modeled using an integer programming approach to simultaneously identify number of bloodmobiles to operate and minimize the distance travelled. Additionally, the model is extended to incorporate uncertainty in blood potentials and variable durations in bloodmobile visits. Optimal routings are determined using CPLEX solver and branch-and-price algorithm. Results show that proposed algorithm solve the problem to optimality up to 30 locations within 3600 s. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Vehicle routing problem Health care application Mobile blood collection branch-and-price algorithm Robust optimization Operations research

来源：评论

学校读者我要写书评

暂无评论

Capacity expansion strategies for electric vehicle charging networks: Model, algorithms, and case study

引用

NAVAL RESEARCH LOGISTICS 2022年第3期69卷 442-460页

作者： Chen, Qianqian Huang, Kai Ferguson, Mark R. McMaster Univ Sch Computat Sci & Engn Hamilton ON Canada McMaster Univ DeGroote Sch Business Hamilton ON L8S 4M4 Canada McMaster Univ McMaster Inst Transportat & Logist Hamilton ON Canada

Governments in many jurisdictions are taking measures to promote the use of electric vehicles. As part of this goal, it is crucial to provide a sufficient number of charging stations to alleviate drivers' anxieties associated with the range of the vehicle. The goal of this research is to help governments develop vehicle charging networks for public use via the application of multistage stochastic integer programming model that determines both the locations and capacities of charging facilities over finite planning horizons. The logit choice model is used to estimate drivers' choices of nearby charging stations. Moreover, we characterize the charging demand as a function of the charging station quantity to reflect the range anxiety of consumers. The objective of the model is to minimize the expected total cost of installing and operating the charging facilities. An approximation algorithm, a heuristic algorithm, and a branch-and-price algorithm are designed to solve the model. We conduct numerical experiments to test the efficiency of these algorithms. Importantly, each algorithm has advantages over the CPLEX MIP solver. Finally, the City of Oakville in Ontario, Canada, is used to demonstrate the effectiveness of this model.

关键词： branch-and-price algorithm capacity expansion charging networks electric vehicle facility location logit choice model multistage stochastic integer programming

来源：评论

学校读者我要写书评

暂无评论

Directed weighted improper coloring for cellular channel allocation

引用

DISCRETE APPLIED MATHEMATICS 2015年 182卷 46-60页

作者： Archetti, Claudia Bianchessi, Nicola Hertz, Alain Colombet, Adrien Gagnon, Francois Univ Brescia Dept Quantitat Methods Brescia Italy Univ Brescia Dept Informat Engn Brescia Italy Ecole Polytech Dept Math & Ind Engn Montreal PQ H3C 3A7 Canada Ecole Hautes Etud Commerciales Gerad Montreal PQ Canada Ecole Technol Super Dept Elect Engn Montreal PQ Canada

Given a directed graph with weights on the vertices and on the arcs, a theta-improper k-coloring is an assignment of at most k different colors to the vertices of G such that the weight of every vertex nu is greater, by a given factor 1/theta, than the sum of the weights on the arcs (u, nu) entering nu with the tail u of the same color as nu. For a given real number theta, we consider the problem of determining the minimum integer k such that G has a theta-improper k-coloring. Also, for a given integer k, we consider the problem of determining the minimum real number 0 such that G has a theta-improper k-coloring. We show that these two problems can be used to model channel allocation problems in wireless communication networks, when it is required that the power of the signal received at a base station is greater, by a given factor, than the sum of interfering powers received from mobiles which are assigned the same channel. We propose set partitioning formulations for both problems and describe branch-and-price algorithms to solve them. Computational experiments are reported for instances having a similar structure as real channel allocation problems. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Graph coloring Weighted directed graphs Channel assignment Set partitioning formulations branch-and-price algorithm

来源：评论

学校读者我要写书评

暂无评论

Suburban Demand Responsive Transit Service With Rental Vehicles

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2021年第4期22卷 2391-2403页

作者： Zhang, Li Chen, Tingting Yu, Bin Wang, Chenyu Beihang Univ Sch Transportat Sci & Engn Beijing 100191 Peoples R China Beijing Jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China Beihang Univ BDBC Beijing 100191 Peoples R China Eindhoven Univ Technol Dept Urban Sci & Syst NL-5600 Eindhoven Netherlands

Demand responsive transit (DRT) services in suburban regions serve residents as the complements of the public transportation. Since suburban DRT service usually faces demand fluctuation in some special situations, such as terrible weather, DRT operators have recourse to temporal rental vehicles to satisfy all requests. There are two types of rental contracts. In the first case, the costs of rental vehicles are similar to the costs of owned vehicles, and the multi-trip vehicle routing problem is studied. In the second case, the costs of outbound trips are not covered by DRT companies, and the open vehicle routes are introduced. In this paper, a mixed integer linear programming formulation is proposed to model the route optimization problem of the suburban DRT service, in which the number of rental vehicles and two classes of routes should be decided simultaneously. To solve the proposed model, a branch-and-price algorithm is designed, which has two pricing subproblems to generate two classes of routes, respectively. From the results of experiments, it can be found that the service sequence is introduced, when open routes are involved. Renting vehicles can help DRT companies save operational costs even in daily operations.

关键词： Companies Routing Heuristic algorithms Analytical models Public transportation Pricing Contracts Demand responsive transit rental vehicle multi-trip vehicle routing problem open vehicle routing problem branch-and-price algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Incomplete Service and Split Deliveries in a Routing Problem with Profits

引用

NETWORKS 2014年第2期63卷 135-145页

作者： Archetti, Claudia Bianchessi, Nicola Speranza, M. Grazia Hertz, Alain Univ Brescia Dept Quantitat Methods Brescia Italy Ecole Polytech Dept Math & Ind Engn Montreal PQ H3C 3A7 Canada HEC Gerad Montreal PQ Canada

In this article, we study a variant of the capacitated team orienteering problem, that is the problem where a fleet of vehicles, each with a constraint on the time available, is given to serve profitable customers with the objective of maximizing the collected profit. We study the variant where customers may be only partially served (incomplete service) and, if beneficial, also by more than one vehicle (split deliveries). We will analyze the maximum theoretical increase of the profit due to the incomplete service and to the split deliveries. We also computationally measure such increase on a set of instances, by means of an exact algorithm on small/medium size instances and of two heuristics on instances of larger size. (c) 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(2), 135-145 2014

关键词： routing problems with profits worst-case analysis branch-and-price algorithm tabu search split delivery

来源：评论

学校读者我要写书评

暂无评论

Designing two-echelon supply networks

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2007年第2期178卷 449-462页

作者： Romeijn, H. Edwin Shu, Jia Teo, Chung-Piaw Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA Wayne State Univ Dept Ind & Mfg Engn Detroit MI 48202 USA Natl Univ Singapore & Singapore MIT Alliance Sch Business Dept Decis Sci Singapore Singapore

A modern distribution network design model needs to deal with the trade-offs between a variety of factors, including (1) location and associated (fixed) operating cost of distribution centers (DCs), (2) total transportation costs, and (3) storage holding and replenishment costs at DCs and retail outlets. In addition, network design models should account for factors such as (4) stockouts, by setting appropriate levels of safety stocks, or (5) capacity concerns, which may affect operating costs in the form of congestion costs. The difficulty of making such trade-offs is compounded by the fact that even finding the optimal two-echelon inventory policy in a fixed and uncapacitated distribution network is already a hard problem. In this paper, we propose a generic modeling framework to address these issues that continues and extends a recent stream of research aimed at integrating insights from modern inventory theory into the supply chain network design domain. Our approach is flexible and general enough to incorporate a variety of important side constraints into the problem. (c) 2006 Elsevier B.V. All rights reserved.

关键词： facility location network design integrated transportation and inventory optimization 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：