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

Operations Research, Data Analytics and Logistics 2025年 45卷

作者： Andrea Pirabán-Ramírez William Javier Guerrero-Rueda Nacima Labadie Doctorado en Logística y Gestión de Cadenas de Suministros Universidad de La Sabana Campus Puente del Común Km. 7 Autopista Norte de Bogotá. Chía Cundinamarca Colombia Computer Science and Digital Society Laboratory (LIST3N) University of Technology of Troyes 12 Rue Marie Curie CS 42060 10004 Troyes CEDEX France School of Engineering Universidad de La Sabana Campus Puente del Común Km. 7 Autopista Norte de Bogotá. Chía Cundinamarca Colombia

The efficient management of the blood supply chain is paramount, given its critical impact on human lives if improperly handled. This research focuses on the location of mobile collection sites over a multiperiod horizon and transferring blood units from these sites to blood centers using a multi-trip shuttle fleet. The goal is to minimize the total cost comprising the transportation, delay, wastage, and shortage costs. The model considers constraints such as the tight time limit between the collection and processing of platelets and cryoprecipitates. Additionally, collection levels at donation sites are modeled assuming linear increasing rates. First, the problem is modeled as a mixed-integer linear program; then, a hybrid iterative local search is designed as a solution approach. The effectiveness and applicability of the proposed method are evaluated through a set of 39 new instances based on the blood collection system of Bogota, Colombia, which demonstrates promising solutions by systematically computing the best-known solutions.

关键词： BBS Bogota blood system BC blood center BCP blood collection problem BKS best-known solution BSC blood supply chain cryo cryoprecipitate CS collection site ILS iterative local search MILP mixed-integer linear programming MT-TOPIT-IP multi-trip team orienteering problem with integrated tours and increasing profits MT-VRPIP multi-trip vehicle routing problem with increasing profits NP-hard non-deterministic polynomial-time hard PLT platelet VND variable neighborhood descent WB whole blood Healthcare logistics Optimization OR in health services Perishable products Variable profits

来源：评论

学校读者我要写书评

暂无评论

Efficient solution approaches for locating electric vehicle fast charging stations under driving range uncertainty

引用

COMPUTERS & OPERATIONS RESEARCH 2019年第0期109卷 288-299页

作者： Boujelben, Mouna Kchaou Gicquel, Celine UAE Univ Al Ain U Arab Emirates Univ Paris Saclay LRI Paris France

We seek to determine the best locations for electric vehicle fast charging stations under driving range uncertainty. Two stochastic programming based models have been recently proposed to handle the resulting stochastic flow refueling location problem: a first one maximizing the expected flow coverage of the network, a second one based on joint chance constraints. However, significant computational difficulties were encountered while solving large-size instances. We thus propose two efficient solution approaches for this problem. The first one is based on a new location-allocation type model for this problem and results in a MILP formulation, while the second one is a tabu search heuristic. Our numerical experiments show that when using the proposed MILP formulation, the computation time needed to provide guaranteed optimal solutions is significantly reduced as compared to the one needed when using the previously published MILP formulation. Moreover, our results also show that the tabu search method consistently provides good quality solutions within short computation times. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Flow refueling location model Electric vehicle charging station network design Stochastic driving range Stochastic programming mixed-integer linear programming Tabu search

来源：评论

学校读者我要写书评

暂无评论

Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2019年第6期26卷 2432-2449页

作者： Mrad, Mehdi Chalghoumi, Sabrine Ladhari, Talel Gharbi, Anis King Saud Univ Dept Ind Engn Riyadh Saudi Arabia Univ Tunis BADEM Tunis 2059 Tunisia Univ Tunis Ecole Super Sci Econ & Commerciales Tunis 1089 Montfleury Tunis Tunisia Umm Al Qura Univ Coll Business Management Dept Business Adm Mecca Saudi Arabia

We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to release dates. New procedures are proposed for effectively bounding the completion time of a given job that is processed at a given position. New assignment-based lower bounds are derived as well as an enhanced mathematical programming formulation. Our computational analysis shows a consistent tightness of the proposed lower bounds and a high outperformance of the enhanced mathematical formulation with respect to the classical one.

关键词： flowshop total completion time release date lower bounds mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Partially-Decoupled Service Agent - Transport Agent Task Allocation and Scheduling

引用

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 2019年第2期94卷 423-437页

作者： Bays, Matthew J. Wettergren, Thomas A. Naval Surface Warfare Ctr Panama City Div Panama City FL 32407 USA Naval Undersea Warfare Ctr Newport Div Newport RI 02840 USA

We present an approach to performing efficient schedule generation of a heterogeneous team of autonomous agents in a service agent - transport agent scenario where the task allocation and scheduling components are partially-decoupled. In the scenario, service agents must perform tasks at a number of locations. The agents are free to move between locations, however the agents may also be transported throughout the region by a limited number of faster-moving transport agents. The goal of the problem is to plan a schedule of service agent and transport agent actions such that all locations are serviced in the shortest amount of time. While in previous work we formulated the problem as a holistic mixed-integer linear program, we present a novel method to solve the problem in a hierarchical and partially-decoupled manner for faster optimization and to require less information to be processed and communicated in a centralized manner to perform the schedule planning. The original solution method required up to 20 minutes to obtain an efficient solution. The new methodology, using hierarchical task allocation and a bidding-based scheduling algorithm, can create an efficient solution in seconds.

关键词： Multi-agent systems Scheduling Optimization Task allocation mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Towards Lower Bounds on the Depth of ReLU Neural Networks

arXiv

引用

arXiv 2021年

作者： Hertrich, Christoph Basu, Amitabh Di Summa, Marco Skutella, Martin London School of Economics and Political Science London United Kingdom Johns Hopkins University Baltimore United States Università degli Studi di Padova Padua Italy Technische Universität Berlin Berlin Germany

We contribute to a better understanding of the class of functions that can be represented by a neural network with ReLU activations and a given architecture. Using techniques from mixed-integer optimization, polyhedral theory, and tropical geometry, we provide a mathematical counterbalance to the universal approximation theorems which suggest that a single hidden layer is sufficient for learning any function. In particular, we investigate whether the class of exactly representable functions strictly increases by adding more layers (with no restrictions on size). As a by-product of our investigations, we settle an old conjecture about piecewise linear functions by Wang and Sun [74] in the affirmative. We also present upper bounds on the sizes of neural networks required to represent functions with logarithmic depth. Copyright © 2021, The Authors. All rights reserved.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Improving a Production-Inventory Model in the Multi-Machine, Hybrid MTO-MTS Chemical Industry

Improving a Production-Inventory Model in the Multi-Machine,...

引用

作者： T. M. P. Vranken Eindhoven University of Technology

学位级别：硕士

In this research, a redesign is proposed for a production-inventory model in the hybrid MTO-MTS chemical industry. The project, conducted at SABIC, converges from a higher decision making level to a lower decision making level, i. e. from the tactical level to the operational level. First, a general MTO- MTS decision framework is adapted from literature to fit to the problem context at hand. Thereafter, inventory control systems are evaluated and an applicable design for the context is presented. At last, a production planning model integrating a block planning approach is presented for a non-identical parallel machine production environment. The proposed MILP formulation extents current literature on block planning by introducing different types, timings and lengths of blocks, allowing for backorders, and introducing service level constraints. In a case study, the products are partitioned based on the proposed MTO-MTS decision framework and inventory policy parameters are determined for MTS items. A simulation study validated that the new design generated significant cost reductions and increased performance on service levels. Moreover, the planning model is able to decrease the production costs significantly by allocating production orders cost optimal to the different machines.

关键词： make-to-order make-to-stock MTO-MTS partitioning sequence-dependent setups block planning production planning mixed-integer linear programming non-identical parallel machines

来源：评论

学校读者我要写书评

暂无评论

A new approach for scheduling of multipurpose batch processes with unlimited intermediate storage policy

引用

Frontiers of Chemical Science and Engineering 2019年第4期13卷 784-802页

作者： Nikolaos Rakovitis Nan Zhang Jie Li Liping Zhang Centre for Process Integration School of Chemical Engineering and Analytical ScienceThe University of ManchesterManchesterM139PLUK Department of Industrial Engineering School of Machinery and AutomationWuhan University of Science and TechnologyWuhan 430081China

The increasing demand of goods,the high competitiveness in the global marketplace as well as the need to minimize the ecological footprint lead multipurpose batch process industries to seek ways to maximize their productivity with a simultaneous reduction of raw materials and utility consumption and efficient use of processing *** scheduling of their processes can lead facilities towards this *** a great number of mathematical models have been developed for such scheduling,they may still lead to large model sizes and computational *** this work,we develop two novel mathematical models using the unit-specific eventbased modelling approach in which consumption and production tasks related to the same states are allowed to take place at the same event *** computational results demonstrate that both proposed mathematical models reduce the number of event points *** proposed unit-specific event-based model is the most efficient since it both requires a smaller number of event points and significantly less computational time in most cases especially for those examples which are computationally expensive from existing models.

关键词： scheduling multipurpose batch processes simultaneous transfer mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal and sustainable design of integrated biorefineries for microalgae and municipal solid waste processing

引用

Journal of Cleaner Production 2025年 519卷

作者： Ali Elkamel Kate Kim Farzad Hourfar Mohamed Mazhar Laljee Michael Fowler Department of Chemical and Petroleum Engineering Khalifa University Abu Dhabi United Arab Emirates Department of Chemical Engineering University of Waterloo Waterloo Ontario Canada Department of Chemical and Materials Engineering University of Alberta Edmonton Alberta Canada Department of Chemical Engineering Indian Institute of Technology Ropar Rupnagar Punjab India

Increasing pressures on energy resources and the imperative to reduce greenhouse gas emissions are driving the exploration of alternative and viable energy sources. Biomass presents opportunities to produce a variety of valuable products including energy, chemicals, and materials. However, economic uncertainties arise from processing multiple biomass sources, and to address this issue, the current research covers a systematic framework for the optimal design of an integrated biorefinery through superstructure-based optimization, combining microalgae and municipal solid waste (MSW) processing pathways. A case study conducted for Seoul, South Korea—a city grappling with significant solid waste management and energy supply challenges—evaluates the economic feasibility of such an integrated biorefinery. Utilizing mixed-integer linear programming (MILP) in General Algebraic Modeling System (GAMS), the study identifies the optimal configuration for the biorefinery to maximize profitability. Results indicate that the proposed solution not only yields substantial quantities of valuable products but also reduces waste sent to landfills and enhances waste-to-electricity conversion. The end-products of the optimal configuration include all anticipated products except compost. The revenue from the sale of final products and the profit are $1.43 B/yr and $253.86 M/yr respectively for the optimal configuration obtained. Additionally, a sensitivity analysis assessing the impact of varying economic and feedstock conditions on the biorefinery's profitability and viability shows that the proportion of recyclable components in MSW has the biggest impact, followed by the market price of the biodiesel produced. The framework is generic as the superstructure can be modified in line with the requirements of the case at hand by selecting the appropriate feedstocks and technologies. Moreover, the relevant techno-economic parameters and equations can easily be incorporated into the mathemati

关键词： Biorefinery Microalgae Municipal solid waste mixed-integer linear programming Economic feasibility

来源：评论

学校读者我要写书评

暂无评论

A two-stage flow-shop scheme for the multi-satellite observation and data downlink scheduling problem considering weather uncertainties

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2019年第Aug.期188卷 263-275页

作者： Xiao, Yiyong Zhang, Siyue Yang, Pei You, Meng Huang, Jiaoying Beihang Univ Sch Reliabil & Syst Engn Beijing 100191 Peoples R China

An Earth observation satellite (EOS) is a sort of low earth orbit (LEO) satellite that is equipped with high resolution cameras for observing various types of target objects scattered across the surface of the Earth. The available time windows of multiple EOSs for observing a given target object and for downloading the acquired image/video data from satellites to ground receiver stations are scarce resources that should to be utilized efficiently. This problem is hereby named as the multi-satellite observation and data-downlink scheduling problem (MSODSP). We developed a two-stage flow shop scheme for the MSODSP in order to optimize the observation scheduling (at stage 1) and data-downlink scheduling (at stage 2) concurrently and get truly optimized results. A mixed-integer linear programming (MILP) model is developed for the MSODSP with three objective functions. The effects of weather uncertainties on the tasks' success are considered in the MILP model, which allow us to conduct a reliability-maximized task arrangement of EOSs. Computational experiments were conducted on the simulated data of a real LEO satellite to verify the proposed MILP model. The results showed that it was able to solve real-world instances of the MSODSP for up to 20 tasks over 8 days.

关键词： Satellite earth observation Scheduling mixed-integer linear programming Optimization

来源：评论

学校读者我要写书评

暂无评论

A bi-objective model for design and analysis of sustainable intermodal transportation systems: a case study of Turkey

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2019年第19期57卷 6146-6161页

作者： Resat, Hamdi Giray Turkay, Metin Izmir Univ Econ Dept Ind Engn TR-35330 Izmir Turkey Koc Univ Dept Ind Engn TR-34450 Istanbul Turkey

This paper presents a mixed-integer linear optimisation model to analyse the intermodal transportation systems in the Turkish transportation industry. The solution approach includes mathematical modelling, data analysis from real-life cases and solving the resulting mathematical programming problem to minimise total transportation cost and carbon dioxide emissions by using two different exact solution methods in order to find the optimal solutions. The novel approach of this paper generates Pareto solutions quickly and allows the decision makers to identify sustainable solutions by using a newly developed solution methodology for bi-objective mixed-integer linear problems in real-life cases.

关键词： Logistics sustainability mixed-integer linear programming bi-objective optimisation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：