In this study, we consider a rich class of mathematical programs with equilibrium constraints (MPECs) involving both integer and continuous variables. Such a class, which subsumes mathematical programs with complement...
详细信息
In this study, we consider a rich class of mathematical programs with equilibrium constraints (MPECs) involving both integer and continuous variables. Such a class, which subsumes mathematical programs with complementarity constraints, as well as bilevel programs involving lower level convex programs is, in general, extremely hard to solve due to complementarity constraints and integrality requirements. For its solution, we design an (exact) algorithmic framework based on branch-and-bound (B&B) that treats each node of the B&B tree as a separate optimization problem and potentially changes its formulation and solution approach by designing, for example, a separate B&B tree. The framework is implemented and computationally evaluated on a specific instance of MPEC, namely a competitive facility location problem that takes into account the queueing process that determines the equilibrium assignment of users to open facilities, and a generalization of models for which, to date, no exact method has been proposed.
Nowadays, global competition urges companies to more seriously consider the issue of cost reduction and high productivity in business networks. In this context, today, both industrial practitioners and researchers are...
详细信息
Nowadays, global competition urges companies to more seriously consider the issue of cost reduction and high productivity in business networks. In this context, today, both industrial practitioners and researchers are focusing on the issues underlying the supply chain structure. In order to materialize real-world objectives, this study aims to improve the performance of the supply chain network by considering simultaneous pickup and split delivery, minimizing total costs, and maximizing customer services within a multi-period multi-product production planning. Besides, relevant data of the involved parameters were collected upon investigating a case study of a food industry located north of Iran. Eventually., the proposed mixed-integer linear programming model was addressed using a &constraint method. Finally, related results of this solution were analyzed and compared with those of simple Vehicle Routing Problem (VRP). (C) 2021 Sharif University of Technology. All rights reserved.
It is well-known that the second-order cone can be outer-approximated to an arbitrary accuracy epsilon by a polyhedral cone of compact size defined by irrational data. In this paper, we propose two rational polyhedral...
详细信息
It is well-known that the second-order cone can be outer-approximated to an arbitrary accuracy epsilon by a polyhedral cone of compact size defined by irrational data. In this paper, we propose two rational polyhedral outer-approximations of compact size retaining the same guaranteed accuracy epsilon. The first outer-approximation has the same size as the optimal but irrational outer-approximation from the literature. In this case, we provide a practical approach to obtain such an approximation defined by the smallest integer coefficients possible, which requires solving a few, small-size integer quadratic programs. The second outer-approximation has a size larger than the optimal irrational outer-approximation by a linear additive factor in the dimension of the second-order cone. However, in this case, the construction is explicit, and it is possible to derive an upper bound on the largest coefficient, which is sublinear in. and logarithmic in the dimension. We also propose a third outer-approximation, which yields the best possible approximation accuracy given an upper bound on the size of its coefficients. Finally, we discuss two theoretical applications in which having a rational polyhedral outer-approximation is crucial, and run some experiments which explore the benefits of the formulations proposed in this paper from a computational perspective. (C) 2021 Elsevier B.V. All rights reserved.
Small bucket models with many short fictitious micro-periods ensure high-quality schedules in multi-level systems, i.e., with multiple stages or dependent demand. In such models, setup times longer than a single perio...
详细信息
Small bucket models with many short fictitious micro-periods ensure high-quality schedules in multi-level systems, i.e., with multiple stages or dependent demand. In such models, setup times longer than a single period are, however, more likely. This paper presents new mixedintegerprogramming models for the proportional lot-sizing and scheduling problem (PLSP) with setup operations overlapping multiple periods with variable capacity. A new model is proposed that explicitly determines periods overlapped by each setup operation and the time spent on setup execution during each period. The model assumes that most periods have the same length;however, a few of them are shorter, and the time interval determined by two consecutive shorter periods is always longer than a single setup operation. The computational experiments show that the new model requires a significantly smaller computation effort than known models.
Inefficiencies in the food supply chain account for up to 60% of food wasted in the United States, significantly inhibiting efforts to tackle food insecurity. In this work, this problem is addressed by developing a su...
详细信息
Inefficiencies in the food supply chain account for up to 60% of food wasted in the United States, significantly inhibiting efforts to tackle food insecurity. In this work, this problem is addressed by developing a supply chain decision-making framework that explicitly considers complex biochemical product quality degradation processes as a function of environmental conditions (e.g., temperature, humidity, atmospheric composition). The resulting optimization problem is solved online in real-time to mitigate demand uncertainty, reducing operating costs, and inventory spoilage. We demonstrate that this approach is equivalent to a data-driven, feedback-based control strategy that relies on manipulating environmental conditions at storage facilities and in transportation equipment. Since large-scale supply chain network instances result in computationally prohibitive optimization problems, a novel and highly efficient heuristic is introduced, that allows for obtaining solutions in practical amounts of time and with negligible degradation in the value of the objective function. The performance of our proposed approach is benchmarked with extensive numerical simulations based on a realistic, large-scale study of the produce supply chain from Mexico to the United States.
This paper deals with targeted attacks on the nodes of a communication network. We present an optimization approach that may be useful for the network operator when deploying the so-called control nodes (called contro...
详细信息
ISBN:
(纸本)9780738142920
This paper deals with targeted attacks on the nodes of a communication network. We present an optimization approach that may be useful for the network operator when deploying the so-called control nodes (called controllers) for resistance to attacks. A key element of our investigations is selecting an appropriate list of attacks that should be included in the optimization of controller placement. For this purpose, we propose innovative probabilistic network availability measures that could be used in planning the most dangerous attacks based on the attacker's knowledge of the network. The operator can anticipate the set of such attacks and then incorporate them into optimizing the controller placement. In the paper, we discuss the proposed measures and present optimization problems appropriate for the deployment of controllers and attack planning. The numerical results illustrating our considerations are also included.
A telecommunication equipment company sends spare parts from local hubs to construction sites or other local hubs in mainland China several times a day through parcel delivery services. Depending on the delivery dista...
详细信息
ISBN:
(纸本)9789897583964
A telecommunication equipment company sends spare parts from local hubs to construction sites or other local hubs in mainland China several times a day through parcel delivery services. Depending on the delivery distance, there are various delivery options such as transportation via air, via road, via sea, via rail and via inland waterways. Many choices named service levels are available within each transportation category. There are three parcel delivery pricing policy: price per shipment, weight ranged price, and continuous pricing. Each spare parts delivery usually has a priority level or delivery time requirement. Spare parts to be shipped from the same hub or nearby hubs to the same or nearby destinations are considered being able to ship in bundles. By observing the delivery pricing structure, it is usually beneficial to bundle spare parts together for shipment. The problem is formulated as a mixedinteger liner programming model. Numerical experiments are carried out to observe the benefits and also reflect the features of parcel delivery pricing structure.
This paper presents a new mathematic model proposed to optimized appointment scheduling problems in healthcare. We actually introduced an integerprogramming model with a Tabu search approach while add a simulation mo...
详细信息
ISBN:
(纸本)9781728167855
This paper presents a new mathematic model proposed to optimized appointment scheduling problems in healthcare. We actually introduced an integerprogramming model with a Tabu search approach while add a simulation model addressed in Appointment Scheduling (AS) healthcare operating system for the assessment in an emergency center of various patient flow control and timing scenarios to obtain minimum patient waiting time and patient satisfaction during their treatment in hospital.
Providing a railway transit system (RTS) in less populated areas is a challenging task for transportation agencies due to its high construction and operating costs. With the advent of automation, shared autonomous veh...
详细信息
Providing a railway transit system (RTS) in less populated areas is a challenging task for transportation agencies due to its high construction and operating costs. With the advent of automation, shared autonomous vehicles (SAVs) as an integral part of public transit services has the potential to enhance the design of transit systems. In this paper, we present a joint optimization framework of railway transit network design and SAV first-mile service that minimizes the total cost of the combined RTS-SAV services and commuters' waiting time, while serving a dynamic travel demand in the network. The proposed model optimizes the SAV fleet size and the RTS alignment while enabling vehicle relocations to tackle the vehicle imbalance issue in the SAV service. Due to the non-linear and mixed-integer formulation, we develop a fixed-point algorithm for this joint RTS-SAV problem where we transform the original problem into a mixed-integer linear programming (MILP) formulation. Our results indicate that the joint RTS-SAV services can be constructed and operated at a lower cost than either of the RTS or SAV services alone. Furthermore, the resulting joint RTS-SAV services are underpinned by a shorter railway alignment and larger fleet size rather than a multi-link extension. Additionally, the joint RTS-SAV services is robust to the variation in total demand, with respect to the railway alignment, SAV utilization and commuters' waiting time.
In order to support deep-sea oil and gas exploration and production operations, platform supply vessel plays a critical role, being the main transport resource to meet the demand of supplies ordered by maritime units....
详细信息
In order to support deep-sea oil and gas exploration and production operations, platform supply vessel plays a critical role, being the main transport resource to meet the demand of supplies ordered by maritime units. This leads to problems in efficiently allocating supplies to vessels and cost-effectively assessing the fleet size. Aiming to solve these problems, we propose a framework based on the integration of a mixed-integer programming model, which selects the supply set each vessel should provide, and a discrete-event simulator, which realistically represents the offshore operation scenario. We evaluate different fleet management policies, such as distinguishing parts of a fleet with respect to commodity type and multi-commodity transportation. In addition, we analyze the cargo allocation and vessel assignment along scheduled trips, comparing the traditional first-in-first out delivery strategy with a completely optimization-centered alternative. Our study presents good-quality solutions that can potentially enhance offshore service levels, reduce fleet requirement, and decrease operational costs. We also demonstrate that our framework promotes a further step for improving the current logistics practices of a major oil company operating in Brazilian oil and gas offshore basins.
暂无评论