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

A biased random-key genetic algorithm for wireless backhaul network design

APPLIED SOFT COMPUTING 2015年 33卷 150-169页

作者： Andrade, Carlos E. Resende, Mauricio G. C. Zhang, Weiyi Sinha, Rakesh K. Reichmann, Kenneth C. Doverspike, Robert D. Miyazawa, Flavio K. Univ Estadual Campinas Inst Comp BR-13083852 Campinas SP Brazil AT&T Labs Res Network Evolut Res Dept Middletown NJ 07748 USA Amazon Com Inc Math Optimizat & Planning Grp Seattle WA 98109 USA

This paper describes a biased random-key genetic algorithm for a real-world wireless backhaul network design problem. This is a novel problem, closely related to variants of the Steiner tree problem and the facility location problem. Given a parameter h, we want to build a forest where each tree has at most h hops from the demand nodes, where traffic originates, to the root nodes where each tree is rooted. Candidate Steiner nodes do not have any demand but represent locations where we can install cellsites to cover the traffic and equipment to backhaul the traffic to the cellular core network. Each Steiner node can cover demand nodes within a given distance, subject to a capacity constraint. The aggregate set of constraints may make it impossible to cover or backhaul all demands. A revenue function computes the revenue associated with the total amount of traffic covered and backhauled to the root nodes. The objective of the problem is to build a forest that maximizes the difference between the total revenue and the cost associated with the installed equipment. Although we will have a forest when we consider only the backhaul links and root nodes, the addition of demand vertices can induce undirected cycles, resulting in a directed acyclic graph. We consider instances of this problem with several additional constraints that are motivated by the requirements of real-world telecommunication networks. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Wireless backhaul network design Small cells Genetic algorithm mixed integer programming model

来源：评论

学校读者我要写书评

暂无评论

A general model for the home health care routing and scheduling problem with route balancing

引用

IFAC-PapersOnLine 2017年第1期50卷 14662-14667页

作者： Decerle, J. Grunder, O. Hajjam El Hassani, A. Barakat, O. IRTES EA 7274 Univ. Bourgogne Franche-Comté UTBM BelfortF-90010 France Nanomedicine Lab Univ. Bourgogne Franche-Comté BesançonF-25000 France

Home health care organizations are inclined to optimize their activities since the rise of the demand for home care. Defining the routing of the caregivers are complex activities to perform because of the different objectives to optimize and constraints to handle. The objectives considered are often in conflict leading one objective to deteriorate the other ones. Indeed, balancing the traveling time may increase the total traveling time of caregivers as well as increase the soft patient time window and shared visits non-satisfaction. Therefore, a good balance must be found between these objectives. Thus, we propose a general mixed-integer programming model for the home health care routing and scheduling problem with route balancing. The proposed model handles most of the known characteristics in order to be application-based independent. A memetic algorithm is proposed to evaluate the multi-objective approach on several instances and support decision-making. The impact of the focus on route balancing is analyzed on the behavior of the objectives. The results highlight that the focus on route length balancing may become harmful by deteriorating the other objectives while not improving anymore the maximal route length difference. Moreover, the route length balancing shows some different sensitivities on the other objective functions depending on the instance structure. © 2017

关键词： Home health care Decision making integer programming Scheduling Complex activity General model Memetic algorithms mixed integer programming model Multi objective Objective functions Routing and scheduling Traveling time

来源：评论

学校读者我要写书评

暂无评论

modeling a Generalized Resource Constrained Multi Project Scheduling Problem Integrated with a Forward-Backward Supply Chain Planning

引用

IFAC-PapersOnLine 2016年第12期49卷 1283-1288页

作者： Gholizadeh-Tayyar, S. Dupont, L. Lamothe, J. Falcon, M. Toulouse University Ecole des Mines d'Albi-Carmaux Industrial Engineering Department Albi France TBC Générateur d'Innovation Colomiers France

Generalized Resource Constrained Multi Project Scheduling Problem, GRCMPSP, is issue of determining a scheduling plan for executing projects’ activities under satisfaction of precedence relationship between activities and availability of resources. This paper focuses on the resources’ availability. To deal with feeding nonrenewable recourses over periods they are demanded and to define a production-transportation plan for them, our proposed mixed integer programming model integrates GRCMPSP with Supply Chain Planning model. Also, to establish a plan for assigning required amounts of renewable resources, it supposes possibility of renting supplementary quantities. This assumption leads the model to define an optimum assignment under considering rent cost of additional resources and penalty cost may originate from lateness of the activities. The results are shown from applying the model on a project called CRIB A, which is defined to reduce energy consumption level of buildings in France. © 2016

关键词： integer programming Energy utilization Scheduling Supply chains mixed integer programming mixed integer programming model Precedence relationships Production transportation Reduce energy consumption Renewable resource Resource constrained multi project scheduling problems Supply chain planning

来源：评论

学校读者我要写书评

暂无评论

Lot sizing and pricing problem in a recovery system with returns and one-way substitution option: Novel cost benefit evaluation based approaches

引用

IFAC-PapersOnLine 2019年第13期52卷 36-41页

作者： Zouadi, T. Yalaoui, A. Reghioui, M. BEAR Lab Morocco University of Technology of Troyes Troyes Cedex France National School of Business and Management Ancienne route de l'aéroport BP 1255 Tangier Morocco

In this study, we investigate the joint pricing and lot-sizing problem in a hybrid manufacturing and remanufacturing system with one-way substitution option. The objective is to find the optimal prices and quantities over each period that maximizes the firm revenue, minimizes holding and production costs, and meets the customers' demands. The considered system is a single production line where both operations of manufacturing and remanufacturing are hold. The items issued from the two processes are not of the same quality and price. The remanufacturing option is based on the collected used products called returns and generates products with less quality. In this paper two demand yields are considered, for new and remanufactured items. In the shortage case of remanufactured items, a one-way substitution option is assumed, so that the demand of these remanufactured items is satisfied by new ones. The objective is to find the optimal prices and quantities in each period that maximizes the firm revenue. The paper proposes a mixed integer-programming model to find optimal production and pricing strategy over a planning horizon, a novel adaptation of cost benefit evaluation heuristic and a memetic algorithm to find near optimal solutions. An extensive simulation analysis is performed for different values to confirm the performance of the proposed approaches. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Costs Cost benefit analysis Economics integer programming Manufacture Extensive simulations Heuristics Lot sizing mixed integer programming model Near optimal solutions Remanufacturing Remanufacturing system Returns

来源：评论

学校读者我要写书评

暂无评论

The integrated production-distribution scheduling in parallel machine environment by using improved genetic algorithms

引用

JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING 2021年第3期38卷 157-170页

作者： Kazemi, Hamed Mahdavi Mazdeh, Mohammad Rostami, Mohammad Heydari, Mahdi Laval Univ Dept Mech Engn Quebec City PQ Canada Iran Univ Sci & Technol Dept Ind Engn Tehran Iran Shahrood Univ Technol Dept Ind Engn & Management Shahrood Iran

This study investigates the integrated production-distribution scheduling in a workshop which utilizes the non-identical parallel machines in production line. The objective is to schedule the jobs on machines and forming them into the batches so as to minimize the sum of tardiness and delivery costs. First, a mixed integer linear programming model is proposed which can solve the small-size instances in a reasonable time. To deal with large-size instances, a genetic algorithm (GA) and the improved genetic algorithm (IGA) equipped with optimal properties mechanism is developed. Areal life instance in bedroom furniture manufacturing is also presented that indicates the algorithm can reach the optimal solution for this problem. In order to evaluate the performance of the algorithms, 150 small size instances and more than 800 large size instances are generated which is conducted from benchmarks. The results indicate that IGA outperforms GA with respect to relative percentage deviations.

关键词： Production-distribution scheduling non-identical parallel machines mixed integer programming model improved genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Integration of flexibility in reverse supply chain planning process

引用

INTERNATIONAL JOURNAL OF ENVIRONMENTAL TECHNOLOGY AND MANAGEMENT 2020年第2-4期23卷 245-270页

作者： Das, Kanchan East Carolina Univ Dept Technol Syst 245 Slay Hall Greenville NC 27858 USA

This research formulates reverse supply chain (RSC) flexibility criteria and integrates them in a closed loop supply chain planning model for improving overall business performances and sustainability. Proposed RSC flexibility criteria include: a) channel selection strategy to collect customer returned products (returnable);b) product design and recovery strategy to recover components, modules, and products from returnable;c) product categorisation strategy for marketing new, recovered, and mixed quality level product. Each flexibility criteria is formulated independently to provide options to supply chains (SCs) to incorporate all or select ones in their planning process. The benefits, applicability and integration procedures of proposed flexibility considerations are demonstrated through a numerical example.

关键词： reverse supply chain RSC flexibility formulation collection channel mixed integer programming model recovery services mixed quality level product

来源：评论

学校读者我要写书评

暂无评论

Simulation based optimization decision support tool for production planning

引用

IFAC-PapersOnLine 2019年第13期52卷 2402-2407页

作者： Belil, S. Tchernev, N. Kemmoé-Tchomté, S. EMINES Mohammed VI Polytechnic University Ben Guerir Morocco LIMOS UMR CNRS 6158 Université Clermont Auvergne Aubière France CRCGM EA 38 49 Université Clermont Auvergne Clermont Ferrand France

The planning of a supply chain network as an integrated system is a difficult task. The purpose of this article is to focus on developing a hybrid approach to address the supply chain planning problem. The proposed approach combines simulation and mixed integer linear programming. The supply chain system studied includes discrete and continuous processes. These two aspects should be always considered together in any modelling approach. This article, first, focuses on developing a discrete event simulation model of a hybrid supply chain, which is used to best describe the system and therefore to evaluate the system behavior over time. This simulation model permits to verify the feasibility of a given optimal planning proposed by a mixed integer programming model. The objective of this approach is to evaluate the solution of the optimization model by the simulation model. The efficacy and the usefulness of the approach are illustrated with a complex real industrial supply chain, consisting of several logistic activities in a chemical fertilizer plant. Copyright © 2019, IFAC © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Discrete event simulation Decision support systems Fertilizers integer programming models Optimization Planning Production control Supply chains Decision support tools Discrete event simulation model Hybrid method Industrial supply chains mixed integer linear programming mixed integer programming model Optimization modeling Simulation based optimizations

来源：评论

学校读者我要写书评

暂无评论

Multi-manned assembly line synchronization with compatible mounting positions, equipment sharing and workers cooperation

引用

IFAC-PapersOnLine 2019年第13期52卷 1502-1507页

作者： Ferrari, Emilio Faccio, Maurizio Gamberi, Mauro Margelli, Silvia Pilati, Francesco University of Bologna Department of Industrial Engineering Viale del Risorgimento 2 Bologna40136 Italy University of Padua Department of Industrial System Engineering Stradella San Nicola 3 Vicenza36100 Italy

The assembly of large and complex products as cars typically involves a huge amount of production resources as workers, pieces of equipment and layout areas. Multi-manned workstations commonly characterize these assembly lines along with some additional features such as compatibility/incompatibility between the different mounting positions, equipment sharing and worker cooperation. The simultaneous management of all such aspects significantly increases the balancing problem complexity. This paper proposes a new mixed integer programming model for such multi-manned assembly line synchronization problem to simultaneously optimize the line efficiency, the line length and the workload smoothness. A customized procedure based on a simulated annealing algorithm is developed to effectively solve this problem. The aforementioned procedure is validated through an industrial case study of an Italian sports car manufacturer distinguished by 665 tasks and numerous synchronization constraints typical of real assembly lines. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Assembly Assembly machines Automobile manufacture Balancing integer programming Simulated annealing Synchronization Assembly line Automotive Industrial case study mixed integer programming model Production resources Simulated annealing algorithms Synchronization constraints Synchronization problem

来源：评论

学校读者我要写书评

暂无评论

On selecting a technology evolution path for broadband access networks

引用

TECHNOLOGICAL FORECASTING AND SOCIAL CHANGE 2005年第4期72卷 449-470页

作者： Yoon, SH Yoon, MG Lee, JJ Korea Adv Inst Sci & Technol Grad Sch Management Seoul 130012 South Korea Mkt Grp Korea Digital Satellite Broadcasting Seoul 110702 South Korea Hankuk Aviat Univ Dept Business Adm Koyang 412791 South Korea

The rapid growth in the number of Internet users has accelerated the use of high-speed Internet access services, including broadband multimedia services. In the delivery of broadband multimedia services to end-users, it is necessary to build a high-speed backbone and access network. To construct a broadband access network, several alternative technologies including xDSL, CATV, and FTTx have been suggested and implemented in telecommunication networks. However, even if a technology is proven to be optimal for the current environment, it can be deteriorated by the elapse of time or the advent of new challenging technologies in the future. In this article, we concentrate on the selection of an evolution path for broadband access networks. We developed an optimization model for selecting the best technology and evolution path with the minimum total cost. The problem can be formulated as a mixed integer programming model. With a scenario for demands and cost factors, we find the optimal evolution path by solving our model with the CPLEX program and illustrate some sample paths for the broadband access network evolution plan. Once the cost and the demand are defined in detail to reflect the realworld case, our model can be useful to generate a practical technology evolution plan for broadband access networks in real-world applications. (c) 2003 Elsevier Inc. All rights reserved.

关键词： broadband access network network evolution mixed integer programming model multicommodity network flow problem

来源：评论

学校读者我要写书评

暂无评论

Multi-period vehicle routing & Replenishment problem of neighbourhood disaster stations for pre-disaster humanitarian relief logistics

引用

IFAC-PapersOnLine 2019年第13期52卷 2614-2619页

作者： Gökçe, Mahmut Ali Ercan, Elif Industrial Engineering Department Yaar University Izmir Turkey Industrial Engineering Department Dokuz Eylül University Izmir Turkey

Natural disasters are uncontrollable situations that affect human life directly. Despite the researches and technological progress, it is still not possible to predict when or where the natural disaster will occur beforehand. Natural disasters cause severe loss of lives and damages. In addition, they cause physical, financial, social and environmental losses. Pre-disaster, during disaster and post-disaster activities are significant in order to decrease the losses caused by natural disasters. This study is about one of the pre-disaster activities. In the pre-disaster management process, a new activity is being tried in Turkey. Called "Neighborhood Disaster Stations", containers filled with emergency relief items such as medicines, painkillers, antiseptics and canned goods are located at the different predetermined locations. It is important to keep items in these stations usable at all times. Since these commodities have expiration dates, they need to be replenished periodically in order to remain useable at any time. The proper time for the replenishment should be determined by considering the probability of reselling or re-using the commodities with the maximum return as much as possible. However, replenishing frequently will result in large operational costs. Therefore, there is a trade-off between routing costs and replenishment. We propose a novel mixed integer-programming model in order to solve this problem. The proposed model determines the replenishment policy for each commodity in the containers and generates the route of each vehicle within a given planning horizon. The objective of this study is to maximize the total profit, which is the difference between expected revenue from reselling and the transportation cost for total routing costs for time periods in the planning horizon. The model determines the replenishment date of each commodity in each disaster container and provides optimal route for each vehicle within planning horizon. The proposed mixed

关键词： Emergency services Containers Disaster prevention Economic and social effects integer programming Optimization Replenishment (water resources) Vehicle routing Vehicles Humanitarian relief mixed integer programming mixed integer programming model Multi period Relief distribution Replenishment policy Social and environmental Technological progress

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：