نتایج جستجو برای: objective integer linear programming
تعداد نتایج: 1313604 فیلتر نتایج به سال:
We present a generic branch-and-bound algorithm for finding all the Pareto solutions of biobjective mixed-integer linear program. The main contributions are new algorithms obtaining dual bounds at node, checking node fathoming, presolve, and duality gap measurement. Our is predominantly decision space search method because branching performed on variables, akin to single objective problems, alt...
this paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. for solving this multi-objective model, we develop a fuzzy multi-objective linear programming (fmolp) model. in this problem, a proposed fmolp method is applied with respect to the o...
This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...
in this paper the real-world occurrence of the multiple-product multiple-constraint single period newsboy problem with two objectives, in which there is incremental discounts on the purchasing prices, is investigated. the constraints are the warehouse capacity and the batch forms of the order placements. the first objective of this problem is to find the order quantities such that the expected ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید