نتایج جستجو برای: objective mixed integer linear planning
تعداد نتایج: 1404160 فیلتر نتایج به سال:
During the last decades, research in multi-objective optimisation has seen considerable growth. However, this activity been focused on linear, non-linear, and combinatorial with multiple objectives. Multi-objective mixed integer (linear or non-linear) programming received considerably less attention. In paper we propose an algorithm to compute a finite set of non-dominated points/efficient solu...
In recent decades, due to market growth and use of synthetic fiber, the fashion industry faces a rapid increase of CO2 emission throughout the production cycle and raises environmental issues in recovery processing. This study proposes a closed-loop supply chain (CLSC) structure in fashion industry and develops its planning model as multi-objective mixed integer linear programming to find an op...
This paper addresses the optimal design and planning of biomass-to-liquids (BTL) supply chains under economic and environmental criteria. The supply chain consists of multisite distributed-centralized BTL processing networks. The economic objective is measured by the total annualized cost, and the measure of environmental performance is the life cycle greenhouse gas emissions. A bi-criterion, m...
In this paper novel optimization models are proposed for planning Wireless Mesh Networks (WMNs), where the objective is to minimize the network installation cost while providing full coverage to wireless mesh clients. Our mixed integer linear programming models allow to select the number and positions of mesh routers and access points, while accurately taking into account traffic routing, inter...
Vehicle Routing Problem (VRP) is a key element of many transportation systems which involve routing of fleet of vehicles from a depot to a set of customers node. It is required that these vehicles return to the depot after serving customers’ demand. This paper investigates a relaxed version of VRP, in which the number of visits to the customer is not restricted to be at most one. The relaxed ve...
This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives are to minimize total travel costs and customer waiting, and to balance the daily workload over the planning hor...
We introduce a new way of generating cutting planes of a mixed integer programme by way of taking binary variables. Four binary variables are introduced to form quartic inequalities, which results in a reduced first-level mixed integer programme. A new way of weakening the inequalities is presented. An algorithm to carryout the separation of the inequalities, which are exponential in number, is...
In this paper, we propose a new model for designing integrated forward/reverse logistics based on pricing policy in direct and indirect sales channel. The proposed model includes producers, disposal center, distributers and final customers. We assumed that the location of final customers is fixed. First, a deterministic mixed integer linear programming model is developed for integrated logistic...
This study considers a real-world multi-period, multi-product production planning problem involving set-up constraints, with random yield and demand. The resulting large-scale multi-stage stochastic mixed-integer model cannot be solved by using the mixed-integer solver of a commercial optimization package. The production planning model is a mixed-integer programming (MIP) model without any spec...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید