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

Distribution network design:: New problems and related models

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2005年第3期165卷 610-624页

作者： Ambrosino, D Scutellà, MG Univ Genoa Dip Econ & Metodi Quantitativi I-16126 Genoa Italy Univ Pisa Dipartimento Informat I-56127 Pisa Italy

We study some complex distribution network design problems, which involve facility location, warehousing, transportation and inventory decisions. Several realistic scenarios are investigated. Two kinds of mathematical programming formulations are proposed for all the introduced problems, together with a proof of their correctness. Some formulations extend models proposed by Perl and Daskin (1985) for some warehouse location-routing problems;other formulations are based on flow variables and constraints. (c) 2004 Elsevier B.V. All rights reserved.

关键词： distribution location-routing integer linear programming models

来源：评论

学校读者我要写书评

暂无评论

Single machine scheduling considering time value of money

引用

IFAC-PapersOnLine 2019年第13期52卷 887-892页

作者： Zhi, Rongteng Xu, Yinfeng Zheng, Feifeng Glorious Sun School of Business and Management Donghua University Shanghai China

Under the background of Industry 4.0, this paper studies the single machine scheduling problem by taking into account the time value of money and tardiness penalty. We establish a mixed integer nonlinear programming model for the considered problem, and then convert the above model into a novel integer linear programming model. Regarding the factor of time value of money, we mainly aim to find an optimal or near optimal processing sequence of the jobs such that the total future value of profits is maximized. We employ CPLEX to output optimal solutions for small-size instances. For large-size instances, we propose the genetic algorithm to produce near optimal solutions. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： integer programming Genetic algorithms Industry 4.0 Machinery Nonlinear programming Optimal systems Scheduling integer linear programming models Mixed integer nonlinear programming models Near optimal solutions Single machine scheduling problems Single machine scheduling Tardiness cost Tardiness penalties Time value of money

来源：评论

学校读者我要写书评

暂无评论

The variable neighborhood search for a consistent vehicle routing problem under the shift length constraints

引用

IFAC-PapersOnLine 2019年第13期52卷 2314-2319页

作者： Kulachenko, I.N. Kononova, P.A. Kochetov, Y.A. Kurochkin, A.A. Novosibirsk State University Novosibirsk Russia Sobolev Institute of Mathematics SB RAS Novosibirsk Russia

This paper addresses a new real-world application of vehicle routing planning in a finite time horizon. A company in the small package shipping industry has a limited fleet of identical vehicles in some depots and must serve a set of clients. There is a frequency for each client stating how often this client must be visited. Time intervals between two consecutive visits must be the same but the visiting schedule is flexible. To get some competitive advantage, a company tries to increase the service quality. To this end, each client should be visited by one driver only. The goal is to minimize the total traveling distance for all vehicles over the planning horizon under the frequency constraints and driver shift length constraints. We present an integer linear programming model for this new consistent vehicle routing problem. To find near optimal solutions, we design the Variable Neighborhood Search metaheuristic with nine neighborhood structures. The driver shift length constraints are penalized and included in the objective function. Empirical results for real test instances from Orenburg region in Russia with up to 900 clients and four weeks in the planning horizon are discussed. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Vehicle routing Competition Fleet operations integer programming Mathematical models Operations research Routing algorithms Vehicles Computer experiment integer linear programming models Neighborhood structure Optimization problems Search method Time scheduling Variable neighborhood search Vehicle Routing Problems

来源：评论

学校读者我要写书评

暂无评论

Flexible Flow Shop with Storage: Complexity and Optimisation Methods

引用

IFAC-PapersOnLine 2016年第12期49卷 237-242页

作者： Fung, Joey Zinder, Yakov Singh, Gaurav School of Mathematical and Physical Sciences University of Technology Sydney Australia Technology Geoscience and Engineering BHP Billiton Australia

The paper is concerned with a two-stage flexible flow shop with a buffer under the assumption that all operations have the same processing time and that each job can be processed on a machine only if a certain amount of buffer space is allocated to this job. The amount of buffer space to be allocated differs from job to job. The buffer is shared by all machines and has limited size. The objective function is the makespan. The application area includes supply chains which involve loading and unloading operations, and problems arising in computer systems with shared memory. It is proven that in general, the problem is NP-hard in the strong sense, but in the case of two-machines, it is solvable in polynomial-time. For the general case, several integer linear programming models are presented and compared by means of computational experiments. The presented integer linear programming models implement various ideas such as symmetry breaking constraints, knapsack type cutting planes and the results of the analysis of the structure of optimal schedules. © 2016

关键词： integer programming Job shop scheduling Machine shop practice Operations research Polynomial approximation Scheduling Structural optimization Supply chains Unloading Application area Computational experiment Flexible flow shop integer linear programming models Loading and unloading operations Objective functions Optimisation method Symmetry breaking constraints

来源：评论

学校读者我要写书评

暂无评论

An optimization model to design a new cruise itinerary: the case of Costa Crociere

引用

IFAC-PapersOnLine 2018年第9期51卷 446-451页

作者： Asta, Veronica Ambrosino, Daniela Bartoli, Federico Genova Italy University of Genova Italy Costa Crociere Spa Genova Italy

This work analyses the complex processes for the development of cruises’ itineraries to offer on the market and proposes a mathematical model for determining a new itinerary maximizing revenues, customers satisfaction, while minimizing operative costs. This work represents one of the first attempt to apply optimization techniques to cruise shipping and has been realized in collaboration with Costa Crociere, a cruise company operating in Europe. © 2018

关键词： integer programming Customer satisfaction Optimization Complex Processes Costa Crociere Cruise itinerary designing problem integer linear programming models Operative costs Optimization modeling Optimization techniques Work analysis

来源：评论

学校读者我要写书评

暂无评论

Iterated Local Search for dynamic assembly line rebalancing problem

引用

IFAC-PapersOnLine 2016年第12期49卷 515-519页

作者： Antoine, Manceaux El-Haouzi Hind, Bril Cherif-Khettaf Wahiba, Ramdane Mohand Lounes, Bentaha CRAN UMR 7039 Lorraine University Nancy France LORIA UMR 7503 Ecole des Mines de Nancy Lorraine University Nancy France

This research presents an iterated local search (ILS) based technique to address the dynamic assembly line rebalancing problem. The goal is to find a new assignment of tasks to workstations when disturbances occur. The solution must respect a desired cycle time (takt time) and the precedence constraints. The problem was formalized as an integer linear programming model. To solve it an exact approach and the heuristic approach ILS were used. Computational experiments are conducted on different industrial cases to evaluate and to compare the performances of the proposed approaches. The results confirm the effectiveness of the ILS approach. © 2016

关键词： integer programming Assembly Assembly machines Heuristic methods Local search (optimization) Computational experiment Dynamic assembly Exact approach Heuristic approach integer linear programming models Iterated local search Precedence constraints Rebalancing

来源：评论

学校读者我要写书评

暂无评论

A choice-based model to reduce primary care load on tertiary hospitals

引用

INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT 2020年第3期15卷 155-164页

作者： Kumar, Kaushal Bardhan, Amit Kumar Univ Delhi Dept Operat Res Delhi India Univ Delhi Fac Management Studies Delhi India

In developing countries like India, patients bypass primary health centers (PHCs) and visit larger hospitals for minor ailments and thereby overburden the facilities responsible for specialized consultative health care. This is an undesirable phenomenon and governments are spending more on primary care and setting up more community and primary health centers. In this article, we propose an integer linear programming model for locating PHCs with the explicit objective of reducing unwanted load on tertiary care hospitals. The model offers holistic utilization of existing and new facilities. Moreover, the question of equity in allotment of more desirable facilities which can be built only in limited numbers, is discussed for the first time. This article contributes in the following ways. It describes a decision problem which has social relevance. The dual issues of excessive uneven distribution of health service workload and equity in distribution of public resources in the context of primary care are discussed. Using the novel optimization model developed in the article, major policy directions can be derived. The implementation of this model should ensure better utilization of public money and greater service to the target population. This is also demonstrated through a small real-life case study. A heuristic algorithm has also been proposed for solving the optimization model.

关键词： Public health primary care facility location problem integer linear programming models heuristics

来源：评论

学校读者我要写书评

暂无评论

linear formulation for the Maximum Expected Coverage Location Model with fractional coverage

引用

OPERATIONS RESEARCH FOR HEALTH CARE 2016年 8卷 33-41页

作者： van den Berg, P. L. Kommer, G. J. Zuzakova, B. Delft Inst Technol Delft Inst Appl Math Mekelweg 4 NL-2628 CD Delft Netherlands Ctr Wiskunde & Informat POB 94079 NL-1090 GB Amsterdam Netherlands Vrije Univ Amsterdam De Boelelaan 1081a NL-1081 HV Amsterdam Netherlands Charles Univ Prague Prague Czech Republic

Since ambulance providers are responsible for life-saving medical care at the scene in emergency situations and since response times are important in these situations, it is crucial that ambulances are located in such a way that good coverage is provided throughout the region. Most models that are developed to determine good base locations assume strict 0-1 coverage given a fixed base location and demand point. However, multiple applications require fractional coverage. Examples include stochastic, instead of fixed, response times and survival probabilities. Straightforward adaption of the well-studied MEXCLP to allow for coverage probabilities results in a non-linear formulation in integer variables, limiting the size of instances that can be solved by the model. In this paper, we present a linear integer programming formulation for the problem. We show that the computation time of the linear formulation is significantly shorter than that for the non-linear formulation. As a consequence, we are able to solve larger instances. Finally, we will apply the model, in the setting of stochastic response times, to the region of Amsterdam, the Netherlands. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： integer linear programming models Ambulance base locations Location analysis

来源：评论

学校读者我要写书评

暂无评论

models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison

引用

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS 2012年第1-2期1卷 113-133页

作者： Roberti, Roberto Toth, Paolo Univ Bologna DEIS Viale Risorgimento 2 I-40136 Bologna BO Italy

This paper surveys the most effective mathematical models and exact algorithms proposed for finding the optimal solution of the well-known Asymmetric Traveling Salesman Problem (ATSP). The fundamental integer linear programming (ILP) model proposed by Dantzig, Fulkerson and Johnson is first presented, its classical (assignment, shortest spanning r-arborescence, linear programming) relaxations are derived, and the most effective branch-and-bound and branch-andcut algorithms are described. The polynomial ILP formulations proposed for the ATSP are then presented and analyzed. The considered algorithms and formulations are finally experimentally compared on a set of benchmark instances.

关键词： Asymmetric Traveling Salesman Problem integer linear programming models Branch-and-bound algorithms Branch-and-cut algorithms Experimental comparison

来源：评论

学校读者我要写书评

暂无评论

Computational Complexity and ILP models for Pattern Problems in the Logical Analysis of Data

引用

ALGORITHMS 2021年第8期14卷 235页

作者： Lancia, Giuseppe Serafini, Paolo Univ Udine Dept Math Comp Sci & Phys I-33100 Udine Italy

Logical Analysis of Data is a procedure aimed at identifying relevant features in data sets with both positive and negative samples. The goal is to build Boolean formulas, represented by strings over {0,1,-} called patterns, which can be used to classify new samples as positive or negative. Since a data set can be explained in alternative ways, many computational problems arise related to the choice of a particular set of patterns. In this paper we study the computational complexity of several of these pattern problems (showing that they are, in general, computationally hard) and we propose some integer programming models that appear to be effective. We describe an ILP model for finding the minimum-size set of patterns explaining a given set of samples and another one for the problem of determining whether two sets of patterns are equivalent, i.e., they explain exactly the same samples. We base our first model on a polynomial procedure that computes all patterns compatible with a given set of samples. Computational experiments substantiate the effectiveness of our models on fairly large instances. Finally, we conjecture that the existence of an effective ILP model for finding a minimum-size set of patterns equivalent to a given set of patterns is unlikely, due to the problem being NP-hard and co-NP-hard at the same time.

关键词： logical analysis of data pattern problems data mining computational complexity integer linear programming models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：