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

Optimizing a sustainable logistics problem in a renewable energy network using agenetic algorithm

OPSEARCH 2019年第1期56卷 73-90页

作者： Sadeghi, Javad Haapala, Karl R. Oregon State Univ Sch Mech Ind & Mfg Engn Corvallis OR 97331 USA

Renewable energy sources, including bio-energy technologies, have been introduced to overcome sustainability challenges, such as negative environmental impacts and energy insecurity due to reliance on fossil fuels. Logistics activities have a significant effect on the cost and environmental impacts of renewable energy supply chains. Understanding and reducing the carbon footprint of renewable energy supply chains can aid in mitigating environmental impacts. Thus, this research presents a mathematical model that can be used to optimize renewable energy supply chain logistics costs and carbon footprint. The proposed model considers a biomass-to-bio-oil supply chain, including harvesting and collection sites, bio-refineries, and distribution centers. It is assumed that mobile and fixed refineries will be used to produce bio-oil. The model considers the mass of biomass and bio-oil, number of mobile and fixed refineries, and number of truck trips to minimize total cost, where a carbon tax is used to represent carbon footprint in the mathematical cost model. A genetic algorithm is designed to obtain a near-optimal solution. Six scenarios for mobile and fixed refinery capacity are tested in performing sensitivity analysis of the model. The results indicate that the mathematical model of the bio-oil supply chain has reasonable relationships between input and output variables. The model is able to incorporate the impact of carbon emissions in a mixed-refinery bio-oil supply chain as a cost parameter. It was also found that increasing mobile refinery capacity has the greater effect on reducing total cost and carbon emissions than increasing fixed refinery capacity.

关键词： Sustainable supply chains management Carbon tax Genetic algorithm mixed integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Improved discrete JAYA algorithms for hot rolling scheduling considering equipment performance degradation 20

Improved discrete JAYA algorithms for hot rolling scheduling...

引用

IEEE 20th International Conference on Automation Science and Engineering (CASE)

作者： Zhong, Peitang Zou, Kun Zhao, Ziyan Liu, Shixin Northeastern Univ Coll Informat Sci & Engn Shenyang Peoples R China

ISBN: (纸本)9798350358513;9798350358520

Hot rolling is a typical industrial process with equipment performance degradation. Slabs to be rolled have specific equipment performance requirements and would cause different degrees of equipment performance degradation. Quantifying equipment performance to explore its impact on production scheduling has rarely been considered in existing work. In this paper, a new hot-rolling scheduling problem is tackled where the quantifying roller performance is considered. It aims to minimize the maximum completion time and the performance renewal cost. A mixed integer linear programming model is formulated for the problem. An improved discrete JAYA algorithm is proposed to effectively solve it. Experimental results show that the proposed algorithm performs well in solving the concerned problem, betters competitive peers, and shows great potential to be used in practice.

关键词： Performance degradation hot rolling scheduling mixed integer linear programming model metaheuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

MAC Scheduling for High Throughput Underwater Acoustic Networks

MAC Scheduling for High Throughput Underwater Acoustic Netwo...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Guan, Yang Shen, Chien-Chung Yackoski, Justin Univ Delaware Dept Comp & Informat Sci Newark DE 19716 USA Intelligent Automat Inc Rockville MD USA

ISBN: (纸本)9781612842547

Underwater acoustic networks (UWANs) have emerged as the primary tool to monitor and act upon the well-being of marine environment. However, the significantly slower propagation speed of acoustic signals, in contrast to RF signals, introduces the spatio-temporal uncertainty, which makes existing medium access control (MAC) solutions for terrestrial RF wireless networks unsuitable for UWANs. In this paper, we investigate transmission scheduling for time-based MAC protocols and design scheduling algorithms that take advantage of the long propagation delay of acoustic signals to facilitate concurrent transmissions and receptions of acoustic communications. Specifically, we specify the constraints that MAC protocols need to satisfy to avoid conflicts and model these constrains into a mixed integer linear programming model. We also design heuristics that compute conflict-free transmission schedules, and demonstrate via simulation that the heuristics significantly improve network throughput.

关键词： Acoustics Interference MAC scheduling Media Access Protocol Propagation delay RF signals Receivers Schedules Throughput access protocols acoustic communications acoustic signal propagation conflict-free transmission schedules integer programming linear programming medium access control mixed integer linear programming model scheduling spatio-temporal uncertainty terrestrial RF wireless networks time-based MAC protocols transmission scheduling underwater acoustic communication underwater acoustic networks

来源：评论

学校读者我要写书评

暂无评论

Building a Decision Support System for Vehicle Routing Problem: A Real-Life Case Study from Turkey 19th

Building a Decision Support System for Vehicle Routing Probl...

引用

19th International Symposium for Production Research, ISPR 2019

作者： Doğan, Ayşenur Bilici, İrem Demiral, Osman Kaan Erdoğan, Mehmet Serdar Kabadurmuş, Özgür International Logistics Management Yasar University Izmir Turkey

ISBN: (纸本)9789811509490

One of the most costly operations in logistics is the distribution of goods. Inefficient vehicle routes increase distribution costs, especially for companies performing distribution operations daily. Vehicle Routing Problem (VRP) addresses this inefficiency and optimizes the distribution routes of vehicles. In this study, we developed a decision support system to solve the Vehicle Routing Problem with Time Windows and Split Delivery and applied it to a real-life case company. The data of the problem were obtained by a real logistic company, which is one of the leading Turkish logistics companies located in Izmir, Turkey. The company distributes goods to the customers located in various cities in Turkey and currently does not use any decision-making tool to optimize the routes of its trucks. We formulated the mathematical model as mixed integer linear programming (MILP) and solved it by using IBM OPL CPLEX. Our proposed decision support system clusters the customers into geographical groups and then optimizes the routes within the clusters. The results of the decision support system can be manually adjusted by the decision maker to fine-tune the routes. We demonstrated the efficiency of our proposed methodology on the regional distribution of the company. The results of the study showed that our proposed model decreases the total distribution distance by 16% and total distribution time by approximately 13%. © 2020, Springer Nature Switzerland AG.

关键词： Heterogeneous Fleet mixed integer linear programming model Optimization Time windows Vehicle Routing Problem

来源：评论

学校读者我要写书评

暂无评论

Optimization of Costs in Empty Container Repositioning 19th

Optimization of Costs in Empty Container Repositioning

引用

19th International Symposium for Production Research, ISPR 2019

作者： Göçen, Mehmet Yasin Çağlar, Öykü Ercan, Elif Kizilay, Damla Department of Industrial Engineering Yasar University Bornova Turkey Department of Industrial Engineering Dokuz Eylul University İzmir Turkey

ISBN: (纸本)9789811509490

In this study, the empty container repositioning problem in a liner shipping company is considered. The research includes necessary information about the company and maritime transportation, highlighting the importance of empty container storage. As the worldwide containerized trade increases, the container traffic increases. Consequently, the surplus containers are repositioned to locations where they are required, which causes high costs. Therefore, in the existing system, the company deals with higher prices. In this study, the storage location of the empty containers, which are coming from the vessels to the ports, are determined according to the different cost policies of the warehouses. Thus, our problem is defined as an empty container repositioning problem. The primary objective of this study is to build an operations-research based decision-making system in order to minimize the total cost, regarding changing prices of warehouses and transportation cost of containers. In the decision-making process, this study will help the company to overcome the complexity about repositioning empty containers regarding the container size, storage day of the containers, changing inventory holding costs of the warehouses, and the transportation costs of the containers from port to the corresponding warehouses. Taking into consideration all these parts of the problem, this study will eventually help in reducing inventory holding and transportation costs of the empty container storage. As a solution methodology, the mixed integer linear programming model is proposed, and optimal solutions are obtained in a concise time. © 2020, Springer Nature Switzerland AG.

关键词： Cost reduction Decision support system Empty container repositioning mixed integer linear programming model Optimization

来源：评论

学校读者我要写书评

暂无评论

modeling Probabilistic Combinatorial Optimization Problems on Graphs Using Communication Channel

Modeling Probabilistic Combinatorial Optimization Problems o...

引用

作者： Djakam, William Ngambou The University of Alabama at Birmingham

学位级别：Ph.D., Doctor of Philosophy

This thesis studies Combinatorial Optimization Problems (COPs) on graphs that integrate uncertainty in the problem definition. We focus on Probabilistic Combinatorial Optimization Problems (PCOPs), where uncertainty is associated with the presence or absence of subsets of vertices that describe the problem. In general, combinatorial optimization problems are formulated as a mixed integer linear programming (MILP) model. This process aims to convert elements of decision-making into variables considering related constraints and choosing an objective function. In such cases, it is recommended to define an objective function that is a linear function with linear constraints. Also, when practical problems are formulated as combinatorial optimization models, one must often include logical implications. Yet, the Least Action Principle (LAP) of information theory has been exploited to achieve optimization goal using the least amount of resources. Therefore, we approach combinatorial optimization problems on graphs by modeling them with a noisy communication channel using the maximum independent set as a tool of the least action of information theory. Subsequently, we propose an information-theoretic modeling approach for a class of PCOP that transformable into bipartite graphs. Using the a priori approach, we construct a communication channel and obtain any sub-instance solution with the noisy communication model. This communication channel model is used to a portfolio optimization problem as a case study.

关键词： mixed integer linear programming model Combinatorial optimization problems Information theory Least action

来源：评论

学校读者我要写书评

暂无评论

Scheduling aerial resource operations for the extinction of large-scale wildfires?

引用

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2024年 122卷

作者： Skorin-Kapov, Nina Mesaric, Luka Garcia, Fernando Pereniguez Skorin-Kapov, Lea Tech Univ Cartagena Univ Ctr Def Murcia Spain Univ Zagreb Fac Elect Engn & Comp Zagreb Croatia

The significant increase in large-scale wildfire events in recent decades, caused primarily by climate change, has resulted in a growing number of aerial resources being used in suppression efforts. Present-day management lacks efficient and scalable algorithms for complex aerial resource allocation and scheduling for the extinction of such fires, which is crucial to ensuring safety while maximizing the efficiency of operations. In this work, we present a mixed integer linear programming (MILP) optimization model tailored to large-scale wildfires for the daily scheduling of aerial operations. The main objective is to achieve a prioritized target water flow over all areas of operation and all time periods. Minimal target completion across individual areas and time periods and total water output are also maximized as secondary and ternary objectives, respectively. An efficient and scalable multi-start heuristic, combining a randomized greedy approach with simulated annealing employing large neighborhood search techniques, is proposed for larger instances. A diverse set of problem instances is generated with varying sizes and extinction strategies to test the approaches. Results indicate that the heuristic can achieve (near)-optimal solutions for smaller instances solvable by the MILP, and gives solutions approaching target water flows for larger problem sizes. The algorithm is parallelizable and has been shown to give promising results in a small number of iterations, making it applicable for both night-before planning and, more time-sensitive, early-morning scheduling.

关键词： Aerial firefighting Scheduling mixed integer linear programming model Randomized greedy heuristic Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

A MATHEMATICAL model FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND MULTIPLE USE OF VEHICLES

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GA...

引用

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY 2012年第3期27卷 569-576页

作者： Koc, Cagri Karaoglan, Ismail Selcuk Univ Endustri Muhendisligi Bolumu Selcuklu Konya Turkey

In this paper, the vehicle routing problem with time windows and multiple use of vehicles (VRP_TW_MUV) which is the generalized version of the classic vehicle routing problem, is considered. Unlike the classic Vehicle Routing Problem, vehicles are allowed to use more than one route in the VRP_TW_MUV. The VRP_TW_MUV is encountered usually in the distribution systems in which the product.s shelf-life is short or duration of the distribution is short. Although, the VRP_TW_MUV is often encountered in practice, there are very few studies in literature. In this study, a mathematical model proposed for the VRP_TW_MUV. The proposed mathematical model is compared in terms of time to reach the best solution on the test problems of various sizes derived from the literature.

关键词： Multiple Use of Vehicles Vehicle Routing Problem mixed integer linear programming model Time Windows

来源：评论

学校读者我要写书评

暂无评论

Optimization of Active Distribution Network Operation with SOP Considering Reverse Power Flow

引用

APPLIED SCIENCES-BASEL 2024年第24期14卷 11797页

作者： Ma, Zhanhui Cao, Fang North China Elect Power Univ Sch Elect & Elect Engn Beijing 102206 Peoples R China

As the penetration of distributed renewable energy increases, the phenomenon of bidirectional power flow in distribution networks becomes increasingly severe. Traditional regulation devices like OLTC (on-load tap changer) and CB (capacitor bank) cannot effectively mitigate reverse power flow in distribution networks due to their limitations. The transmission capacity of the distribution network under reverse power flow is approximately 50% of the rated capacity of the OLTC, leading to issues such as voltage limit violations and high wind and solar curtailment rates. This paper proposes a method for calculating the reverse power flow delivery capacity of distribution networks, quantitatively describing the distribution network's delivery limits for reverse power flow. Based on this, a joint optimization model for multiple distribution networks with an SOP is established. The SOP is utilized to share reverse power flow delivery capacity among multiple distribution networks, enhancing operational economy and increasing the accommodation of the DG. Finally, the method's effectiveness and correctness are verified in the IEEE 33-node system. The results validate that while joint operation does not enhance the reverse flow transmission capacity of a single distribution network, it can, through the shared reverse flow transmission capacity approach, elevate the reverse flow transmission capacity to approximately 70% during the majority of time periods.

关键词： distribution network soft open point power electronic devices reliability evaluation method mixed integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

A blood distribution problem with new transportation options - an application for the Turkish Red Crescent

引用

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING 2019年第3期13卷 332-367页

作者： Kurt, Atil Cetinkaya, Ferda Can Azizoglu, Meral Univ Twente Dept Ind Engn & Business Informat Syst Enschede Netherlands Cankaya Univ Dept Ind Engn TR-06790 Ankara Turkey Middle East Tech Univ Dept Ind Engn TR-06800 Ankara Turkey

This paper considers the blood distribution problem in the Central Anatolian Regional Blood Centre of the Turkish Red Crescent (TRC) and proposes several demand satisfaction options considering the irradiation centres, urgent demands, and product availability. Our aim is to maximise the total weighted blood demand satisfaction. To address the problem, we develop a mixed integer linear programming model and propose a hybrid genetic algorithm (HGA). The results of our experiments have revealed that the mathematical model cannot handle even small sized problem instances in reasonable times;however, the hybrid genetic algorithm is capable of handling complex daily operations of the Turkish Red Crescent.

关键词： blood distribution system transportation options vehicle routing mixed integer linear programming model genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：