In recent years, there has been a surge of interest in shared autonomous electric vehicle (AEV) fleet systems, owing to their potential to reduce carbon emissions in the transportation sector and alleviate traffic con...
详细信息
In this work, we address two crucial issues that arise in the design of a human-robot collaborative station for the assembly of products: the optimal task allocation and the scheduling problem. We propose an offline m...
详细信息
ISBN:
(纸本)9781728188591
In this work, we address two crucial issues that arise in the design of a human-robot collaborative station for the assembly of products: the optimal task allocation and the scheduling problem. We propose an offline method to solve in series the two mentioned issues, considering a static allocation and taking into account several features such as the minimization of postural discomfort, operation processing times, idle times and hence the total cycle time. Our methodology consists of a mixed approach that combines a capability-based method, where the agents' capabilities are tested against a list of predefined criteria, with optimization. In particular, we formulate a modified version of the Hungarian Algorithm to solve also unbalanced assignment problems, where the number of tasks is different from the number of agents. The scheduling policy is obtained by means of a mixed integer linear programming (MILP) formulation, with a multiobjective optimization. Moreover, the concepts of operation, assembly tree and precedence graph are formalized, since they represent the inputs to our method, together with the information on the workstation layout and on the selected kind of robot. Finally, the proposed solution is applied to a case study to define the optimal task allocation and scheduling for two different workstation layouts: the results are compared and the best layout is accordingly selected.
This article presents methods of planning unmanned aerial vehicle (UAV) missions in which individual platforms work together during the reconnaissance of objects located within a terrain. The planning problem concerns...
详细信息
This article presents methods of planning unmanned aerial vehicle (UAV) missions in which individual platforms work together during the reconnaissance of objects located within a terrain. The planning problem concerns determining the flight routes of a swarm, where each UAV has the ability to recognize an object using a specific type of sensor. The experiments described in this article were carried out for drone formation;one drone works as a swarm information hub and exchanges information with the ground control station (GCS). Numerical models for mission planning are presented, which take into account the important constraints, simplifying the description of the mission without too much risk of losing the platforms. Several types of objective functions were used to optimize swarm flight paths. The mission models are presented in the form of mixed integer linear programming problems (MILPs). The experiments were carried out on a terrain model built on the basis of graph and network theory. The method of building a network on which the route plan of a drone swarm is determined is precisely presented. Particular attention was paid to the description of ways to minimize the size of the network on which the swarm mission is planned. The presented methods for building a terrain model allow for solving the optimization problem using integerprogramming tasks.
The use of synthetic fuels is a promising way to reduce emissions significantly. To accelerate cost-effective large-scale synthetic fuel deployment, we optimize a novel 1 MW power-to-liquid (PtL) plant in terms of PtL...
详细信息
The use of synthetic fuels is a promising way to reduce emissions significantly. To accelerate cost-effective large-scale synthetic fuel deployment, we optimize a novel 1 MW power-to-liquid (PtL) plant in terms of PtL-efficiency and fuel production costs. For numerous plants, the available waste heat and temperature level depend on the operating point. To optimize efficiency and costs, the choice of the operating point is included in the heat exchanger network synthesis. All nonlinearities are approximated using piecewise linear models and transferred to MILP. Adapting the epsilon constraint method allows us to solve the multi-criteria problem with uniformly distributed solutions on the Pareto front. We improved the lowest production costs of 1.89 euro/kg and the highest efficiency of 58.08 % from the conventional design process to 1.83 euro/kg and 61.33 %. By applying the presented method, climate-neutral synthetic fuels can be promoted and emissions can be reduced in the long term.
This article introduces an advanced solution to optimize street sweeping operations by extending a multi-depot arc routing problem. The key enhancement involves flexible end depot assignments, where vehicles start and...
详细信息
This article introduces an advanced solution to optimize street sweeping operations by extending a multi-depot arc routing problem. The key enhancement involves flexible end depot assignments, where vehicles start and conclude shifts at designated depots. A notable constraint requires subsequent shifts to begin from the destination depot of the preceding shift. The problem involves servicing highway exclusively during night shifts, while other arc types can be addressed during both day and night. The objective is to identify optimal shifts meeting practical criteria while adhering to constraints like maximum shift duration. To address this, a mixed-integerlinearprogramming (MILP) model is presented. It aims to minimize the number of shifts and total travel time. Given the computational complexity of large instances, an adaptive large neighbourhood search (ALNS) metaheuristic was developed. This approach incorporates specialized operators that address unique attributes such as arc type and depot assignments, ensuring arcs are repositioned based on their type and proximity to depots. This tailored approach provides a distinct advantage over classical ALNS operators, as numerical tests indicate that the specialized operators are more efficient in comparison. The approach is evaluated on larger and a real-world instances, demonstrating notable performance in solution quality and computational efficiency.
Because of global warming, interest in low carbonization applications has grown worldwide. In Japan, efforts are underway to build a power system with low carbonization because it is necessary to reduce emissions in t...
详细信息
ISBN:
(纸本)9781665485227
Because of global warming, interest in low carbonization applications has grown worldwide. In Japan, efforts are underway to build a power system with low carbonization because it is necessary to reduce emissions in the electric power sector, which has the highest rate of CO2 emissions. As ammonia and hydrogen are known as carbon-free fuels, their use as fuels has considerable attention. An important concern in Japan is its low energy self-sufficiency ratio. Although introducing renewable energy has improved the energy self-sufficiency rate, it is necessary to store the surplus power because renewable energy sources do not have a supply-demand adjustment function. In this study, we propose a model that can optimize the operating status of power plants while enhancing the domestic manufacturing rate of ammonia. To verify the proposed model, we performed numerical simulations for eight cases.
This paper deals with an open shop scheduling problem in which sequence-dependent setup times are present. In open shops there are no restrictions on the processing route of each job, so the decision regards not only ...
详细信息
This paper deals with an open shop scheduling problem in which sequence-dependent setup times are present. In open shops there are no restrictions on the processing route of each job, so the decision regards not only the sequencing of jobs on each machine, but also the sequencing of operations (machines) for each job. These type of problems typically arise in application contexts where the order in which the operations are executed is irrelevant. In this work a novel heuristic approach based on mathematical programming, i.e., a matheuristic, is developed and its performance is assessed through a computational study on open shop benchmark instances. Copyright (C) 2022 The Authors.
In this paper, the mixed integer linear programming (MILP) model is improved for searching differential characteristics of block cipher Midori-64, and 4 search strategies of differential path are given. By using strat...
详细信息
In this paper, the mixed integer linear programming (MILP) model is improved for searching differential characteristics of block cipher Midori-64, and 4 search strategies of differential path are given. By using strategy IV, set 1 S-box on the top of the distinguisher to be active, and set 3 S-boxes at the bottom to be active and the difference to be the same, then we obtain a 5-round differential characteristics. Based on the distinguisher, we attack 12-round Midori-64 with data and time complexities of 2(63) and 2(103.83), respectively. To our best knowledge, these results are superior to current ones.
Due to the significance of environmental and economic topics and limited resources, integrating Circular Economy (CE) principles is necessary for Supply Chain (SC) to improve sustainable competitive advantage. The int...
详细信息
Due to the significance of environmental and economic topics and limited resources, integrating Circular Economy (CE) principles is necessary for Supply Chain (SC) to improve sustainable competitive advantage. The integration of CE in SCs leads to a Closed-Loop Supply Chain Network Design (CLSCND) and a circular SC to achieve the economic, environmental, and social aspects of outputs and processes. On the other hand, the integration of CE in CLSCND faces hybrid uncertainties in different time horizons and scenarios due to the strategic and long-term nature of decisions. Due to the impact of random and cognitive uncertainties in the long term, it is necessary to consider these factors in the integration of CE in CLSCND. So, the aim of the present study is CLSCND to achieve the principles of CE and provide a robust scenario-based possibilistic-stochastic programming approach to consider cognitive and random uncertainties simultaneously. The contributions and innovations of the present study are the integration of CE in CLSCND, considering cognitive and random uncertainties at the same time, developing the Me criterion to achieve flexible solutions based on the convex combination of opinions of experts, and proposing the use of the absolute possible deviation to consider the possibilistic deviation. A case study was investigated for CLSCND in the paper industry to assess the presented approach, and the results indicated the accuracy and robustness of the solutions. The numerical simulation results demonstrated the appropriate performance of the proposed method, that the lowest average and standard deviation values of the constraints violation were 601 and 48, respectively, in the developed approach. Analytical findings show that implementing CE in the paper CLSCND provides insights for managers in demand and capacity constraint violations based on different risk levels. Also, this study offers a comprehensive framework for presenting robustness and flexible solutions i
Decentralized supply chain operation in India adds to inefficiency in management and control difficulties for perishable product supply chain (PPSC). One of the important categories of factors that underly the problem...
详细信息
Decentralized supply chain operation in India adds to inefficiency in management and control difficulties for perishable product supply chain (PPSC). One of the important categories of factors that underly the problem in supply chain is the establishment of processing units that results in end - product distribution. This paper presents an optimal establishment of processing unit around production area for apple supply chain as a case study of India. This study proposed amalgamation of mixed integer linear programming (MILP) and colored petri nets (CPN) to model the PPSC. The mathematical model was set up in regard with capacity of processing unit and transportation cost with continuation in partner selection using MILP approach. The simulation model directs the maximization of system performance by running in CPN environment. The values of the results are subjected to transportation cost and production area with estimate of 25% loss during post harvesting such as transportation and environmental variation. The results corresponding to the case study provided an optimal establishment of processing units. Further, the specific partner associated with the facility and transportation cost. Decision-makers can identify the set of partners from the set of facilities dependent upon the transportation cost for further supply of product using a threshold values. Thereby, the model can be used as a decision-making system for processing companies to result in efficient PPSC management. The developed model was tested and validated on case study to demonstrate our approach's applicability.
暂无评论