نتایج جستجو برای: objective mixed integer linear programming momilp problem
تعداد نتایج: 2163396 فیلتر نتایج به سال:
vehicle routing problem (vrp) is one of the major problems in the transportation and distribution planning. in the most previous studies, the objective of vrp models was distance and vehicle related costs. however in many industrial cases along with routing distance, vehicle loading amount is a factor of cost function. in this paper, we formulate a mixed integer non-linear programming (minlp) m...
A famous travelling salesman problem, appearing simple to state but complex solve, has been widely investigated and various algorithms have proposed. In this article, mixed integer linear programming of python (MIP) is used model problem with varying input data. The result shows that small data the modelling code MIP executing quickly converging optimal value, while large scale require plenty c...
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
in this paper we investigate multi-objective integer linear programming (moilp) problems with unbounded feasible region and introduce recession direction for moilp problems. then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of moilp problems. finally we present some examples with unbounded feasible region and fi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید