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

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

来源：评论

学校读者我要写书评

暂无评论

Step cost functions in a fleet size and mix vehicle routing problem with time windows

引用

ANNALS OF OPERATIONS RESEARCH 2022年第2期316卷 1013-1038页

作者： Manguino, Joao L. V. Ronconi, Debora P. Univ Sao Paulo Dept Prod Engn Ave Luciano Gualberto 1380Cidade Univ BR-05508010 Sao Paulo SP Brazil

The vehicle routing problem is a traditional combinatorial problem with practical relevance for a wide range of industries. In the literature, several specificities have been tackled by dedicated methods in order to better reflect real-world situations. Following this trend, this article addresses the fleet size and mix vehicle routing problem with time windows in which companies hire a third-party logistics company. The shipping charges considered in this work are calculated using step cost functions, in which values are determined according to the type of vehicle and the total distance traveled, with fixed values for predefined distance ranges. A mixed integer linear programming model is introduced and two sequential insertion heuristics are proposed. The introduced methods are examined through a computational comparative analysis in small-sized instances with known optimal solution, 168 benchmark instances from the literature, and 3 instances based on a real-world problem from the civil construction industry. The numerical experiments show that the proposed methods are efficient and show good performance in different scenarios.

关键词： Vehicle routing problem Heterogeneous fleet Time windows Step cost functions mixed integer programming model Heuristics

来源：评论

学校读者我要写书评

暂无评论

A two-echelon location-routing problem for biomass logistics systems

引用

BIOSYSTEMS ENGINEERING 2021年 202卷 106-118页

作者： Cao, Jin Xin Wang, Xiangting Gao, Jiachen Inner Mongolia Univ Inst Transportat Engn Hohhot Peoples R China Inner Mongolia Engn Res Ctr Urban Transportat Dat Hohhot Peoples R China Inner Mongolia Univ Sch Math Sci Hohhot Peoples R China

Biomass has attracted considerable attention from both researchers and practitioners as an important renewable energy source that can help achieve sustainable development. However, inefficient biomass logistics systems hinder the development of biomass utilisation. This study investigates a two-echelon biomass resource location-routing problem (2E-BRLRP). Considering a predetermined supply of biomass resources, a mixed integer programming model for the 2EBRLRP is established to determine the best locations for biomass collection facilities and corresponding vehicle routes. To address the computational complexity, a hybrid heuristic algorithm that embeds variable neighbourhood search into the tabu search framework is developed. A set of comprehensive computational examples are used to test the effectiveness and efficiency of the proposed approach. (c) 2020 IAgrE. Published by Elsevier Ltd. All rights reserved.

关键词： Biomass logistics systems Location-routing problem mixed integer programming model Tabu search Variable neighbourhood search

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient 2D irregular layout by vector superposition NFP and mixed-integer programming

引用

EXPERT SYSTEMS WITH APPLICATIONS 2023年第1期230卷

作者： Guo, Baosu Li, Jinrui Zhang, Yu Wu, Fenghe Peng, Qingjin Yanshan Univ Sch Mech Engn Qinhuangdao 066004 Peoples R China Heavy Duty Intelligent Mfg Equipment Innovat Ctr H Qinhuangdao 066004 Peoples R China Univ Manitoba Dept Mech Engn Winnipeg MB R3T 5V6 Canada

As a typical combinatorial optimization problem, two-dimensional (2D) irregular layout is a common problem in the engineering field. No-fit polygon (NFP) is a common geometric tool for solving layout problems. Although it is necessary to calculate NFP frequently in the process of layout, the search efficiency of the NFP generation algorithm is affected. The existing unfitting polygon algorithms have difficulties in dealing with complex contours, especially irregular contours with cavities. The large-scale layout process takes the long time with the low material utilization. A vector superposition NFP (VS-NFP) method is proposed in this paper to improve the solution efficiency of 2D irregular layout problems with complex contours. Based on the VS-NFP, an improved mixed integer programming (MIP) model is built. The model increases compression constraints for high solution search efficiency. A hybrid algorithm based on the VS-NFP and MIP is proposed to solve the problem. Comparing with the existing methods, the proposed method shortens the search time and improves the material utilization. The proposed method is verified in the application of large-scale layout problems.

关键词： Combinatorial optimization 2D irregular layout No -fit polygon mixed integer programming model

来源：评论

学校读者我要写书评

暂无评论

Optimization of a rural bus service integrated with e-commerce deliveries guided by a new sustainable policy in China

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2023年第1期172卷

作者： He, Dongdong Ceder, Avishai (Avi) Zhang, Wenyi Guan, Wei Qi, Geqi Beijing Jiaotong Univ Key Lab Transport Ind Big Data Applicat Technol Co Minist Transport Beijing 100044 Peoples R China Technion Israel Inst Technol Fac Civil & Environm Engn IL-32000 Haifa Israel Technion Israel Inst Technol Transportat Res Inst IL-32000 Haifa Israel

Electronic business has expanded, resulting in flourishing rural e-commerce globally, and particularly in China. This paper introduces a novel rural public transit system that integrates passenger and freight services-a rural electric bus service that provides services for passengers and e-commerce packages. This blended service reduces logistical costs and generates additional income for the transit operator. The objective is to minimise cost for the transit user and operator by using a mixed-integer linear programming model that solves bus routing and bus trip scheduling for multiple rural towns;in addition, the model is tested by the Gurobi solver at small-scale instances. The developed solution is a hybrid heuristic algorithm based on adaptive large neighborhood search and tabu search approaches. Finally, a case study in China is conducted to examine the proposed cost-effective methodology and ensure that the integrated scheme will significantly save operational system costs without causing any passenger inconvenience. The research also shows how to optimally design the size of rural electric buses to reduce purchasing and maintenance costs. The optimal results of the case study, comprising 5 towns and 78 villages, show an annual cost saving of approximately yen 847,000 (approximately $121,000) and an annual mileage saving of approximately 66,000 km for the proposed scheme. In addition, the case study explicates key parameters selected for transfer package requirements and the effective deployment of the proposed scheme.

关键词： Integrated passenger-freight transit Public transport mixed integer programming model Hybrid heuristic algorithm Adaptive large neighborhood search Tabu search

来源：评论

学校读者我要写书评

暂无评论

Allocation Optimization of Medical Samples For Distributed Testing 5

Allocation Optimization of Medical Samples For Distributed T...

引用

5th International Conference on Electrical, Electronics, Communication, Computer Technologies and Optimization Techniques (ICEECCOT)

作者： Jayalakshmi, D. S. Geetha, J. Sen, Abhishek Dubey, Amit Kumar Konnur, Darshan R. Priya, S. MS Ramaiah Inst Technol Dept Comp Sci & Engn Bangalore Karnataka India

ISBN: (纸本)9781665432726

The world is witnessing the COVID-19 pandemic, which originated in the city of Wuhan, China, and has quickly spread to the whole world, with many cases having been reported in India as well. The healthcare system is going through unprecedented load on its resources while the available infrastructure is ***-19 samples are being tested at a massive scale and even small optimizations at this scale can save time, huge amounts of money, and resources. Particularly, the manual approach or even baseline greedy approach being used to allocate COVID-19 samples to medical labs across a state can lead to underutilization of resources. Hence, this work proposes a system to optimize the problem of allocation of medical samples to medical testing laboratories with high efficiency and minimal economic penalty. We use the mixed integer programming (MIP) model using high-performance MIP based solvers for custom applications by providing a tight integration with the branch-and-cut algorithms of the supported solvers to improve the results compared to baseline greedy approach. The system provides a transportation schedule optimized with respect to capacity of different labs and COVID-19 cases across the state of Karnataka. We tested the model on various datasets and observed significant improvement over the baseline greedy model.

关键词： Optimization Resource Allocation mixed integer programming model COVID Samples Greedy Approach

来源：评论

学校读者我要写书评

暂无评论

Cross-Border Interconnectors in South Asia: Market-Oriented Dispatch and Planning

引用

IEEE ACCESS 2020年 8卷 120361-120374页

作者： Chattopadhyay, Debabrata Chitkara, Puneet Curiel, Ilka Deleque Draugelis, Gailius World Bank 1818 H St NW Washington DC 20433 USA Johns Hopkins Univ Dept Environm Hlth & Engn Baltimore MD 21218 USA

Regional trade in South Asia has progressed well over the last decade to exceed 3 GW in interconnection capacity, connecting India with Bhutan, Bangladesh and Nepal. We present an analysis of the benefits of the next 10.6 GW of interconnection capacity under construction and planning stages across four major corridors connecting five countries, including the proposed HVDC interconnector between India and Sri Lanka. It is important that these interconnectors are assessed not only for long-term benefits as part of a least cost portfolio of investments, but also for short-term, market-based benefits that can be gained from new opportunities for cross border electricity trade (CBET) in India's power exchanges. The Electricity Planning model (EPM) is developed for analysis of regional markets. A combination of market price driven short-term dispatch analysis and long-term planning optimization (for 2019-2035) is conducted using EPM. The analysis shows a strong economic case for development of a South Asian Regional Electricity Market (SAREM). Conservative estimates of (discounted) benefits exceed $1 billion accrued over only 10-12 years for each of the incumbent four major corridors. The short-term analysis using historic spot prices in the Indian Energy Exchange (IEX) also reveals a strong case with annual benefits in the range of $100-400+m pa for these corridors. The model is made available to system operators and planners in the region and used for building their capacity to develop further assessment and inform policy dialogues.

关键词： Cross-border interconnection dispatch optimization mixed integer programming model long term planning regional electricity market

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：