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

A parallel heuristic for hybrid job shop scheduling problem considering conflict-free AGV routing

SWARM AND EVOLUTIONARY COMPUTATION 2023年 79卷

作者： Amirteimoori, Arash Tirkolaee, Erfan Babaee Simic, Vladimir Weber, Gerhard-Wilhelm London Sch Econ & Polit Sci LSE Dept Math London England Istinye Univ Dept Ind Engn TR-34396 Istanbul Turkiye Univ Belgrade Fac Transport & Traff Engn Vojvode Stepe 305 Belgrade 11010 Serbia Poznan Univ Tech Fac Engn Management PL-60965 Poznan Poland

In this study, a novel and computationally efficacious Parallel Two-Step Decomposition-Based Heuristic (PTSDBH) and a mixed integer linear programming (MILP) are developed to tackle the concurrent scheduling of jobs and Automated Guided Vehicles (AGVs) or transporters in a hybrid job shop system. Finite multiple AGVs, AGV eligibility, job's alternative process routes, job re-entry, and conflict-free AGV routing are considered. As far as the authors know, the importance of conflict-free routing for AGVs has not been featured in any of the past studies. Conflict-free AGV routing is an indispensable technicality, specifically where AGVs are the main mean of transportation as AGVs may collide on routes and the whole system ends up in breakdown. To avoid this issue, a conflict-free routing strategy is considered. Utilizing the parallel computing approach, PTSDBH is capable of tackling large-sized problems in remarkably shorter runtimes. To support this, PTSDBH is compared against three literarily well-known metaheuristics;i.e., Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Ant Colony Optimization (ACO) along with TSDBH (i.e., the single-core variant of PTSDBH) on three different-sized sets of benchmark instances. The results reveal that PTSDBH and TSDBH produce the same objective values and outperform the metaheuristics in terms of the quality of objective value. However, the runtimes of TSDBH are considerably higher than those of PTSDBH as it only uses one core to process. Finally, employing Nemenyi's post-hoc procedure for Friedman's test and the convergence plot, it is supported that the objective values generated by PTSDBH and TSDBH are significantly more desirable than those generated by the metaheuristics.

关键词： mixed integer linear programming Hybrid job shop scheduling Conflict-free AGV routing Parallel two-step decomposition-based heuristic Metaheuristics Parallel computing

来源：评论

学校读者我要写书评

暂无评论

Optimal network-wide adjustments of initial airport slot allocations with connectivity and fairness objectives

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2023年 178卷

作者： Keskin, Merve Zografos, Konstantinos G. Univ Sheffield Management Sch Conduit Rd Sheffield S10 1FL England Univ Lancaster Ctr Transport & Logist CENT Dept Management Sci Management Sch Lancaster LA1 4YX England

Due to serious demand-supply imbalances, many airports around the world are highly congested. Access to these highly congested (Level 3, coordinated) airports is controlled through the use of the IATA World Airport Slot allocation Guidelines (WASG). At an individual airport, slots requested by each airline are allocated at the airport under consideration independently without taking into account the interactions between slots allocated at different airports. However, in order for the air-transport network to operate seamlessly, ensuring network-wide connectivity of flights, and the interdependencies existing between the slots allocated at individual airports need to be considered. Several models have been proposed in the literature to deal with the optimum allocation of slots at a single airport. However, the literature currently does not adequately address the network-wide slot allocation problem. In this paper, we are introducing a novel approach to address the network-wide slot allocation problem. Our approach considers as an input the individual airport schedules generated during the slot allocation process at individual airports and optimally adjusts them to ensure network-wide flight connectivity by taking into account the interdependencies existing between flights connecting pairs of airports. To this end, we propose bi-objective mathematical models, which consider schedule efficiency and inter-airline fairness objectives, and incorporate the importance that different airports have for the functioning of the air transport network, using the IATA connectivity indices and the betweenness centrality measures. We solve the proposed models using the epsilon - constraint method to investigate trade-offs between network-wide schedule efficiency and fairness, and we investigate the effect of these trade-offs on the airlines and the airports. Results from the application of the proposed models to a test network suggest that the consideration of the contribution of the

关键词： Network-level airport slot allocation Airport network connectivity mixed integer linear programming Bi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

Synchronizing delivery and installation with vehicle sharing: A hybrid adaptive large neighborhood search☆

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2023年 185卷

作者： Erdogan, Mehmet S. M'Hallah, Rym Kings Coll London Fac Nat Math & Engn Sci Engn Dept London England

This paper presents the real-life synchronized delivery and installation with vehicle sharing problem (SDIVSP). Two fleets of vehicles serve a set of customers within their specified time windows. Delivery vehicles drop products to customers while installation vehicles drop and pick up technicians without necessarily waiting for them. Delivery must precede installation. This paper models SDIVSP as a mixed integer linear program, which solves small-sized instances. For large instances, this paper proposes a heuristic HALNS that hybridizes adaptive large neighborhood search and variable neighborhood search. Extensive experimentation provides computational evidence of the superiority of HALNS when solving well-known benchmark instances of (synchronized) vehicle routing problems with time windows and its effectiveness in tackling newly proposed SDIVSP instances. HALNS outperforms two state-of-the-art algorithms by an average 6.41% and 12.43% on synchronized vehicle routing with time windows benchmark sets. It further provides computational evidence of the benefits of shared installation vehicles: Total cost decreases by 41.72% and 35.35% as the installation vehicle capacity increases for tight and large time windows respectively.

关键词： Delivery and installation mixed integer linear programming Variable neighborhood search Vehicle sharing Synchronized delivery

来源：评论

学校读者我要写书评

暂无评论

Military aircraft flight and maintenance planning model considering heterogeneous maintenance tasks

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2023年第1期239卷

作者： Cha, Guesik Park, Junseok Moon, Ilkyeong Republ Korea AF Headquarters AF Logist Command Daegu 41052 South Korea Seoul Natl Univ Dept Ind Engn Seoul 08826 South Korea Seoul Natl Univ Inst Engn Res 1 Gwanak Ro Seoul 08826 South Korea

This paper focuses on the military aircraft flight and maintenance planning (MAFMP) problem, aiming to maximize aircraft availability. We consider heterogeneous maintenance tasks: usage-based maintenance tasks (UBMTs) to be performed before the cumulative flight time of an aircraft reaches a predetermined threshold, and calendar-based maintenance tasks (CBMTs) to be performed before the cumulative calendar time of an aircraft reaches a predetermined threshold. The MAFMP problem is a complicated problem that often needs to be solved by military operators, and the optimization of this is essential for military readiness. We formulated a mixed integer linear programming (MILP) model to solve the problem and obtained managerial insights that we recommend for military operators in experiments with varying parameter values. We also proposed two heuristic algorithms that can solve large problems in a reasonable time. The results of the computational experiment show the efficiency and effectiveness of these algorithms in several problem instances.

关键词： mixed integer linear programming Flight and maintenance planning Preventive maintenance Fleet availability Heuristic

来源：评论

学校读者我要写书评

暂无评论

Optimal Radial Topology with Phase Balancing in LV Distribution System Considering Energy Loss Reduction: A Case Study in Cambodia 4

Optimal Radial Topology with Phase Balancing in LV Distribut...

引用

4th International Conference on Electrical, Control and Instrumentation Engineering, ICECIE 2022

作者： Eth, Oudaya Vai, Vannak Bun, Long Eng, Samphors Khon, Kimsrornn Energy Technology and Management Unit Research and Innovation Center Institute of Technology of Cambodia Phnom Penh Cambodia Institute of Technology of Cambodia Faculty of Electrical Engineering Dept. of Electrical and Energy Engineering Phnom Penh Cambodia

ISBN: (纸本)9781665480765

This paper aims to find the optimal topology from three different case studies based on energy loss reduction. In the first stage, the shortest path (SP) algorithm is used to find the shortest distance from each load to all poles with the given location. Then, several parameters of electrical appliances used in households have been collected from the survey to generate load profiles of each household by a bottom up algorithm. There are 3 cases for the comparison based on energy loss in this research work. Case 1 is based on a Repeated ABC phase sequence (RPS ABC) which is assumed as the based case. Cases 2 and 3 are designed by phase balancing technique based on peak load and load profile, respectively. In this work, mixed integer linear programming (MILP) method has been chosen to define phase balancing in the unbalanced three-phase system. Based on the results, case 3 provides a good option for the optimal radial topology with the phase balancing technique based on energy loss. © 2022 IEEE.

关键词： bottom up algorithm load balancing load profile LV grid mixed integer linear programming shortest path

来源：评论

学校读者我要写书评

暂无评论

Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas

引用

PROGRESS IN ARTIFICIAL INTELLIGENCE 2021年第4期10卷 465-488页

作者： Bautista-Valhondo, Joaquin IOC ETSEIB Univ Politecn Catalunya Ave Diagonal 647 Barcelona 08028 Spain

In this paper, a new problem of job sequences in a workshop is presented, taking into account non-unit demands for the jobs and whose objective is to minimize the total completion time for all the jobs (C-max) satisfying a set of restrictions imposed on the problem to preserve the production mix. Two procedures are proposed to solve the new problem: mixed integer linear programming and a Metaheuristic based on Multistart and Local Search. The two proposed procedures are tested using instance set Nissan-9Eng.I, in both cases giving rise to highly satisfactory performance both in quality of solutions obtained and in the CPU times required. Through a case study of the Nissan engine manufacturing plant in Barcelona, our economic-productive analysis reveals that it is possible to save an average of euro 1162.83 per day, manufacturing 270 engines, when we transform the current assembly line into a Heijunka-Flow Shop.

关键词： Flow shop scheduling problem Overall demand Heijunka mixed integer linear programming Multistart Local search Metaheuristic

来源：评论

学校读者我要写书评

暂无评论

A Multi-Agent System Framework for Managing Distributed Energy Resources (DERs)

A Multi-Agent System Framework for Managing Distributed Ener...

引用

IEEE Electrical Energy Storage Application and Technologies Conference (EESAT)

作者： Omid Ziaee Beth Crouchet Chris DeBenedicts Budderfly Inc. Shelton CT USA

ISBN: (数字)9798331524852

ISBN: (纸本)9798331536411

In this paper, we propose a multi-tiered framework for controlling distributed energy resources (DERs) such as elastic and non-elastic loads, electric vehicles (EV s), and Battery Energy Storage Systems (BESS). These resources are organized into clusters. By distributing the control algorithm across these tiers, DERs optimize local operations and enhance system resilience. Local agents (LIAs) at the lowest tier optimize individual units. Cluster agents (CI As) at the second-tier aggregate cluster loads. The orchestrator agent (01 A) at the highest tier communicates with utilities or ISO/TSOs. Each LI A periodically solves a stochastic mixed-integer linear programming (MILP) problem to minimize costs and flatten the load profile. LI A results are aggregated by CI As to calculate flexible capacities. The 01 A aggregates this data to identify operational violations with the network operator, distributing necessary corrections among clusters.

关键词： Fault tolerance Costs Uncertainty Electric vehicles Scheduling Distributed power generation mixed integer linear programming Distributed algorithms Multi-agent systems Meteorology

来源：评论

学校读者我要写书评

暂无评论

Optimization of Battery Energy Storage Systems for Energy Markets and Future Energy Communities

Optimization of Battery Energy Storage Systems for Energy Ma...

引用

International Conference on Green Energy and Applications (ICGEA)

作者： Augustin Marie Thibaut Gillot Francesco Grimaccia Sonia Leva Department of Energy Politecnico di Milano Milan Italy

ISBN: (数字)9798331530778

ISBN: (纸本)9798331530785

The increasing integration of Renewable Energy Sources (RES) into electrical grids presents also challenges related to grid stability and market dynamics. Battery Energy Storage Systems (BESS) have emerged as a potential solution to these challenges, offering capabilities for energy storage and support services that enhance grid reliability. This paper explores the optimization of the operations of such components with a case study in the Italian electricity market context. The research employs a mixed-integer linear programming (MILP) model to optimize the participation of BESS in the Day-ahead market, under the specific regulatory framework of a stock martket tender. By analyzing historical data and simulating BESS operations, this study identifies proper strategies to maximize economic returns and enhance the competitive positioning of storage systems in a specific European market context.

关键词： Green energy Fluctuations Battery energy storage system Europe Power system stability Stability analysis Real-time systems mixed integer linear programming Stock markets Optimization

来源：评论

学校读者我要写书评

暂无评论

A new formulation and an effective matheuristic for the airport gate assignment problem

引用

COMPUTERS & OPERATIONS RESEARCH 2023年 151卷

作者： Karsu, Oezlem Solyali, Oguz Bilkent Univ Dept Ind Engn TR-06800 Ankara Turkiye Middle East Tech Univ Business Adm Program Northern Cyprus Campus TR-99738 Kalkanli Turkiye

This study considers an airport gate assignment problem where a set of aircraft arriving to an airport are assigned to the fixed gates of the airport terminal or to the apron. The aim is to lexicographically minimize the number of aircraft assigned to the apron, and then the total walking distance by passengers. A new mixed integer linear programming formulation and a matheuristic is proposed for the problem. The proposed formulation is based on the idea of flow of passengers and has smaller size compared to the existing formulations in the literature. The proposed matheuristic, which relies on solving a restricted version of the proposed formulation of the problem, is not only easy to implement but is also very effective. A computational study performed on benchmark instances reveals that the proposed formulation and the matheuristic outperform the existing exact and heuristic algorithms in the literature.

关键词： Airport gate assignment problem mixed integer linear programming Matheuristic

来源：评论

学校读者我要写书评

暂无评论

A matheuristic algorithm for block assignment problem in long-term production planning in the shipbuilding industry

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2023年 184卷

作者： Lee, Jonghwa Kim, Byung-In Kim, Sang Hun Pohang Univ Sci & Technol POSTECH Dept Ind & Management Engn Pohang South Korea Samsung Heavy Ind Co Ltd Geoje Si South Korea

This study introduced the block assignment problem in the long-term production planning of a very large realworld shipbuilder and formulated it as a mixed integer linear programming model. For the problem, blocks are assigned to assembly shops for processing;some blocks must be assigned as a group to a region, a collection of assembly shops, because of their mutual dependency. Each assembly shop has its target work level. The objective is to minimize the sum of workload deviations of the assembly shops during a specific planning period. Because the mathematical model could not be solved within a reasonable time, a two-stage matheuristic algorithm was proposed. The algorithm determines the region of blocks in the first stage and the assembly shop for each block in the second stage. Computational experiments were performed using a real-world instance provided by the shipbuilder, including instances of different sizes generated from real-world data. The experiment results demonstrated that the algorithm yielded remarkable reductions of 10.5% and 35.3% in assignment costs and factory workload violations compared with manual planning, respectively. The proposed decomposition-based algorithm also demonstrated superior effectiveness in solving the problem than the full mathematical model. The proposed algorithm is currently embedded in the planning system of the shipbuilder.

关键词： Shipbuilding Long-term planning Block assignment mixed integer linear programming Two -stage matheuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：