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

Strategic Optimization of Electric Vehicle Charging Station Placement in Romania

Operations Research Forum 2025年第2期6卷 1-17页

作者： Popa, Alexandru Sîrbu, Tiberiu-Iulian Department of Computer Science University of Bucharest Regina Elisabeta Bld. Bucharest 030018 Romania

The article studies a variant of the facility location problem applied for electric vehicle charging station infrastructure in Romania. The best places are chosen from the locations without a charging station to minimize a combination between the maximum distance from a location without a charging station to the closest location with a charging station, the total electricity consumption of each location, the CO2 emission for each city based on the electrical grid configuration, and the electric vehicles penetration rate for respective locations. A formulation using mixed integer linear programming is presented, along with the results of the conducted simulations. © The Author(s) 2025.

关键词： Facility location problem Infrastructure planning mixed integer linear programming Optimization

来源：评论

学校读者我要写书评

暂无评论

Solving an Integrated Project Portfolio Selection and Contractor Selection Problem: Fuzzy Goal programming Based on Fuzzy Preference Relations

引用

FUZZY INFORMATION AND ENGINEERING 2025年第1期17卷 75-107页

作者： Zahedirad, Mostafa Khalili-Damghani, Kaveh Ghezavati, Vahidreza Komijan, Alireza Rashidi Islamic Azad Univ Dept Ind Engn South Tehran Branch Tehran *** Iran Islamic Azad Univ Dept Ind Engn Sci & Res Branch Tehran *** Iran

Several factors affect the flexibility and the complexity of the project selection and the contractor selection problems. Project portfolio managers are expected to select the best combination of projects and contractors considering multiple conflicting objectives in a multi-period planning horizon. In this paper, we propose an integrated project portfolio optimization and contractor selection problem. The problem is modeled through a multi-objective mixed integer linear programming (MILP) model. Three solution approaches including Goal programming (GP), Fuzzy Goal programming (FGP), and fuzzy goal programming considering a fuzzy preference relationship are proposed. All solution approaches have been applied to a real case. The computational results show the out performance of FGP considering fuzzy relations. The time complexity of the proposed models in the sense of the relation of CPU time and the number constraints and variables of the models were discussed.

关键词： integer programming Computational modeling programming Planning mixed integer linear programming Complexity theory Time complexity Portfolios Optimization project selection contractor selection multi-objective mixed integer programming goal programming fuzzy goal programming fuzzy preference relation

来源：评论

学校读者我要写书评

暂无评论

Multi-period Planning of Municipal Solid Waste Management: a Case Study in Qingdao

引用

PROCESS INTEGRATION AND OPTIMIZATION FOR SUSTAINABILITY 2023年第1-2期7卷 107-126页

作者： Zhao, Shifen Ren, Tiantian Ma, Lei Li, Zhiwei Shanxi Jinhuankeyuan Environm Resources Technol C Taiyuan 030024 Peoples R China Shanxi Jinzhong Municipal Ecol & Environm Monitor Jinzhong 030600 Peoples R China Beijing Inst Petrochem Technol Sch New Mat & Chem Engn Beijing 102617 Peoples R China Hefei Univ Technol Sch Chem & Chem Engn Hefei 230009 Peoples R China

With the increase of population and the improvement of people's living standards, the amount of municipal solid waste (MSW) increases rapidly. It is a challenge for the cities in developing countries to deal with these MSW economically and environmentally. This paper proposed an integrated framework which combines the grey system theory and mathematical programming model to deal with MSW management. First, the factors affecting MSW generation are analyzed and screened out by grey correlation analysis. The factors with higher priority are selected to perform the regression analysis. The generation of MSW is predicted based on the grey model GM (1,1). Second, a multi-period planning model is proposed to optimize MSW management of Qingdao City, China. The model is formulated as mixed integer nonlinear programming (MINLP) model for the scenario with variable capacities of treatment plants and mixed integer linear programming (MILP) for the scenario with given capacities of treatment plants. Four different scenarios are considered: minimum cost scenario with and without variable capacities, minimum carbon emissions with and without variable capacities. The results indicate that the average cost of MSW treatment for the minimum cost scenario with and without variable capacities is 28.32$/t and 27.92 $/t, respectively. The average carbon emission for the minimum emission scenario with and without variable capacities is 0.751 t CO2/t MSW and 0.721 t CO2/t MSW, respectively. This shows the variable expansion capacities of disposal technologies could reduce the cost and carbon emission of MSW treatment compared with the scenario with given capacities. The findings are useful for the decision-maker to adopt effective policy for MSW management. It provides a systematic method for MSW management for other developing countries.

关键词： Municipal solid waste Grey model Multiple regression analysis mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A multi-objective optimization approach for designing a sustainable supply chain considering carbon emissions

引用

INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT 2023年第5期15卷 1777-1793页

作者： Kumar, Amit Kumar, Kaushal Univ Delhi Fac Math Sci Dept Operat Res Delhi India

Greenhouse gases (GHGs) emission has been growing for decades, that has resulted in serious environmental problems. Many researches have focused on production planning in supply chains that are primarily attributed to objectives of cost minimization and profit maximization. There has been limited research concentrated on emission of GHGs (e.g. CO2, N2O, CH4) from industrial activities. The social concern of air pollution is the motivation towards the proposed study. In this study, we propose an optimization model for designing a sustainable supply chain management (SSCM) network that attempts to reduce carbon emission, improve social benefits and eventually improve customer experience. The optimization model is a multi objective mixed integer linear programming (MILP) formulation. The proposed model is a multi raw-material, multi-product, multi-period, multi-sites model that focuses on improving three dimensions of sustainability: viz. economic, environmental and social. Model performance is demonstrated through numerical experiments. The authors are currently working on solution algorithm for solving larger instances of the proposed model.

关键词： Greenhouse gas emission Sustainable supply chain Production planning Carbon emission mixed integer linear programming Multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

Optimal Multi-Constrained Workflow Scheduling for Cyber-Physical Systems in the Edge-Cloud Continuum 48

Optimal Multi-Constrained Workflow Scheduling for Cyber-Phys...

引用

48th Annual IEEE International Computers, Software, and Applications Conference (COMPSAC) - Digital Development for a Better Future

作者： Kouloumpris, Andreas Stavrinides, Georgios L. Michael, Maria K. Theocharides, Theocharis Univ Cyprus Dept Elect & Comp Engn KIOS Res & Innovat Ctr Excellence Nicosia Cyprus

ISBN: (纸本)9798350376975;9798350376968

The emerging edge-hub-cloud paradigm has enabled the development of innovative latency-critical cyber-physical applications in the edge-cloud continuum. However, this paradigm poses multiple challenges due to the heterogeneity of the devices at the edge of the network, their limited computational, communication, and energy capacities, as well as their different sensing and actuating capabilities. To address these issues, we propose an optimal scheduling approach to minimize the overall latency of a workflow application in an edge-hub-cloud cyber-physical system. We consider multiple edge devices cooperating with a hub device and a cloud server. All devices feature heterogeneous multicore processors and various sensing, actuating, or other specialized capabilities. We present a comprehensive formulation based on continuous-time mixed integer linear programming, encapsulating multiple constraints often overlooked by existing approaches. We conduct a comparative experimental evaluation between our method and a well-established and effective scheduling heuristic, which we enhanced to consider the constraints of the specific problem. The results reveal that our technique outperforms the heuristic, achieving an average latency improvement of 13.54% in a relevant real-world use case, under varied system configurations. In addition, the results demonstrate the scalability of our method under synthetic workflows of varying sizes, attaining a 33.03% average latency decrease compared to the heuristic.

关键词： scheduling workflow cyber-physical system edge-cloud mixed integer linear programming optimization

来源：评论

学校读者我要写书评

暂无评论

Job shop planning and scheduling of reconfigurable manufacturing systems

引用

OPERATIONS MANAGEMENT RESEARCH 2025年 1-22页

作者： Imsetif, Jad Nezamoddini, Nasim Aqlan, Faisal Oakland Univ Ind & Syst Engn 115 Lib Dr Rochester MI 48309 USA Univ Louisville Dept Ind Engn 132 Eastern Pkwy Louisville KY 40292 USA

The fourth industrial revolution (Industry 4.0) has enabled rapid product variations and technological developments such as reconfigurable manufacturing systems (RMSs). Planning and scheduling in RMS differ from traditional systems;therefore, the manufacturing industry has faced implementation barriers. This research proposes a new mixed-integer linear programming (MILP) formulation for process planning and scheduling in RMSs. The formulation, considers new aspects such as number of products, their quantity and complexity, calibration rate, work-in-process (WIP), and inventory management. Moreover, this research promotes RMS effectiveness for business and provides new insights on the effects of different factors on the overall performance. The applicability of the proposed formulation is illustrated with a case study. The results showed that RMS outperforms a traditional system with 30% savings in cost and up to a 25% increase in demand fulfillment. Sensitivity analyses are conducted to investigate the effect of different parameters on the cost-effectiveness of RMS compared to traditional manufacturing systems. Analysis of variance (ANOVA) highlighted the importance of the reconfigurability of the machines compared to other settings

关键词： Reconfigurable manufacturing systems mixed integer linear programming Optimization Sensitivity analyses Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Mathematical formulations for the scheduling of unrelated parallel machines considering machine availability and eligibility

引用

EXPERT SYSTEMS WITH APPLICATIONS 2025年 284卷

作者： Uribe, Alejandro Otamendi, Urtzi Artetxe, Arkaitz Rivera, Juan Carlos Univ EAFIT Sch Appl Sci & Engn Carrera 49 N 7 Sur 50 Medellin 05001 Antioquia Colombia Vicomtech Fdn Basque Res & Technol Alliance Donostia San Sebastian 20009 Spain Univ Basque Country UPV EHU Dept Comp Sci & Artificial Intelligence Donostia San Sebastian 20009 Spain

Job scheduling in manufacturing companies faces potential challenges due to varying job durations per machine, working calendar structures, and preventive maintenance. This must be considered to avoid unplanned outages and respect planned downtime. This research contrasts two literature-derived models with a novel approximation to solve the Unrelated Parallel Machine scheduling problem (UPM), incorporating machine availability and eligibility constraints. The implemented models address the optimization of two major metrics: the makespan, and the completion time of the last shift used. Minimizing these measurements is crucial to maximize system efficiency and reduce high-demand industries' operating costs. The models differ in their structure and how they were conceptualized. Model 1 uses sequence-dependent variables, offering detailed job sequencing but increasing problem size as job counts rise. Model 2 simplifies by assigning jobs to machines and shifts without sequencing, improving computational efficiency but compromising detail. Model 3, the novel proposal of this research, balances detail and efficiency by incorporating start-time-dependent variables, suitable for large-scale problems. Tests were performed varying the number of jobs, machines, shift lengths, and mean job durations. The results show that Models 2 and 3 outperform at makespan minimization, obtaining an optimal solution to almost all benchmark instances within an hour. Model 1 struggles with scalability, achieving less than 0.5% GAP in 69 out of 96 small instances and failing for larger setups. For the cases where the minimization of the completion time of the last operating shift is considered, all models improve computational times and GAPs. These findings guide the selection of scheduling models based on available computational resources and detailed planning needs in high-demand industrial environments.

关键词： UPM Scheduling Shifts Makespan mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Minimum-Cost Routing of two UAVs with Communication Constraints

Minimum-Cost Routing of two UAVs with Communication Constrai...

引用

AIAA SciTech Forum

作者： Moorthy, Karthik Kumar, Deepak Prakash Darbha, Swaroop Bihl, Trevor Rathinam, Sivakumar Texas A&M Univ Mech Engn 3123 TAMU College Stn TX 77843 USA Air Force Res Lab Sensing Management Branch Dayton OH 45433 USA

ISBN: (数字)9781624107115

ISBN: (纸本)9781624107115

This paper proposes a formulation to determine the routes of two unmanned aerial vehicles (UAVs) traveling in lockstep fashion, maintaining within a specified proximity of one another, to cooperatively cover all targets in minimum time. The results of this study provide a framework for UAV mission planning or other applications where multiple UAVs are required to travel synchronously to visit a given set of targets while keeping within a distance of one another to maintain communication. A mixed integer linear Program (MILP) is formulated to determine this minimum cost tour for both UAVs. This MILP is computationally expensive to solve which makes it impractical to obtain solutions as the problem size scales up. Therefore, a local search heuristic was formulated to approximate the optimal solutions in a quicker manner. The quality of the heuristic was measured by comparing its solutions against those from a linear programming model (LP) serving as a lower bound to the optimal solution. To observe the relationship between the problem size and the heuristic solution quality, randomly generated instances of.. = 20 to.. = 100 targets were simulated in 32.. by 32.. unit grids, varying the proximity limit from 15-30 units. It was found that the heuristic consistently delivered higher-quality solutions when smaller UAV proximity value requirements were imposed. Specifically, the heuristic solutions deviated 23-35% from the LP solutions when the proximity limit imposed was 15 units.

关键词： Unmanned Aerial Vehicle mixed integer linear programming linear programming Python Robots Aerospace Engineering Heuristic Approach Military Operations Search Algorithm Greedy Algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Algorithm of Cargoes Transportation Scheduling in the Transport Network

引用

AUTOMATION AND REMOTE CONTROL 2023年第9期84卷 993-1004页

作者： Ignatov, A. N. Moscow Inst Aviat Technol Moscow Russia

The problem of cargoes transportation scheduling in the transport network represented by an undirected multigraph is considered. Transportations between vertices are provided at predefined time intervals. The iterative algorithm to search for a solution approximate to the optimal one by criterion value is proposed in the problem under consideration. The algorithm is constructed on the base of solutions of mixed integer linear programming problems. The applicability of the algorithm is tested by the example with more than 90 million binary variables.

关键词： transport network multigraph cargoes transportation schedule mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Practical Reference Network Planning Model Based on Load Moment and Acceptable Range 2

A Practical Reference Network Planning Model Based on Load M...

引用

IEEE 2nd International Conference on Power Science and Technology (ICPST)

作者： Li, Jianjie Zhong, Wentao Mu, Mingliang Wang, Jialiang Binzhou Power Supply Co State Grid Shandong Prov Power Co Binzhou Peoples R China Shandong Univ Minist Educ Key Lab Power Syst Intelligent Dispatch & Control Jinan Peoples R China

ISBN: (纸本)9798350349047;9798350349030

There is a big gap between theoretical research and practical application of reference network planning. Most of the existing planning models in academic research take cost as the objective function. Although various advanced models and methods are proposed based on this, they are rarely applied in actual power companies. In this paper, a new reference network planning model is proposed according to the actual demand. According to the field investigation, "power supply to the nearest load" is taken as the goal, and the load moment is expressed analytically. In order to meet the increasing demand of renewable energy integrating into the power grid, the concept of acceptable disturbance range is added to the model constraint to improve the system's absorption capacity of renewable energy. Finally, the N-1 security constraint is considered to improve the reliability of the model. The model is transformed into a mixed integer linear programming (MILP)problem by priority objective programming method and can be solved with mature commercial solvers. The validity of the model is verified by IEEE-RTS24 node system. When N-1 safety constraints are taken into account, the advantages of the proposed model become apparent, with a total cost reduction of about 2.5%.

关键词： reference network planning load moment acceptable disturbance range N-1 security constraint mixed integer linear programming priority objective programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：