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

Mathematical programming formulations for the reclaimer scheduling problem with sequence-dependent setup times and availability constraints

引用

Procedia Computer Science 2024年 232卷 2959-2972页

作者： Oualid Benbrik Rachid Benmansour Abdelhak Elidrissi Laboratoire SI2M National Institute of Statistics and Applied Economics (INSEA) Rabat Morocco LAMIH UMR CNRS 8201 Valenciennes France Rabat Business School International University of Rabat Rabat Parc Technopolis Rabat-Shore Morocco

In the context of Industry 4.0, which encompasses advanced technologies and interconnected systems, the integration of optimization techniques assumes a crucial role in addressing resource management challenges across various sectors, including manufacturing systems. In bulk ports, which are an integral part of the manufacturing and logistics chain, one of the most critical resource management challenges is the scheduling of automated or semi-automated reclaimers. These machines are responsible for reclaiming dry bulk materials for loading onto vessels using ship-loaders. The efficient operation of reclaimers directly impacts the overall efficiency of the port. However, the current works for the reclaimer scheduling problem (RSP) overlook the necessity of maintenance activities and assume continuous machine availability. Nonetheless, the inclusion of preventive maintenance activities is critical to ensuring optimal scheduling decisions that minimize production disruptions and downtime. To address these challenges, this paper proposes a novel approach that considers periodic preventive maintenance activities of the reclaimers. We consider two cases to tackle this problem. The first case involves the optimization of material handling within a system of two stockpads and one reclaimer machine. For this case, two novel mixed integer programming (MIP) formulations are developed to drive efficient scheduling decisions and maximize productivity. Furthermore, for the second case representing a more complex system comprising three stockpads and two reclaimers, a novel MIP formulation is devised. The effectiveness of the proposed mathematical formulations is rigorously tested through the use of randomly generated instances based on a real-world case.

关键词： Reclaimer scheduling Bulk ports mixed integer programming Sequence-dependent setup times Availability constraints Machine eligibility restrictions

来源：评论

学校读者我要写书评

暂无评论

MIP Formulations and Metaheuristics for Multi-Item Capacitated Lot-Sizing Problem with Non-Customer Specific Production Time Windows and Setup Times

引用

American Journal of Operations Research 2017年第2期7卷 83-98页

作者： Ridha Erromdhani Abdelwaheb Rebai Department of Quantitative Methods and Information Technology Faculty of Economic and Management Sfax Tunisia Department of Quantitative Methods Faculty of Economic and Management Sfax Tunisia

Our research focuses on the development of two cooperative approaches for resolution of the multi-item capacitated lot-sizing problems with time windows and setup times (MICLSP-TW-ST). In this paper we combine variable neighborhood search and accurate mixed integer programming (VNS-MIP) to solve MICLSP-TW-ST. It concerns so a particularly important and difficult problem in production planning. This problem is NP-hard in the strong sense. Moreover, it is very difficult to solve with an exact method;it is for that reason we have made use of the approximate methods. We improved the variable neighborhood search (VNS) algorithm, which is efficient for solving hard combinatorial optimization problems. This problem can be viewed as an optimization problem with mixed variables (binary variables and real variables). The new VNS algorithm was tested against 540 benchmark problems. The performance of most of our approaches was satisfactory and performed better than the algorithms already proposed in the literature.

关键词： Variable Neighborhood Decomposition Search Formatting Metaheuristics Production Planning Capacitated Lot Sizing mixed integer programming Matheuristics Production Time Windows

来源：评论

学校读者我要写书评

暂无评论

Intraday Optimization of Pumped Hydro Power Plants in the German Electricity Market

引用

Energy Procedia 2016年 87卷 45-52页

作者： Sebastian Braun Rainer Hoffmann EnBW Energie Baden-Württemberg AG Durlacher Allee 93 76131 Karlsruhe Germany Institute for Renewable and Sustainable Energy Systems TU München

Historically, the optimal production of hydro power plants was determined once day ahead. Today, many regulatory requirements in the German electricity market make this process much more complex: Power plant operators are committed to report information on planned production and even on provision of balancing energy of each single generator to transmission system operators. As soon as a deviation in the schedule occurs, the information hast to be updated and reported again. These requirements lead to the point where optimization of pumped hydro power plants can no longer be done manually. In order to fulfil these requirements, EnBW has developed its own optimization model and established a system-based day ahead and intraday asset optimization process. The optimization problem is formulated as a mixed integer problem which determines the minimum operating cost subject to all technical constraints of a hydrothermal portfolio and covering load. As a post-optimization of this new intraday optimization system we set up an effective multistage looping optimization algorithm for daily pumped hydro power plants considering e. g. reservoir limits, quarter-hourly prices, grid charges and availabilities. A real world case study is presented and discussed.

关键词： continuous intraday trading intraday optimization mixed integer programming pumped hydro power plants

来源：评论

学校读者我要写书评

暂无评论

Empirical Complexity Analysis of a MILP-Approach for Optimization of Hybrid Systems

引用

IFAC Proceedings Volumes 2003年第6期36卷 129-134页

作者： Jochen Till Sebastian Engell Sebastian Panek Olaf Stursberg Process Control Lab (CT-AST) University of Dortnlund 44221 Dortmund Germany

Many techniques for designing controllers for hybrid systems suffer inherently from the complexity of computation, such that the applicability is limited to relatively small problems. It is often not obvious, however, which particular part of a problem formulation has a dominant impact on the increase of complexity with the problem size. This paper describes a thorough empirical investigation of the sources of complexity for an approach to optimal control of hybrid systems. This approach transforms the control task into a mixed-integer programming problem that is solved by Branch&Bound techniques. The influence of various parameters on the computational costs are investigated for a scalable technical example

关键词： Complexity Empirical Analysis Hybrid Systems mixed integer programming Optimal Control

来源：评论

学校读者我要写书评

暂无评论

Supply Chain Design Models and Solution Methods: A Review and Directions for Future Research

引用

Paradigm 2007年第2期11卷 28 - 37页

作者： Om Pal Singh Satish Chand *Asstt. Professor Mech. Engg. Dept. Beant College of Engg. and Technology Gurdaspur Punjab India. **Professor Mech. Engg. Dept. Motilal Nehru National Institute of Technology Allahabad India

Supply chain may be designed both at the strategic level as well as at the operational level. The strategic level model decides the basic structural configuration of the supply chain, i.e. the locations and number of echelons like suppliers, manufacturing plants, distribution centres, retailers, etc. At the operational level, the parameters like inventory levels, production and delivery schedules, etc., are decided to control the day-to-day activities of the supply chain. In the literature, various kinds of models are appearing which have been developed by various researchers. Many performance measures have been used to assess supply chain performance. A wide range of supply chain decision variables, modeling approaches, and solution methods have been adopted by researchers. The objectives of this paper are to: (1) provide a focused review of literature on supply chain design models and their solution methods and (2) suggest directions for future research in this area.

关键词： supply chain management analytical models heuristic approach production and distribution models mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

A multi-objective open vehicle routing problem with overbooking: Exact and heuristic solution approaches for an employee transportation problem

引用

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2022年 108卷 102587-102587页

作者： Dasdemir, Erdi Guleryuz, Guldal Testik, Murat Caner Ozturk, Diclehan Tezcaner Sakar, Ceren Tuncer Testik, Ozlem Hacettepe Univ Dept Ind Engn TR-06800 Ankara Turkey

We address a bus routing problem, where individuals need to be gathered from spatially distributed pickup points and transported to a workplace. The problem is modeled as an open vehicle routing problem. Overbooking is allowed because the total seat capacity of the buses is limited. The problem is treated as a multi-objective optimization problem, where the total distance traveled by the buses and the total number of straphangers in the buses are minimized. We develop a mixed integer programming (MIP) model and employ the epsilon-constraint method to generate the Pareto-optimal frontier. Due to the high computational requirements of the exact model, two heuristic approaches are developed: a heuristic algorithm that is based on a cluster-first and route-second algorithm and a multi-objective evolutionary algorithm. We also develop another MIP model that provides an alternative bound to evaluate the quality of the heuristics' solutions. Experiments on a small and a moderate-sized problem show that the heuristics are fast and approximate the optimal solutions well. The heuristic approaches are then used to solve the actual problem having 103 pickup points, 50 buses and 1986 individuals. A set of approximate solutions whose total transportation distances are at most 14% worse than the best lower bounds are obtained. (c) 2021 Published by Elsevier Ltd.

关键词： Open vehicle routing problem Employee transportation Overbooking Multi-objective optimization mixed integer programming Heuristics

来源：评论

学校读者我要写书评

暂无评论

Optimizing surveillance and management of emerald ash borer in urban environments

引用

NATURAL RESOURCE MODELING 2021年第1期34卷 e12267-e12267页

作者： Bushaj, Sabah Buyuktahtakin, I. Esra Yemshanov, Denys Haight, Robert G. New Jersey Inst Technol Dept Mech & Ind Engn Newark NJ 07114 USA Canadian Forest Serv Great Lakes Forestry Ctr Nat Resources Canada Sault Ste Marie ON Canada US Forest Serv USDA Northern Res Stn Madison WI USA

Emerald ash borer (EAB), a wood-boring insect native to Asia, was discovered near Detroit in 2002 and has spread and killed millions of ash trees throughout the eastern United States and Canada. EAB causes severe damage in urban areas where it kills high-value ash trees that shade streets, homes, and parks and costs homeowners and local governments millions of dollars for treatment, removal, and replacement of infested trees. We present a multistage, stochastic, mixed-integer programming model to help decision-makers maximize the public benefits of preserving healthy ash trees in an urban environment. The model allocates resources to surveillance of the ash population and subsequent treatment and removal of infested trees over time. We explore the multistage dynamics of an EAB outbreak with a dispersal mechanism and apply the optimization model to explore surveillance, treatment, and removal options to manage an EAB outbreak in Winnipeg, a city of Manitoba, Canada. Recommendation to Resource Managers Our approach demonstrates that timely detection and early response are critical factors for maximizing the number of healthy trees in urban areas affected by the pest outbreak. Treatment of the infested trees is most effective when done at the earliest stage of infestation. Treating asymptomatic trees at the earliest stages of infestation provides higher net benefits than tree removal or no-treatment options. Our analysis suggests the use of branch sampling as a more accurate method than the use of sticky traps to detect the infested asymptomatic trees, which enables treating and removing more infested trees at the early stages of infestation. Our results also emphasize the importance of allocating a sufficient budget for tree removal to manage emerald ash borer infestations in urban environments. Tree removal becomes a less useful option in small-budget solutions where the optimal policy is to spend most of the budget on treatments.

关键词： Canada emerald ash borer mixed integer programming stochastic optimization surveillance uncertainty

来源：评论

学校读者我要写书评

暂无评论

Environmental taxes in Supply Chain Design for recycling waterways sediments *

引用

IFAC Proceedings Volumes 2011年第1期44卷 447-452页

作者： Y. Bouzembrak H Allaoui G. Goncalves H. Bouchriha Univ Lille Nord de France F-59000 Lille France UArtois LGI2A F-62400 Bthune France Departement of Industrial Engineering National school of Engineers of Tunis 1002 Tunis Tunisia

Abstract Waterways sediments is an example of a valuable material that can be recycled. In this study, Design Chain Network of recycling waterways sediments is presented to determine a logistic strategy for real world recycling company in France, and to analyse the influence of integration of environmental taxes on supply chain design decisions. We propose a strategic model for supply chain design with consideration of CO 2 emission taxes, multi-modality and the different logistics costs. We show how these features are formulated in a mixed integer programming (MIP) model, thus capturing the role of the environmental taxes and the transportation modes in the strategic design of a supply chain. The models are solved by commercial software Cplex 10.1 and the computational results are compared. The study is followed by the analyses of the results.

关键词： Supply Chain Network Design mixed integer programming Environmental taxes Multi-modality

来源：评论

学校读者我要写书评

暂无评论

The Flexible Job Shop Scheduling Problem with Setups and Operator Skills: an application in the textile industry

引用

IFAC-PapersOnLine 2024年第19期58卷 1090-1095页

作者： Tom Perroux Taha Arbaoui Leila Merghem-Boulahia EMO SAS 51 Rue Courtalon 10000 Troyes France INSA Lyon Université Lumière Lyon 2 Université Claude Bernard Lyon 1 Université Jean Monnet Saint-Etienne DISP UR4570 Villeurbanne 69621 France Laboratory of Computer Science and Digital Society University of Technology of Troyes 12 Rue Marie Curie 10000 Troyes France

The Flexible Job Shop Scheduling Problem (FJSSP) is one of the most studied problems in the literature thanks to its practical relevance. Many industrial production scheduling problems can be seen as a FJSSP with different constraints and objectives. The studied problem arises in a textile factory, precisely in the sewing process. Multiple real-world constraints are tackled. Individual skills of operators and different types of setup times are considered: machine-change setup time for operators, colour-change setup times and configuration-change setup times. The objective is to minimize the total tardiness. To the best of the authors’ knowledge, this is the first study that tackles this variant of the problem. This paper presents a preliminary study to validate the approach and evaluate the tractability of the industrial problem. A mixed-integer linear programming (MILP) model is proposed and solved using a commercial solver. Real-world data are used to generate more than 1000 problems that are clustered in 4 groups based on the number of jobs to be scheduled, the number of operators and flexibility of their skills. The results show that the proposed MILP model can reach optimality for the small size instances but it is intractable for most large-sized instances. Moreover, the results highlight how diversifying the operators’ skills can help find better solutions.

关键词： Flexible Job Shop Scheduling mixed integer programming Tardiness Minimization Real-World Problem Case Study

来源：评论

学校读者我要写书评

暂无评论

Integrated Scheduling of Container Terminal Operation Equipment

Frontiers in Economics and Management

引用

Frontiers in Economics and Management 2022年第2期3卷 64-73页

作者： Yingran Cui

U-shaped wharf layout is a new type of automatic wharf loading and unloading technology, which can realize the automatic operation of container ship side loading and unloading, horizontal transportation and yard loading and unloading. Aiming at the integrated scheduling problem among dual trolley shore bridge, horizontal transportation equipment and dual cantilever rail crane, a hybrid programming model is established with the goal of minimizing operation time. The multi-objective genetic algorithm is compared with the solution results of CPLEX to verify the effectiveness of GA, and the scheduling results of an example are given.

关键词： U-shaped Wharf Layout Integrated Equipment Scheduling mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：