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

mixed integer linear programming model for Vehicle Routing Problem for Hazardous Materials Transportation

IFAC-PapersOnLine 2016年第12期49卷 538-543页

作者： Bula, Gustavo Alfredo Gonzalez, Fabio Augusto Prodhon, Caroline Afsar, H. Murat Velasco, Nubia Milena System and Industrial Engineering Deparment Universidad Nacional de Colombia Bogotá Colombia ICD-LOSI Université de Technologie de Troyes Troyes Cedex10004 France School of Management Universidad de los Andes Bogotá Colombia

This paper presents a mathematical model to solve the Heterogeneous Vehicle Routing Problem (HVRP) in the context of hazardous materials (HazMat) transportation. To evaluate the model a linear approximation of the total routing risk is used as objective function. In the first stage a routing risk measure is proposed as a nonlinear function of the truck load. This function is approximated by means of two different piecewise linear functions (PLF). A genetic algorithm is employed to estimate the interval limits of PLF. These two functions are utilized to approximate the total routing risk for the best known solution for the benchmark instances of HVRP with fixed costs and unlimited fleet, both approaches are compared with the nonlinear risk function value. In the second stage the best piecewise linear approximation of the routing risk is integrated to a mixed integer linear programming (MILP) model for solving the risk optimization problem. The final model is tested on HVRP instances with 20 nodes. Results show that total cost minimization and total risk minimization appear to be conflicting objectives. © 2016

关键词： integer programming Benchmarking Genetic algorithms Hazardous materials Hazards Materials handling Operations research Piecewise linear techniques Risk assessment Risk management Vehicle routing Hazardous materials transportation Heterogeneous vehicles mixed integer linear programming model Piece wise linear functions Piecewise linear approximations Risk minimization Total cost minimizations Vehicle Routing Problems

来源：评论

学校读者我要写书评

暂无评论

mixed integer linear programming model for Scheduling Burn-in Ovens to Minimize Total Weighted Earliness/Lateness 5

Mixed Integer Linear Programming Model for Scheduling Burn-i...

引用

5th IEEE International Conference on Recent Advances and Innovations in Engineering (IEEE - ICRAIE)

作者： Pujara, Dhaval Jayendrakumar Mathirajan, Muthu Indian Inst Sci Dept Management Studies Bengaluru 560012 India

ISBN: (纸本)9781728188676

This study deals with scheduling of Burn-in Oven (BO), a Batch Processing Machine (BPM) in the testing stage of Semiconductor Manufacturing (SM) process. We consider a new problem configuration, close to real-life machining environment, wherein multiple BOs having different capacity are employed parallelly to process the variety of jobs. Jobs have non-agreeable release date & due date, non-identical processing time and non-identical job size. An early completion of job at BO is penalized with earliness penalty whereas late completion of job at BO causes a lateness penalty. In the current Just in Time (JIT) manufacturing scenario, an organization aims to minimize both the penalties (cost). Hence, this study aims to minimize the total weighted earliness/lateness of the jobs. We propose a mixed integer linear programming (1VIILP) model for dynamic scheduling of (a) single, and (b) multiple BOs. Each of the proposed MILP are validated by developing a suitable numerical example.

关键词： Scheduling Burn-in Oven Batch Processing Machine mixed integer linear programming model Total weighted earliness/lateness

来源：评论

学校读者我要写书评

暂无评论

Variant mixed integer linear programming model for Merchandises Optimization in Fast-Moving Consumer Goods Industry 6th

Variant Mixed Integer Linear Programming Model for Merchandi...

引用

6th International Conference on Cognitive Computing (ICCC) Held as Part of the Services Conference Federation (SCF)

作者： He, Yang Zeng, Huiqin Peng, Lu Ning, Yishuang Kingdee Int Software Grp Co Ltd Kingdee Res Wan Chai Peoples R China

ISBN: (纸本)9783031235849;9783031235856

With the continuous development of economic globalization and the spread of the new crown epidemic, enterprises face more intense market competition and insufficient market share. Companies in the fast-moving consumer goods (FMCG) industry must continuously improve their profitability and profitability. In a series of processes such as "production", "sales" and "new product research and development", the company's efficiency is improved, costs are reduced, and the core competitiveness of the company is formed. To address the issues such as enterprise cost input, capital allocation and production decision, we utilize a variant mixed integer linear programming model to establish decision rules and apply the analysis and quantification methods to make overall arrangements for the limited resources in the economic management system, such as human, financial andmerchandise. We also provide scientific quantitative basis and sustainable solutions for enterprise management decision makers.

关键词： mixed integer linear programming model Merchandises optimization Decision rules

来源：评论

学校读者我要写书评

暂无评论

Differential analysis of the NBC algorithm based on mixed integer linear programming model

引用

SECURITY AND PRIVACY 2023年第4期6卷

作者： Zhang, Lan Yu, Bin He, Liangsheng Zhengzhou Informat Sci & Technol Inst Zhengzhou Peoples R China State Cryptog Adm Beijing Peoples R China Zhengzhou Informat Sci & Technol Inst Zhengzhou 450001 Peoples R China

This paper mainly studies mixed integer linear programming (MILP)-based cryptanalysis on round-reduced NBC algorithm with generalized Feistel structure. First, each component of the algorithm is equivalently described by linear inequality equations, and the propagation rules of differential characteristics and linear approximation are described, and an automatic search algorithm model of differential mode and linear mask mode based on MILP is established, and the minimum number of active S-boxes and the corresponding differential mode and linear mask mode paths are obtained. Second, according to the NBC algorithm's 16-bit block pull-wire position permutation characteristics, the optimal full diffusion rounds of NBC-128 algorithm and NBC-256 algorithm are obtained by using approximate matrix multiplication theory to be six and eight respectively. Finally, based on the optimal number of full diffusion rounds of the algorithm, an automatic search algorithm model of impossible differential cryptanalysis is established, and the set of input differential patterns is traversed to obtain 11-round impossible differential distinguishers of NBC-128 algorithm and 14-round impossible differential distinguishers of NBC-256 algorithm respectively.

关键词： differential cryptanalysis impossible differential cryptanalysis linear cryptanalysis mixed integer linear programming model the NBC algorithm

来源：评论

学校读者我要写书评

暂无评论

Vehicle and onboard UAV collaborative delivery route planning:considering energy function with wind and payload

引用

Journal of Systems Engineering and Electronics 2025年第1期36卷 194-208页

作者： GUO Jingfeng SONG Rui HE Shiwei Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Beijing Jiaotong UniversityBeijing 100044China

The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery *** and onboard UAV collaborative delivery is introduced as a novel delivery *** collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route *** paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and *** address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and ***,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions *** effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.

关键词： vehicle and onboard unmanned aerial vehicle(UAV)collaborative delivery energy consumption function route planning mixed integer linear programming model adaptive large neighborhood search(ALNS)algorithm

来源：评论

学校读者我要写书评

暂无评论

Modified Simulated Annealing Algorithm for Drone and Truck Routing Problem 24th

Modified Simulated Annealing Algorithm for Drone and Truck R...

引用

24th International Symposium for Production Research, ISPR 2024

作者： Aral, İlayda Özkan, Onur Kizilay, Damla Industrial Engineering Department Izmir Democracy University Izmir Turkey

ISBN: (纸本)9783031836107

This study addresses the vehicle routing problem with different vehicle types such as drones and trucks, where trucks make a single tour and drones make multiple tours. All vehicle types move independently of each other and leave the depot, serve customers, and return to the depot. While trucks are allowed to go to more than one customer on a single tour, drones are allowed to go to only one customer on a single tour due to their low payload capacities. Truck loading capacity, drone payload capacity, and drone charging capacity were taken into account. Drones are allowed to make multi-tours during one charging period. Some special customers are served only by drones or only by trucks. The problem aims to minimize total tardiness according to the customer's due dates by determining the routes of all vehicle types and customer visit orders. For this purpose, a new mixed integer linear mathematical model (MILP) has been developed. Optimal results were obtained with the MILP model for small data sets containing various combinations of the number of customers and vehicles. The simulation annealing (SA) algorithm was developed in order to find a feasible solution in large data sets in a short time. In this algorithm, swap move-based and two-stage neighborhood search methods are used. While the SA algorithm finds the optimal results found by the MILP model for small data sets, it can also find feasible solutions for large data sets in a very short time. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Drone and truck routing mixed integer linear programming model Simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

A memory structure adapted simulated annealing algorithm for a green vehicle routing problem

引用

ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH 2015年第5期22卷 3279-3297页

作者： Kucukoglu, Ilker Ene, Seval Aksoy, Asli Ozturk, Nursel Uludag Univ Fac Engn Dept Ind Engn TR-16059 Bursa Turkey

Currently, reduction of carbon dioxide (CO2) emissions and fuel consumption has become a critical environmental problem and has attracted the attention of both academia and the industrial sector. Government regulations and customer demands are making environmental responsibility an increasingly important factor in overall supply chain operations. Within these operations, transportation has the most hazardous effects on the environment, i.e., CO2 emissions, fuel consumption, noise and toxic effects on the ecosystem. This study aims to construct vehicle routes with time windows that minimize the total fuel consumption and CO2 emissions. The green vehicle routing problem with time windows (G-VRPTW) is formulated using a mixed integer linear programming model. A memory structure adapted simulated annealing (MSA-SA) meta-heuristic algorithm is constructed due to the high complexity of the proposed problem and long solution times for practical applications. The proposed models are integrated with a fuel consumption and CO2 emissions calculation algorithm that considers the vehicle technical specifications, vehicle load, and transportation distance in a green supply chain environment. The proposed models are validated using well-known instances with different numbers of customers. The computational results indicate that the MSA-SA heuristic is capable of obtaining good G-VRPTW solutions within a reasonable amount of time by providing reductions in fuel consumption and CO2 emissions.

关键词： Green logistics Fuel consumption CO2 emissions Green vehicle routing problem mixed integer linear programming model Simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

An appointment scheduling framework to balance the production of blood units from donation

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2018年第3期265卷 1124-1143页

作者： Bas, Seda Carello, Giuliana Lanzarone, Ettore Yalcindag, Semih Yeditepe Univ Ind & Syst Engn Dept Istanbul Turkey Politecn Milan DEIB Milan Italy CNR IMATI Milan Italy

Blood is fundamental in several care treatments and surgeries, and plays a crucial role in the health care system. It is a limited resource, as it can be produced only by donors and its shelf life is short;thus, the blood donation (BD) system aims at providing adequate supply of blood units to transfusion centers and hospitals. An effective collection of blood units from donors is fundamental for adequately feeding the entire BD system and optimizing blood usage. However, despite its relevance, donation scheduling is only marginally addressed in the literature. In this paper we consider the Blood Donation Appointment Scheduling (BDAS) problem, aiming at balancing the production of the different blood types among days in order to provide a quite constant feeding of blood units to the BD system. We propose a framework for the appointment reservation that accounts for both booked donors and donors arriving without a reservation. It consists of an offline mixed integer linear programming (MILP) model for preallocating time slots to blood types, and an online prioritization policy to assign a preallocated slot when the donor calls to make the reservation. (C) 2017 Elsevier B.V. All rights reserved.

关键词： OR in health systems Blood Donation Appointment Scheduling Production balancing mixed integer linear programming model Offline and online procedure

来源：评论

学校读者我要写书评

暂无评论

A multi-objective electromagnetism algorithm for a bi-objective hybrid no-wait flowshop scheduling problem

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2014年第9-12期70卷 1591-1601页

作者： Khalili, Majid Islamic Azad Univ Karaj Branch Dept Ind Engn Karaj Iran

This article studies multi-objective hybrid no-wait flowshop scheduling problems to minimize both makespan and total tardiness. This article mathematically formulates the problem using an effective multi-objective mixed integer linear programming models. Since the problem is NP-hard and it is difficult to find an optimal solution in a reasonable computational time, an efficient multi-objective electromagnetism algorithm (MOEA) is presented as the solution procedure. Electromagnetism algorithm is known as a flexible and effective population-based algorithm utilizing an attraction/repulsion mechanism to move the particles towards optimality. MOEA is carefully evaluated for its performance against multi-objective immune algorithms and the adaptation of a well-known multi-objective simulated annealing in the relevant literature by means of multi-objective performance measures and statistical tools. The results show that the proposed solution method outperforms the others.

关键词： Hybrid no-wait flowshop scheduling Multi-objective electromagnetism algorithm Makespan Total weighted tardiness mixed integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Green optical orthogonal frequency-division multiplexing networks

引用

IET OPTOELECTRONICS 2014年第3期8卷 137-148页

作者： El-Gorashi, Taisir E. H. Dong, Xiaowen Elmirghani, Jaafar M. H. Univ Leeds Sch Elect & Elect Engn Leeds LS2 9JT W Yorkshire England Huawei Technol Co Ltd Shannon Lab Huawei Ind Base Shenzhen Peoples R China King Abdulaziz Univ Dept Elect & Comp Engn Jeddah 21413 Saudi Arabia

Orthogonal frequency-division multiplexing (OFDM) has been proposed as an enabling technique for elastic optical networks to support heterogeneous traffic demands by enabling rate and modulation adaptive bandwidth allocation. The authors investigate the energy efficiency of optical OFDM-based networks. A mixed integer linear programming model is developed to minimise the total power consumption of rate and modulation adaptive optical OFDM networks. Considering a symmetric traffic, the results show that optical OFDM-based networks can save up to 31% of the total network power consumption compared to conventional Internet protocol over wavelength division multiplexing (WDM) networks. Considering the power consumption of the optical layer, the optical OFDM-based network saves up to 55% of the optical layer power consumption. The results also show that under an asymmetric traffic scenario, where more traffic is destined to or originates from popular nodes, for example data centres, the power savings achieved by the optical OFDM-based networks are limited as the higher traffic demands to and from data centres reduce the bandwidth wastage associated with conventional WDM networks. Furthermore, the achievable power savings through data compression have been investigated, considering an optical OFDM-based network.

关键词： bandwidth allocation energy conservation integer programming linear programming OFDM modulation optical communication optical fibre networks power consumption green optical orthogonal frequency-division multiplexing networks OFDM elastic optical networks heterogeneous traffic demands modulation adaptive bandwidth allocation rate adaptive bandwidth allocation energy efficiency mixed integer linear programming model symmetric traffic network power consumption Internet protocol wavelength division multiplexing networks WDM optical layer power consumption power savings data centres bandwidth wastage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：