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

Allocation and optimization of shared self-service check-in system based on integer programming model

JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年第1期44卷 532-556页

作者： Liu, Ying Yang, Xiuqing Xiang, Yong Chen, Yi Mao, Gang Zhou, Xinzhi Sichuan Univ Coll Elect & Informat Engn Chengdu Sichuan Peoples R China Second Res Inst CAAC Chengdu Sichuan Peoples R China Civil Aviat Logist Technol Co Ltd Chengdu Sichuan Peoples R China

The shared self-service check-in system can effectively alleviate the tension of airport caused by limited resources in the future. The effective allocation of resources is the key to improving the performance of this collaborative work system. In this paper, an associative decision integer programming model is established to quantitatively describe the total baggage handling time of the collaborative work system by using piece-wise functions under different allocation schemes. In order to meet passengers' expectation of queuing time, the queue system is optimized to constrain the service level, and eventually the system efficiency is significantly improved. The discrete event simulation results show that the allocation scheme generated by the model can not only largely improve the equipment utilization rate by 124%, but is also able to shorten the queuing time of passengers by 72.8%, which provides the possibility to comprehensively optimize and improve the efficiency of future airport baggage handling systems.

关键词： Self-service check-in Resource allocation integer programming model Serpentine parallel queue system Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

An integer programming model for the weekly tour scheduling problem

引用

NAVAL RESEARCH LOGISTICS 2001年第7期48卷 607-624页

作者： Çezik, T Günlük, O Luss, H IBM Res Yorktown Hts NY 10598 USA Bell Labs Lucent Technol Holmdel NJ 07733 USA Telcordia Technol Inc Piscataway NJ 08854 USA

We study a workforce planning and scheduling problem in which weekly tours of agents must be designed. Our motivation for this study comes from a call center application where agents serve customers in response to incoming phone calls. Similar to many other applications in the services industry, the demand for service in call centers varies significantly within a day and among days of the week. In our model, a weekly tour of an agent consists of five daily shifts and two days off, where daily shifts within a tour may be different from each other. The starting times of any two consecutive shifts, however, may not differ by more than a specified bound. Furthermore, a tour must also satisfy constraints regarding the days off, for example, it may be required that one of the days off is on a weekend day. The objective is to determine a collection of weekly tours that satisfy the demand for agents' services, while minimizing the total labor cost of the workforce. We describe an integer programming model where a weekly tour is obtained by combining seven daily shift scheduling models and days-off constraints in a network flow framework. The model is flexible and can accommodate different daily models with varying levels of detail. It readily handles different days-off rules and constraints regarding start time differentials in consecutive days. Computational results are also presented. (C) 2001 John Wiley & Sons, Inc.

关键词： weekly tour scheduling integer programming model

来源：评论

学校读者我要写书评

暂无评论

integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem

引用

COMPUTERS & OPERATIONS RESEARCH 2023年第1期155卷

作者： Wu, Lebao Jiang, Zuhua Wang, Fuhua Shanghai Jiao Tong Univ Dept Ind Engn & Management Shanghai 200240 Peoples R China

The steel plate yard of shipbuilding separates the inbound and pre-processing operations, increasing the number of moves. This paper considers the mixed inbound and pre-processing operation and studies the stack inbound and pre-marshalling problem where storage and relocation moves can alternate. This problem aims to find a minimum operation to store all inbound plates while eliminating all blocking plates. We propose a novel integer programming model combining two moves in one time period. This model reduces the number of periods, thereby decreasing the model size, but requires extra constraints to avoid infeasible patterns. An exact branch-and-cut algorithm is introduced to tackle the influence of these extra constraints. This paper provides a new modeling approach for stack-related problems, and the experiments show that the proposed method outperforms other ILP-based methods in the literature.

关键词： Stack inbound Pre-marshalling problem integer programming model Branch-and-cut algorithm

来源：评论

学校读者我要写书评

暂无评论

An integer programming model for Load-Oriented Manufacturing Control

An Integer Programming Model for Load-Oriented Manufacturing...

引用

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2009)

作者： Yan, Hao-yun Li, Hong-yu Shanghai Dian Ji Univ Dept Ind Engn Shanghai Peoples R China Fudan Univ Dept Management Sci Shanghai Peoples R China

ISBN: (纸本)9781424448692

Order Review and Release (ORR) is a comprehensive approach to job-shop scheduling. Load-Oriented Manufacturing Control (LOMC) is an effective ORR method, and it restricts the workload of workstations by periodically release right orders into workshop. When selecting orders, "balancing workload" and "meeting order due date" are two contradict objectives. LOMC puts more emphasis on the latter. However, previous studies show that "balancing workload" is quite important, and priority should be given to "balancing workload" when order due dates show small difference. So it improves the order release procedure of LOMC by applying a 0-1 integer programming model to coordinate the two objectives delicately. The new method is named ILOMC (integer-programming-model-based LOMC). Simulation experiments have been carried out to compare LOMC and ILOMC. Simulation results show that ILOMC outperforms LOMC as it can better balance workload.

关键词： integer programming model LOMC ORR

来源：评论

学校读者我要写书评

暂无评论

A two-stage solving approach to vehicle routing problem with rigid time window: a scheme generating system and an integer programming model

A two-stage solving approach to vehicle routing problem with...

引用

10th World Multi-Conference on Systemics, Cybernetics and Informatics/12th International Conference on Information Systems Analysis and Synthesis

作者： Hu, Xiangpei Huang, Minfang Sun, Lijun Dalian Univ Technol Inst Syst Engn Dalian 116023 Liaoning Peoples R China

ISBN: (纸本)9789806560710

In this paper, we present a two-stage solution approach to a special VRP, which can be described as follows: all customers scattering around the depot are divided into a number of circular area;they must be satisfied within a specified time window;several kinds of vehicles are used. The objective of the first stage is to generate possible delivery schemes for each type of vehicles, in which depth-first search strategy of the state-space theory in Artificial Intelligence (AI) is used. It is remarkable that a vehicle's travel time constraint and load capacity constraint are used to control the search depth in this stage. Simultaneously, two strategies are introduced to decrease the number of feasible schemes by eliminating some worse schemes. In the second stage, an integer programming model is constructed to work out the optimal routing schemes from the first stage's outcome. Based on the proposed two-stage approach, a solving system is developed to solve the above mentioned kind of VRP. Also a real VRP case, which contains 106 customers and two kinds of vehicles, is studied to test the effectiveness and efficiency of the approach. The study creates a new way of solving this kind of NP-hard problems.

关键词： logistics management vehicle routing problem (VRP) Artificial Intelligence integer programming model

来源：评论

学校读者我要写书评

暂无评论

Shift Scheduling with Fuzzy Logic: An Application with an integer programming model

引用

Procedia Economics and Finance 2015年 26卷 827-832页

作者： Muhittin Sagnak Yigit Kazancoglu Izmir University of Economics Sakarya Cad. No:156 35330 Balcova/IZMIR/TURKEY

The shift scheduling, which is one of the most crucial processes in order to increase efficiency and decrease labor costs, is a common phenomenon in both manufacturing and service organizations such as airlines, security services, fire stations, etc. In order to meet changing demand and keep responsiveness and flexibility, the shift scheduling includes the scheduling of manpower by assigning employees to shifts determined by types, length, and the number of breaks. The types of shifts may present variety such as part time and full time shifts. The breaks also show variety like lunch breaks, short rests, and compulsory reasons based on the occupational health and safety or necessities for maintenance. To overwhelm this complexity, this paper recommends an integer programming model integrated with fuzzy logic due to the vagueness inherited to the nature of decision-making process in order to provide flexibility in shift lengths, and lower the total labor costs.

关键词： Shift scheduling integer programming model fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

A mixed integer linear programming model for the vehicle routing problem with simultaneous delivery and pickup by heterogeneous vehicles, and constrained by time windows

引用

SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES 2019年第2期44卷 1-14页

作者： Madankumar, Sakthivel Rajendran, Chandrasekharan Indian Inst Technol Madras Dept Management Studies Chennai 600036 India

In this work, we consider the Vehicle Routing Problem with Simultaneous Delivery and Pickup, and constrained by time windows, to improve the performance and responsiveness of the supply chain by transporting goods from one location to another location in an efficient manner. In this class of problem, each customer demands a quantity to be delivered as a part of the forward supply service and another quantity to be picked up as a part of the reverse recycling service, and the complete service has to be done simultaneously in a single visit of a vehicle, and the objective is to minimize the total cost, which includes the traveling cost and dispatching cost for operating vehicles. We propose a Mixed integer Linear programming (MILP) model for solving this class of problem. In order to evaluate the performance of the proposed MILP model, a comparison study is made between the proposed MILP model and an existing MILP model available in the literature, with the consideration of heterogeneous vehicles. Our study indicates that the proposed MILP model gives tighter lower bound and also performs better in terms of the execution time to solve each of the randomly generated problem instances, in comparison with the existing MILP model. In addition, we also compare the proposed MILP model (assuming homogeneous vehicles) with the existing MILP model that also considers homogeneous vehicles. The results of the computational evaluation indicate that the proposed MILP model gives much tighter lower bound, and it is competitive to the existing MILP model in terms of the execution time to solve each of the randomly generated problem instances.

关键词： Supply chain transportation vehicle routing problem simultaneous delivery and pickup time windows integer programming model

来源：评论

学校读者我要写书评

暂无评论

model and approach for optimizing routing and scheduling of truck platooning

引用

TRANSPORTATION PLANNING AND TECHNOLOGY 2025年

作者： Zhang, Zexi China Railway Econ & Planning Res Inst Co Ltd Beijing 100038 Peoples R China

Considering the reduction of aerodynamic drag of the virtually linked truck's slipstream in a trainlike convoy has brought benefits such as significant fuel consumption savings, truck platooning has been identified as a promising operational technology. To fully reap these benefits in the initial phases of truck platooning deployment, an appropriate truck platooning plan based on itineraries and deadlines of each transportation task is required. We construct a truck platooning routing and scheduling optimization model with minimum overall system fuel consumption considering detour costs and time restrictions. Meanwhile, we introduce the linearizing method and give recommendations on the values for Big-${\rm M}$M to ensure the efficient solution of the optimization model. To demonstrate the effectiveness and efficiency of the proposed model, various randomly generated road networks are constructed and the truck platooning routing and scheduling optimization model is solved. The model provides valuable insights regarding platooning plan from a transportation optimization and scheduling perspective.

关键词： Truck platooning routing and scheduling time window multi-commodity network flow theory integer programming model semi-automated driving technologies

来源：评论

学校读者我要写书评

暂无评论

modeling optimal combination of breast and cervical cancer screening strategies in China

引用

BMC WOMENS HEALTH 2025年第1期25卷 1-11页

作者： Liu, Xuewei Wang, Yanbo Gao, Bei Lu, Xinlin Wang, Yuan Lu, Wenli Tianjin Med Univ Sch Publ Hlth Dept Epidemiol & Hlth Stat 22 Qixiangtai Rd Tianjin 300070 Peoples R China

BackgroundBreast and cervical cancers are the commonest cancers among women. Secondary prevention of cancer through screening minimizes disease burden and improves survival outcomes. Optimizing screening strategies for breast and cervical cancers is a challenge in resource-limited settings with a high population density such as China. Therefore, we aimed at assessing the efficiency of different combined screening strategies for breast and cervical cancers under different budgets in *** cohort model was used to evaluate the cost-effectiveness of 36 strategy combinations for breast and cervical cancer screening with varying screening modality and intervals. The results were used as inputs in the integer programming (IP) model to determine the combination of the different screening options under different *** optimal combination strategy was biennial breast ultrasonography (BUS) and mammography (MAM) in parallel screening and quinquennial human papillomavirus (HPV) for breast and cervical cancer screening under the threshold of the annual per capita social cost investment (PCSCI) (18.80 USD) in China. Using this strategy, the total investment cost for 100,000 females was 1,877,984.50 USD, and the incremental life-years compared with no screening was 3,122 life-years. The optimal combination strategy included annual clinical breast examination (CBE), BUS and MAM in series screening, and biennial thin-layer liquid-based cytology (TCT) and HPV in series screening with the annual PCSCI reaching 37.60 USD. Thereafter, as the cost input continued to increase, the optimal combination strategy remained unchanged, and the sum of incremental life-years and actual input costs did not *** a social cost-benefit perspective, biennial BUS and MAM in parallel screening, and quinquennial HPV screening is the most efficient combination strategy with limited budget, while annual CBE, BUS and MAM in series screening and biennial TCT and

关键词： Breast cancer Cervical cancer Screening strategies Cost-effective Markov model integer programming model

来源：评论

学校读者我要写书评

暂无评论

Robustness-Based Approach for Slack Time Optimization in Tram Timetables

引用

URBAN RAIL TRANSIT 2025年第1期11卷 90-107页

作者： Zhou, Weixia Teng, Jing Chen, Enhui Tongji Univ Shanghai Peoples R China

Considering the unique interplay of trams with road traffic, this study explored the issue of instability in tram operations-a prominent medium-capacity rail transit. Our goal was to design a timetable slack time optimization method for scheduling slack time to improve the stability of tram operations. To facilitate this, we derived the travel/dwelling time distribution from historical data, which assisted in estimating interference times and evaluating the requisite slack time. We then developed an integer programming model to calculate both the punctuality rate and expected delay under varying travel times, enabling the creation of alternative slack time schemes. Using a unique tram operation simulation logic, we assessed the operational efficiency and reliability of these alternate schemes based on specific operational indicators. The results suggest that our novel approach to timetable optimization significantly enhances the tram's adaptability to disruptions, directly improving the passenger experience and tram competitiveness. This work offers a robust framework for timetable optimization for semi-independent right-of-way public transportation.

关键词： Tram Slack time integer programming model Schedule optimization Robust timetable optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：