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

TWO-MACHINE FLOW SHOP WITH SYNCHRONIZED PERIODIC MAINTENANCE

RAIRO-OPERATIONS RESEARCH 2019年第1期53卷 351-365页

作者： Krimi, Issam Benmansour, Rachid Hanafi, Said Elhachemi, Nizar Polytech Univ Hauts France LAMIH UMR CNRS 8201 Valenciennes France Mohammed VI Polytech Univ Complex Syst Engn & Human Syst Ben Guerir Morocco Mohammed V Univ Rabat Mohammadia Sch Engineers Rabat Morocco

In the literature, some works deal with the two-machine flow shop scheduling problem under availability constraints. Most of them consider those constraints only for one machine at a time and also with limited unavailability periods. In this work, we were interested by the unlimited periodic and synchronized maintenance applied on both machines. The problem is NP-hard. We proposed a mixed integer programming model and a variable neighborhood search for solving large instances in order to minimize the makespan. Computational experiments show the efficiency of the proposed methods.

关键词： Flow shop scheduling preventive maintenance mixed integer programming model variable neighborhood search

来源：评论

学校读者我要写书评

暂无评论

The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2016年 94卷 169-188页

作者： Li, Hongqi Zhang, Lu Lv, Tan Chang, Xinyu Beihang Univ Sch Transportat Sci & Engn 37 Xueyuan Rd Beijing 100191 Peoples R China

Most of the studies address issues relating to the delivery from satellites to customers, which is throughout the end part of the linehaul-delivery system. Differing from the long-term strategic problems including the two-echelon vehicle routing problem (2E-VRP), the two-echelon location routing problem (2E-LRP) and the truck and trailer routing problem (TTRP) which make location decisions in depots or satellites, the paper introduces a short-term tactical problem named the two-echelon time-constrained vehicle routing problem in linehaul-delivery systems (2E-TVRP) that does not involve location decisions. The line haul level and the delivery level are linked through city distribution centers (CDCs) located on the outskirts of cities. The 2E-TVRP has inter-CDC linehaul on the first level and urban delivery from CDCs to satellites on the second level. Vehicle routes on different levels are interacted by time constraints. A mixed integer nonlinear programming model for the 2E-TVRP is put forward, and a mixed integer linear programming model is used as the benchmark model. The Clarke and Wright savings heuristic algorithm (CW) improved by a local search phase is adopted. The 2E-TVRP formulations and the heuristic algorithm are tested by using 140 randomly-generated instances with up to 10 CDCs and 500 satellites. The computational results indicate that the heuristic can effectively solve various instances of the 2E-TVRP. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Routing Two-echelon Linehaul-delivery system Time-constrained mixed integer programming model Heuristic

来源：评论

学校读者我要写书评

暂无评论

Routing optimization in IP networks utilizing additive and concave link metrics

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2007年第5期15卷 1136-1148页

作者： Riedl, Anton Schupke, Dominic A. Christopher Newport Univ Dept Phys Comp Sci & Engn Newport News VA 23606 USA Nokia Sioemens Networks GmbH & Co KG D-81730 Munich Germany

Routing optimization provides network operators with a powerful method for traffic engineering. Its general objective is to distribute traffic flows evenly across available network resources in order to avoid network congestion and quality of service degradation. In this paper we consider routing optimization based on conventional routing protocols where packets are forwarded hop-by-hop in a destination-based manner. Unlike other work. in this area, we consider routing protocols, which are able to take into account concave routing metrics in addition to additive ones. The concave link metric introduces,an additional degree of freedom for routing optimization, thus, increasing its optimization potential. We present and evaluate a mixed-integer programming model, which works on these metrics. This model unifies the optimization for single-metric and dual-metric routing concepts and also includes the consideration of multipath routing. Furthermore, we propose a heuristic algorithm usable for larger network instances. Numerical results indicate that employment of both the dual-metric concept and multipath routing can achieve considerably better utilization results than default-configured single-metric routing. A significant finding is that metric-based routing optimization with two link metrics often comes close to the results obtainable by optimization of arbitrarily configurable routing.

关键词： integer programming IP Networks Routing Protocols Telecommunication Traffic Multipath Routing Protocol mixed integer programming model Traffic Engineering Concave Link Metrics IP Network Routing Optimization IP Networks Telecommunication Traffic Quality Of Service Routing Protocols Optimization Methods Degradation Power Engineering And Energy Heuristic Algorithms Employment Internet Genetic Algorithm Internet mixed integer programming Routing Optimization Traffic Engineering

来源：评论

学校读者我要写书评

暂无评论

Strategic planning of an underground mine with variable cut-off grades

引用

OPTIMIZATION AND ENGINEERING 2020年第3期21卷 803-849页

作者： Martinelli, Rafael Collard, Jean Gamache, Michel Pontificia Univ Catolica Rio De Janeiro PUC Rio Dept Engn Ind Rua Marques Sao Vicente 255 Gavea BR-22451900 Rio De Janeiro RJ Brazil Ecole Polytech Montreal Dept Math & Ind Engn CP 6079 Succ Montreal PQ H3C 3A7 Canada HEC Montreal GERAD 3000 Chemin Cote St Catherine Montreal PQ H3T 2A7 Canada

We present a mixed-integer programming model for solving the long-term planning problem of an underground mine. This model, which establishes the sequence of mining for a horizon of 20 years, determines which lens of the geological model will be mined and in what order, while respecting the operational constraints. For each lens to be mined, a specific cut-off grade has to be selected to maximize the net present value. The choice of a cut-off grade affects the volume and the average grade of each lens, which increases the size of problems to be solved. To reduce the computation time, different acceleration strategies and a Fix-and-Optimize heuristic are proposed. Computational experiments on instances of different sizes are performed to (1) assess the quality of the solution found by each method and (2) present the impact of the variable cut-off grade.

关键词： Long-term planning Scheduling Optimization Underground mining mixed integer programming model Cut-off grade

来源：评论

学校读者我要写书评

暂无评论

Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2022年第3期302卷 954-969页

作者： Yucel, Eda Salman, F. Sibel Erdogan, Gunes TOBB Univ Econ & Technol Dept Ind Engn Sogutozu Caddesi 43 TR-06560 Ankara Turkey Koc Univ Dept Ind Engn Rumelifeneri YoluSariyer TR-34450 Istanbul Turkey Univ Bath Sch Management Bath BA1 7AY England

This paper introduces a multi-period, two-dimensional vehicle loading and dispatching problem, called Two-Dimensional Vehicle Loading and Dispatching Problem with Incompatibility Constraints (VLDP). The problem concerns preparing a single-origin single-destination transportation plan of loading required orders to vehicles at the origin and dispatching the vehicles to deliver the orders to the destination within their due dates. The decision maker uses their own fleet of vehicles, with each vehicle having a fixed transportation cost per trip, and may outsource additional vehicles at a higher cost. VLDP involves constraints regarding the due dates of the orders, pairwise incompatibility of orders packed in the same vehicle, incompatibility of orders and vehicles, as well as area and weight capacity of the vehicles. An order can be delivered earlier than its due date, incurring an earliness penalty due to storage requirements at the destination. The objective is to minimize the total vehicle usage and earliness penalty costs. A mixed-integer Linear programming model (MILP) is provided, as well as an Adaptive Large Neighbourhood Search (ALNS) algorithm. Results of computational experiments on instances derived from real-world data show the effectiveness of the ALNS algorithm. (C) 2022 Elsevier B.V. All rights reserved.

关键词： Logistics Long-haul freight logistics Vehicle loading and dispatching mixed integer programming model Adaptive large neighborhood search

来源：评论

学校读者我要写书评

暂无评论

A cut-and-solve-based algorithm for optimal lane reservation with dynamic link travel times

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2014年第4期52卷 1003-1015页

作者： Fang, Yunfei Chu, Feng Mammar, Said Che, Ada Fuzhou Univ Sch Management Fuzhou 350002 Peoples R China Univ Evry Val Essonne Lab IBISC EA 4526 Evry France Univ Technol Troyes Lab LOSI Troyes France Hefei Univ Technol Sch Transportat Engn Hefei Peoples R China Northwestern Polytech Univ Sch Management Xian 710072 Peoples R China

This paper investigates an optimal lane reservation problem with dynamic link travel times via a lane reservation strategy. This strategy is to select some existing general-purpose lanes from a transportation network and convert them to reserved lanes for some special road users only so that a time-guaranteed transportation can be ensured. However, such conversion may cause traffic impact such as an increase of link travel times on adjacent lanes due to the disallowing utilisation of reserved lanes by general-purpose vehicles. Thus, the considered problem aims to design reserved lane-based paths for the time-guaranteed transportation with the objective of minimising the total traffic impact caused by the conversion. Different from lane reservation problems with constant link travel times in the literature, the considered problem assumes dynamic link travel times, which is proved NP-hard. The problem is initially formulated as a mixed integer non-linear programming model. In order to solve it, the non-linear model is reformulated as an equivalent linear model and a cut-and-solve-based algorithm is proposed to obtain optimal solutions. Experimental tests on randomly generated instances show that the overall performance of the proposed algorithm outperforms a direct use of a commercial CPLEX MIP solver.

关键词： optimal lane reservation dynamic link travel times mixed integer programming model cut-and-solve method

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm for balancing reconfigurable machining lines

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2013年第3期66卷 541-547页

作者： Borisovsky, Pavel A. Delorme, Xavier Dolgui, Alexandre Omsk State Univ Omsk 644077 Russia Ecole Natl Super Mines FAYOL EMSE CNRS UMR 6158LIMOS F-42023 St Etienne 2 France

We consider the problem of designing a reconfigurable machining line. Such a line is composed of a sequence of workstations performing specific sets of operations. Each workstation is comprised of several identical CNC machines (machining centers). The line is required to satisfy the given precedence order, inclusion, exclusion and accessibility constraints on the given set of operations. Inclusion and exclusion are zoning constraints which oblige or forbid certain operations to be performed on the same workstation. The accessibility constraints imply that each operation has a set of possible part positions under which it can be performed. All the operations performed on the same workstation must have a common part position. Workstation times are computed taking into account processing and setup times for operations and must not exceed a given bound. The number of CNC machines at one workstation is limited, and the total number of machines must be minimized. A genetic algorithm is proposed. This algorithm is based on the permutation representation of solutions. A heuristic decoder is suggested to construct a solution from a permutation, so that the output solution is feasible w.r.t. precedence, accessibility, cycle time, and exclusion constraints. The other constraints are treated with a penalty approach. For a local improvement of solutions, a mixed integer programming model is suggested for an optimal design of workstations if the order of operations is fixed. An experimental evaluation of the proposed GA on large scale test instances is performed. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Machining line balancing Sequence dependent setup times Genetic algorithm Heuristic decoder Local improvement mixed integer programming model

来源：评论

学校读者我要写书评

暂无评论

Large-scale medical examination scheduling technology based on intelligent optimization

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2019年第1期37卷 385-404页

作者： Zhang, Jiawei Wang, Ling Xing, Lining Natl Univ Def Technol Coll Informat Syst & Management Changsha 410072 Hunan Peoples R China Tsinghua Univ Dept Automat Beijing 100084 Peoples R China

In recent years, the scale of the health examination business has increased rapidly, and research on the combinatorial optimization of medical examinations has become more important. In this context, a special large-scale flexible open shop scheduling problem (FOSP) is introduced based on the idea of the multi-processor open shop scheduling problem. A mixed integer programming model is developed for the FOSP, which regards client satisfaction as the most important objective. As the FOSP is particularly complex, three different intelligent optimization algorithms are examined, namely a genetic algorithm, hybrid particle swarm optimization, and simulated annealing. According to the medical examination preferences of the clients, a group of large-scale test problems are created on the basis of benchmark instances of the flexible job shop problem, and these are used to evaluate the performance of each algorithm. The experimental results show that the genetic algorithm outperforms both simulated annealing and hybrid particle swarm optimization, especially in large-scale problems.

关键词： Combinatorial optimization Flexible open shop scheduling problem Multi-processor open shop scheduling problem mixed integer programming model Large-scale Intelligent optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2022年第3期302卷 1113-1127页

作者： Wu, Yuehui Qureshi, Ali Gul Yamada, Tadashi Kyoto Univ Grad Sch Engn Dept Urban Management Nishikyo Ku Katsura Campus Kyoto Kyoto 6158246 Japan Kyoto Univ Grad Sch Management Sakyo Ku Yoshida Honmachi Kyoto Kyoto 6068501 Japan

In this study, we investigate a multi-allocation hub location routing problem (MAHLRP) for the design of an intra-city express service system, in which flows of mails and parcels are exchanged among the branch offices of the service provider via local tours and hubs. In this application, the pickup and delivery processes are handled simultaneously, and both hub capacity and vehicle capacity are considered. We propose a mixed integer programming formulation for this variant of problem for the first time, followed by a meta-heuristic algorithm, named as adaptive large neighborhood decomposition search, to solve the problem. The proposed model and algorithm are also applied to the single-allocation hub location routing problem (SAHLRP) with minor modifications for comparison reasons. Series of numerical experiments have been conducted on the instances generated from Australian Post data set to test the proposed model and algorithm for both the SAHLRP and the MAHLRP. The results prove that our algorithm outperforms the CPLEX on solving these two problems, as well as that applying the MAHLRP can efficiently reduce the operating cost as compared to the SAHLRP. (C) 2022 Elsevier B.V. All rights reserved.

关键词： Location Intra-city express Hub location routing problem mixed integer programming model Meta-heuristics

来源：评论

学校读者我要写书评

暂无评论

model and solution approaches for retrieval operations in a multi-tier shuttle warehouse system

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2020年 141卷 106283-106283页

作者： Wang, Yanyan Liu, Ziwei Huang, Ke Mou, Shandong Zhang, Rongxu Shandong Univ Sch Control Sci & Engn Jinan Shandong Peoples R China Cent Univ Finance & Econ Business Sch Beijing Peoples R China

In the Multi-tier Shuttle Warehousing System (MSWS), shuttles are responsible for horizontal movements and lifts are responsible for vertical movements. In this paper, a retrieval task scheduling problem for a tier-captive MSWS under single command cycle is considered. This paper aims to determine the sequence of retrieval tasks to minimize the makespan. A mixed integer programming model is developed for the retrieval task scheduling problem. When the number of tasks is less than 10, the mixed integer programming model can be solved by the GUROBI solver to find the exact solutions within a short period. Moreover, a tabu search algorithm, an ant colony algorithm and a simulated annealing algorithm are designed and applied to solve large size problems with up to 200 tasks. By analyzing experimental results, the ant colony algorithm shows stable and superior performance in solving large size problems.

关键词： Multi-tier shuttle warehousing system Retrieval task scheduling mixed integer programming model Heuristics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：