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

Step cost functions in a fleet size and mix vehicle routing problem with time windows

ANNALS OF OPERATIONS RESEARCH 2022年第2期316卷 1013-1038页

作者： Manguino, Joao L. V. Ronconi, Debora P. Univ Sao Paulo Dept Prod Engn Ave Luciano Gualberto 1380Cidade Univ BR-05508010 Sao Paulo SP Brazil

The vehicle routing problem is a traditional combinatorial problem with practical relevance for a wide range of industries. In the literature, several specificities have been tackled by dedicated methods in order to better reflect real-world situations. Following this trend, this article addresses the fleet size and mix vehicle routing problem with time windows in which companies hire a third-party logistics company. The shipping charges considered in this work are calculated using step cost functions, in which values are determined according to the type of vehicle and the total distance traveled, with fixed values for predefined distance ranges. A mixed integer linear programming model is introduced and two sequential insertion heuristics are proposed. The introduced methods are examined through a computational comparative analysis in small-sized instances with known optimal solution, 168 benchmark instances from the literature, and 3 instances based on a real-world problem from the civil construction industry. The numerical experiments show that the proposed methods are efficient and show good performance in different scenarios.

关键词： Vehicle routing problem Heterogeneous fleet Time windows Step cost functions mixed integer programming model Heuristics

来源：评论

学校读者我要写书评

暂无评论

Two-machine job shop problem for makespan minimization under availability constraint

引用

IFAC-PapersOnLine 2016年第28期49卷 132-137页

作者： Benttaleb, Mourad Hnaien, Faicel Yalaoui, Farouk ICD-LOSI Université de Technologie de Troyes UMR CNRS 6281 12 Rue Marie Curie Troyes CedexCS 42060-10004 France

We treat a two-machine job shop scheduling problem with availability constraint on one machine to minimize the makespan. We consider the deterministic case where the unavailability period, corresponding to preventive maintenance tasks, is known in advance and fixed. We assume that jobs are non-preemptive. First, two mixed-integer programming (MIP) models are first presented. Some propositions concerning the optimality of Jackson's algorithm when availability constraint exists is provided. Then a branch and bound (B&B) method is developed to solve the problem. The obtained results prove the efficiency of the proposed B&B. © 2016

关键词： Job shop scheduling Availability Branch and bound method integer programming Machine shops Preventive maintenance Problem solving Scheduling Availability constraints bound Branch Job shop scheduling problems Makespan minimization mixed integer programming mixed integer programming model Unavailability periods

来源：评论

学校读者我要写书评

暂无评论

models for the single product disassembly lot sizing problem with disposal

引用

IFAC-PapersOnLine 2019年第13期52卷 547-552页

作者： Pour Massahian Tafti, M. Godichaud, M. Amodeo, L. ICD-LOSI University of Technology of Troyes France

This paper considers a single product disassembly lot sizing problem with disposal decision (DLSPD) in order to reduce the costs as well as environmental impacts related to returned products. This is the problem of determining the quantity and time of the returned products to be disassembled while satisfying the demand of their parts or components over a planning horizon. Due to the existence of yield (in a disassembly system) and demand, which are not well balanced during planning horizon, surplus inventory of leaf items will be conducted. The integer programming (IP) can be used to arrive at optimal solution, with the disadvantage that the computational time explodes with increasingly complex product structure and larger size of problem. In this case, LP relaxation approach can be useful. Two integer programming models (aggregate formulation (AGG) and disaggregate formulation (FAL)) with considering disposal decision are developed to cope with the unnecessary surplus inventory. This paper focus on the problem with no capacity restriction on disassembly resource, and single product type with two-level product structure. The computation experiments are conducted to evaluate the performance of proposed models using CPLEX solver for different generated instance sizes. For large-sized problem, LP relaxation approach is suggested and compared with integer/optimal solution to show its effectiveness. The LP relaxation gives a strong lower bound (LB) for the proposed mixed-integer programming models. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： integer programming Environmental impact Waste disposal Capacity restriction Disassembly systems integer programming models Inventory Lot sizing mixed integer programming (MIP) mixed integer programming model Reverse logistics

来源：评论

学校读者我要写书评

暂无评论

Mathematical models for a flexible job shop scheduling problem with machine operator constraints

引用

IFAC-PapersOnLine 2019年第13期52卷 94-99页

作者： Kress, Dominik Müller, David University of Siegen Management Information Science Kohlbettstraße 15 Siegen57068 Germany

We consider a flexible job shop scheduling problem that incorporates machine operators and aims at makespan minimization. In a detailed overview of the related literature, we reveal the fact that the research in this field is mainly concerned with (meta-)heuristic approaches. Only few papers consider exact approaches. In order to promote the use of exact approaches and in order to facilitate the evaluation of the performance of heuristic approaches, we present two mathematical models, a mixed-integer programming model and a constraint programming model, that are analyzed and compared with a state-of-the-art heuristic in computational tests with a standard solver. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Job shop scheduling Constraint theory Heuristic methods Heuristic programming integer programming Machine shops Mathematical operators Scheduling Constraint programming Constraint programming model Flexible job shops Flexible job shop scheduling problem Makespan minimization mixed integer programming mixed integer programming model Workforce constraints

来源：评论

学校读者我要写书评

暂无评论

A Piecewise Linear model for Stochastic Disassembly Line Balancing

引用

IFAC-PapersOnLine 2016年第12期49卷 932-937页

作者： Altekin, F. Tevhide School of Management Sabanci University Orhanli Tuzla Istanbul34956 Turkey

Disassembly lines are used so as to recover both economic and ecological value residing in collected end-of-life products while meeting environmental legislation. Due to the nature of the disassembly operations, disassembly tasks exhibit higher levels of uncertainty. So as to incorporate the variability in task times while designing disassembly lines, this paper deals with the stochastic disassembly line balancing problem with the objective of minimizing the number of stations. Task times are assumed to be normally distributed random variables with known means and standard deviations. A chance-constrained piecewise-linear mixed integer programming model is proposed. The computational experiments using the cell phone problem demonstrate that the proposed model can yield on average 2% improvements compared to a stochastic station oriented ranked positional heuristic. © 2016

关键词： Stochastic models integer programming Mobile phones Normal distribution Piecewise linear techniques Stochastic systems Disassembly Disassembly line balancing Distributed random variables Environmental legislations Line balancing mixed integer programming model Piecewise linear modeling Stochastic task

来源：评论

学校读者我要写书评

暂无评论

Hybrid flowshop scheduling with setup times for cold treating process in Baoshan Iron & Steel Complex

Hybrid flowshop scheduling with setup times for cold treatin...

引用

International Conference on Logistics Systems and Intelligent Management

作者： Li, Lin Wang, Lele Huo, Jiazhen Tongji Univ Sch Econ & Management Shanghai 200092 Peoples R China Tongji Univ Dept Math Shanghai 200092 Peoples R China

ISBN: (纸本)9781424473281

Seamless steel tube, including multi-variety and multi-specification products, requires variously complicated operations in the whole production process, especially in the cold treating process (CTP). This paper takes the seamless tube plant of Baoshan Iron and Steel Complex as the research background. Considering the practical production constraints, CTP scheduling problem can be viewed as a hybrid flowshop scheduling problem with sequence-dependent setup time. We formulate it as a non-linear mixed integer programming model(NMIP) with multi-objectives. Then a two-stage heuristic algorithm based on modified GA and local search method is proposed to get near-optimal solution of large-scale NMIP problem. Finally, computation experiments with real production instance are carried out to test the efficiency and performance of algorithm. The simulation results show that proposed model and algorithm can be implemented as an effective method to generate optimized scheduling scheme in the CTP scheduling system.

关键词： Cold treating Process Seamless Steel Tube Production Hybrid Fowshop Scheduling Sequence-dependent Setup Time mixed integer programming model Two-stage Algorithm

来源：评论

学校读者我要写书评

暂无评论

The Single Polybag Loading Problem

引用

Electronic Notes in Discrete Mathematics 2018年 69卷 69-76页

作者： Che, Yuxin Liu, Ying Gao, Qiang Lim, Andrew Hu, Qian Department of Computer Science Xiamen University Xiamen China School of Management and Engineering Nanjing University Nanjing China Big Data Center Suning Commerce Group Co. Ltd. Nanjing China Department of Industrial System Engineering and Management National University of Singapore Singapore

In the logistics industry, not only cartons but also polybags are used to pack goods for delivery. We study a single polybag loading problem, which is faced by many e-retailers and courier companies. In the problem, a set of rotatable boxes and a two-dimensional rectangular polybag are given. Because the polybag is flexible, the three-dimensional space inside the polybag can be variable when the boxes are loaded. The problem is to choose a subset of the boxes and pack them orthogonally into the polybag so as to maximize the space utilization. We introduce a mixed integer programming formulation and propose a tree search heuristic for the problem. Methods are evaluated by computational experiments on randomly generated data. © 2018 Elsevier B.V.

关键词： heuristic mixed integer programming model Packing polybag packing single polybag loading problem

来源：评论

学校读者我要写书评

暂无评论

Development of a Novel Resource-Constrained Crossdocking model for the Truck Scheduling Problem

Development of a Novel Resource-Constrained Crossdocking Mod...

引用

15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Shakeri, Mojtaba Low, Malcolm Yoke Hean Lee, Eng Wah Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

ISBN: (纸本)9781424468508

Crossdocking is a warehousing strategy that moves products through flow consolidation centers or crossdocks without putting them into storage. To address various decision problems associated with crossdocking operations planning and scheduling, a careful modeling of the entire crossdocking operation is a prerequisite. This paper describes the development of a novel resource-constrained crossdocking model to address an important crossdocking planning problem which is the scheduling of trucks at crossdocking terminals. A mixed integer programming (MIP) model is proposed to formulate the truck scheduling problem. For the lack of real test data, the procedure of generating synthetic data is discussed and its compatibility to real-world applications is justified. The paper also discusses whether the crossdock capacity is a bottleneck resource in the operation of truck scheduling or not. The steps mentioned above build a realistic reliable framework to design and evaluate various sort of algorithms for this combinatorial optimization problem as our future work.

关键词： bottleneck resource combinatorial mathematics combinatorial optimization problem crossdock capacity crossdocking operation planning flow consolidation integer programming mixed integer programming model planning resource constrained crossdocking planning model scheduling synthetic data generation transportation truck scheduling problem

来源：评论

学校读者我要写书评

暂无评论

Algorithms for Scheduling Problem with Different Deterioration Jobs under Depending on Waiting Times 6

Algorithms for Scheduling Problem with Different Deteriorati...

引用

6th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Wu, Huaping Huang, Min Chongqing Univ Technol Chongqing 400054 Peoples R China Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Liaoning Peoples R China Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110819 Liaoning Peoples R China

ISBN: (纸本)9781479983537

In this paper, a single machine scheduling problem with deterioration jobs is investigated. It focuses on considering a new deterioration model and different deterioration rates for minimizing the makespan. Firstly, a mixed integer programming model for the scheduling problem is presented. Secondly, according to characteristics of the problem, dominance properties and lower bounds are proposed and integrated into the Branch and Bound algorithm (B&B). Thirdly, for solving a large-scale problem, the heuristic algorithm is proposed. The numerical experiments show that when the size of the problem is small, the B&B algorithm can obtain the optimal solutions in a reasonable time. ILOG CPLEX can also obtain the optimal solutions of the problem when the size of the problem is medium. A heuristic algorithm can obtain good near-optimal solutions in no more than 1s. The results of numerical experiments show that model, B&B and the heuristic algorithm are effective.

关键词： Single machine Deterioration model mixed integer programming model CPLEX Heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Process Optimization for Cutting Steel-Plates 6

Process Optimization for Cutting Steel-Plates

引用

6th International Conference on Operations Research and Enterprise Systems (ICORES)

作者： Rothe, Markus Reyer, Michael Mathar, Rudolf Rhein Westfal TH Aachen Inst Theoret Informat Technol Kopernikusstr 16 D-52074 Aachen Germany

ISBN: (纸本)9789897582189

In this paper, we consider the two-stage three-dimensional guillotine cutting stock problem with usable leftover. There are two properties that distinguish our problem formulation from others. First, we allow the items to be rotated. Second, we consider the case in which leftover material is to be reused in subsequent production cycles. Third, we solve the problem in three dimensions. The optimization problem is formulated as a mixed integer linear program. To verify the approach, several examples show that our formulation performs well.

关键词： Two-Stage Three-Dimensional Guillotine Cutting Residual Bin-Packing Problem mixed integer programming model Reuseable Leftovers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：