Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 10

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  MILP
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
This paper presents the problem of public transport planning in terms of the optimal use of the available fleet of vehicles and reductions in operational costs and environmental impact. The research takes into account the large fleet of vehicles of various types that are typically found in large cities, including the increasingly widely used electric buses, many depots, and numerous limitations of urban public transport. The mathematical multi-criteria mathematical model formulated in this work considers many important criteria, including technical, economic, and environmental criteria. The preliminary results of the Mixed Integer Linear Programming solver for the proposed model on both theoretical data and real data from urban public transport show the possibility of the practical application of this solver to the transport problems of medium-sized cities with up to two depots, a heterogeneous fleet of vehicles, and up to about 1500 daily timetable trips. Further research directions have been formulated with regard to larger transport systems and new dedicated heuristic algorithms.
EN
The rapid global economic development of the world economy depends on the availability of substantial energy and resources, which is why in recent years a large share of non-renewable energy resources has attracted interest in energy control. In addition, inappropriate use of energy resources raises the serious problem of inadequate emissions of greenhouse effect gases, with major impact on the environment and climate. On the other hand, it is important to ensure efficient energy consumption in order to stimulate economic development and preserve the environment. As scheduling conflicts in the different workshops are closely associated with energy consumption. However, we find in the literature only a brief work strictly focused on two directions of research: the scheduling with PM and the scheduling with energy. Moreover, our objective is to combine both aspects and directions of in-depth research in a single machine. In this context, this article addresses the problem of integrated scheduling of production, preventive maintenance (PM) and corrective maintenance (CM) jobs in a single machine. The objective of this article is to minimize total energy consumption under the constraints of system robustness and stability. A common model for the integration of preventive maintenance (PM) in production scheduling is proposed, where the sequence of production tasks, as well as the preventive maintenance (PM) periods and the expected times for completion of the tasks are established simultaneously; this makes the theory put into practice more efficient. On the basis of the exact Branch and Bound method integrated on the CPLEX solver and the genetic algorithm (GA) solved in the Python software, the performance of the proposed integer binary mixed programming model is tested and evaluated. Indeed, after numerically experimenting with various parameters of the problem, the B&B algorithm works relatively satisfactorily and provides accurate results compared to the GA algorithm. A comparative study of the results proved that the model developed was sufficiently efficient.
EN
In this article we present an industrial application of our mathematical model that integrates planning and scheduling. Our main objective is to concretize our model and compare the reel results with the theoretical ones. Our application is realized on a conditioning line of pharmaceutical products at the ECAM EPMI production laboratory. For this reason and to save time, we used Witness simulation tool. It gives an overall idea of how the line works, the Makespan of each simulation and it highlights areas for improvement. We looked for the best resulting sequence which corresponds to the minest Makespan and total production cost. Then this sequence is applied on the conditioning line of pharmaceutical products for simulation. On the other hand, we program our mathematical model with the parameters of the conditioning line under python in version 3.6 and we adopt a simulation/optimization coupling approach to verify our model.
EN
Time-of-use (TOU) electricity pricing has been applied in many countries around the world to encourage manufacturers to reduce their electricity consumption from peak periods to off-peak periods. This paper investigates a new model of Optimizing Electricity costs during Integrated Scheduling of Jobs and Stochastic Preventive Maintenance under time of-use (TOU) electricity pricing scheme in unrelated parallel machine, in which the electricity price varies throughout a day. The problem lies in assigning a group of jobs, the flexible intervals of preventive maintenance to a set of unrelated parallel machines and then scheduling of jobs and flexible preventive maintenance on each separate machine so as to minimize the total electricity cost. We build an improved continuous-time mixed-integer linear programming (MILP) model for the problem. To the best of our knowledge, no papers considering both production scheduling and Stochastic Preventive Maintenance under time of-use (TOU) electricity pricing scheme with minimization total Electricity costs in unrelated parallel machine. To evaluate the performance of this model, computational experiments are presented, and numerical results are given using the software CPLEX and MATLAB with then discussed.
EN
This paper reports a new multi-item planning and scheduling problem in a job-shop production system with the consideration of energy consumption. A mixed integer linear programming is proposed to integrate planning and scheduling with the consideration of energy aspect. In this study a new operational constraint is considered in the tactical level because of the huge interest given to energy consumption and its strong link existing with production system. To evaluate the performance of this model, computational experiments are presented, and numerical results are given using the software CPLEX and then discussed.
EN
Nowadays, selective solid waste management in the European Union belongs to important responsibilities of municipalities. In Solid Waste Management (SWM) the main operational task is to set a schedule for solid waste collection and to find optimal routes for garbage trucks, so that the total costs of the solid waste collection service can be minimized, subject to a series of constraints which not only guarantee the fulfillment of the SWM’s obligations but also ensure the desirable quality level of that service. The optimization in garbage truck routing belongs to so called rich Vehicle Routing Problems as it aims to cover the following constraints: pickup nodes (clients) must be visited during their predefined time windows; the number and capacity of depots and specialized sorting units cannot be exceeded; each garbage truck can be assigned to at most one depot; each route should be dedicated to collecting one type of segregated solid waste, and the route must be served by a garbage truck which can collect that type of solid waste; the availability of garbage trucks and their drivers must be respected; each garbage truck must be drained at a specialized sorting unit before going back to the depot. This paper contributes a newly developed Mixed-Integer Programming (MIP) model for the Municipal Solid Waste Selective Collection Routing Problem (MSWSCRP) with time windows, limited heterogeneous fleet, and different types of segregated solid waste to be collected separately. Results obtained for solving small-sized instance of the MSWSCRP are reported.
EN
In order to achieve two main objectives: (1) reduce risk and (2) increase the expected rate of return on invested capital, coal mining and coal trading companies have looked for new ways to improve their supply chain networks. Developments in the supply chain design and analysis have helped coal mining and coal trading companies expand their businesses, but at the same time, have forced them to consolidate their assets and downsize any underused storage facilities. In the coal mining industry, the problem of consolidation and downsizing becomes much more complicated due to the variety in quality parameters (hence many coal grades) involved, locational zones and different number of market players. Furthermore, for the last decade, the storage allocation and assignment problem has received a great deal of attention within the Logistics and Operation Research (OR) area. Yet, little attention has been given to the modeling of coal supply chains and the issue of strategic supply chain planning of coal-producing and coal-trading companies. Similar to the generic warehouse consolidation problem (WCP), in specific cases of coal-producing and coal-trading companies, storage facilities that are redundant or underutilized can be eliminated without causing a negative impact on customer and service levels. In this context, this paper discusses the background of the problem and proposes a mixed-integer linear programming (MILP) model mainly intended for storage and distribution network reconfiguration of a coal-producing or trading company. The model, which can be implemented in a high-level mathematical modelling system such as GAMS or AIMMS, captures the essential methodological features of a warehouse restructuring and/or consolidation problem and can be applied in practice.
PL
Wśród szeregu przedsięwzięć realizowanych przez przedsiębiorstwa produkujące i handlujące węglem kamiennym w kierunku osiągnięcia dwóch podstawowych celów swojej działalności, jakimi są (1) zmniejszenie ryzyka oraz (2) zwiększenie oczekiwanej stopy zwrotu z zaangażowanego kapitału, istotną rolę pełni konsekwentne usprawnianie sieci dostaw tego nośnika energii pierwotnej. Projektowanie przedmiotowego systemu oraz analiza łańcucha dostaw węgla stwarza warunki dla dalszej ekspansji spółek; zmusza jednocześnie ich zarządy do przeprowadzania konsolidacji posiadanych aktywów oraz redukowania niewykorzystanych zasobów magazynowych. W branży węglowej problem ten komplikuje się głównie ze względu na zmienność parametrów jakościowych występującego w obrocie węgla (w konsekwencji dużej liczby klas/sortymentów), różnorodną lokalizację oraz dużą liczbę uczestników rynku. Problem efektywnej alokacji powierzchni magazynowych stanowi coraz częściej poruszane zagadnienie w literaturze przedmiotu. Niestety, jak dotychczas niewystarczające zainteresowanie towarzyszyło zarówno modelowaniu łańcucha dostaw węgla jak i problemowi planowania strategicznego w spółkach węglowych i przedsiębiorstwach handlujących węglem. Poprzez analogię do ogólnego problemu konsolidacji powierzchni magazynowych można pokazać, że w przypadku przedmiotowych przedsiębiorstw niepotrzebne lub niewykorzystane kubatury składowisk mogą zostać wyeliminowane bez spowodowania negatywnych skutków dla odbiorców. W odniesieniu do powyższego, w artykule przedstawiono zwięzłą analizę tła problemu oraz zaproponowano rozwiązanie zagadnienia rekonfiguracji sieci dystrybucyjnej rozważanych przedsiębiorstw wydobywających i handlujących węglem kamiennym z wykorzystaniem podejścia programowania matematycznego liniowego całkowitoliczbowego (MILP). Podobny model (który może być zaimplementowany w systemie modelowania, takim jak GAMS lub AIMMS), uwzględnia wszystkie istotne elementy metodyczne problemu konsolidacji powierzchni magazynowych i może być skutecznie wykorzystany do celów praktycznych.
EN
Underestimating facility location decisions may penalize business performance over the time. These penalties have usually been studied from the economic point of view, analyzing its impact on profitability. Additionally, the concern about obtaining sustainability is gaining importance, leading to a search for renewable energy sources to reduce greenhouse gas emissions. However, little attention has been paid to choosing a location considering environmental criteria. Thus, this work aims at determining a biorefinery location considering its impacts on natural resources. Therefore, a mixed integer linear programming (MILP) model has been developed, taking into account crop location and biomass production seasonality to obtain a proper location that minimizes environmental impact.
EN
The article presents the problem of optimizing the supply chain from the perspective of a logistics provider and includes a mathematical model of multilevel cost optimization for a supply chain in the form of MILP (Mixed Integer Linear Programming). The costs of production, transport and distribution were adopted as an optimization criterion. Timing, volume, capacity and mode of transport were also taken into account. The model was implemented in the environment of LINGO ver. 12 package. The implementation details, the basics of LINGO as well as the results of the numerical tests are presented and discussed. The numerical experiments were carried out using sample data to show the possibilities of practical decision support and optimization of the supply chain. In addition, the article presents the current state of logistics outsourcing.
EN
In this paper, an efficient mapping of intellectual property (IP) cores onto a scalable multiprocessor system-on-chip with a k-ary 2-mesh network-on-chip is performed. The approach is to place more affine IP cores closer to each other reducing the number of traversed routers. Affinity describes the pairwise relationship between the IP cores quantified by an amount of exchanged communication or administration data. A genetic algorithm (GA) and a mixed-integer linear programming (MILP) solution use the affinity values in order to optimize the IP core mappings. The GA generates results faster and with a satisfactory quality relative to MILP. Realistic benchmark results demonstrate that a tradeoff between administration and communication affinity significantly improves application performance.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.