نتایج جستجو برای: multi objective mixed integer linear programming momilp problem

تعداد نتایج: 2499164  

Journal: :journal of optimization in industrial engineering 2010
majid khalili mohammad jafar tarokh bahman naderi

this paper studies the multi-stage supply chain system (msscm) controlled by the kanban mechanism. in the kanban system, decision making is based on the number of kanbans as well as batch sizes. a kanban mechanism is employed to assist in linking different production processes in a supply chain system in order to implement the scope of just-in-time (jit) philosophy. for a msscm, a mixed-integer...

Journal: :مهندسی صنایع 0
علی بزرگی امیری استادیار دانشکده مهندسی صنایع- پردیس دانشکده های فنی- دانشگاه تهران سارا سادات ترکستانی دانشجوی دکتری مهندسی صنایع- دانشکده صنایع- دانشگاه علم و صنعت ایران امین سراجیان دانش آموخته کارشناسی ارشد مهندسی صنایع- دانشکده صنایع- دانشگاه علم و صنعت ایران

this paper proposes a new mathematical model for designing and planning postal parcels carriage and postal networks. the objective of postal network designing is to determine the location, size and connection between the postal stations in a city, province or country. in this paper, a kind of multiple locations-allocations hub problem with limited capacity in collecting, distributing and broadc...

Journal: :international journal of industrial mathematics 2011
e. ansari h. zhiani rezai

A three-level relief chain including a number of suppliers in fixed locations, candidate distribution centers and affected areas at certain points are considered. A mixed integer nonlinear programming model is proposed for open transportation location routing problem by considering split delivery of demand. To solve a realistic problem, foregoing parameters are considered as fuzzy in our propos...

This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...

دررودی, مریم, صادقیان, رامین,

In this paper, a general process is developed to find all non-dominated solutions of the multi objective combinatorial optimization (MOCO) problem. This process is based on the elastic constraints method and applies the identification of objective's bounds for it. Objectives bounds are determined by solving single objective integer programming problems. First the elastic constraints method is...

Journal: :iranian journal of fuzzy systems 2009
nikbakhsh javadian yashar maali nezam mahdavi-amiri

we present a new model and a new approach for solving fuzzylinear programming (flp) problems with various utilities for the satisfactionof the fuzzy constraints. the model, constructed as a multi-objective linearprogramming problem, provides flexibility for the decision maker (dm), andallows for the assignment of distinct weights to the constraints and the objectivefunction. the desired solutio...

Journal: :journal of optimization in industrial engineering 2014
keyvan sarrafha abolfazl kazemi alireza alinezhad

integrated production-distribution planning (pdp) is one of the most important approaches in supply chain networks. we consider a supply chain network (scn) to consist of multi suppliers, plants, distribution centers (dcs), and retailers. a bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

Integrated production-distribution planning (PDP) is one of the most important approaches in supply chain networks. We consider a supply chain network (SCN) to consist of multi suppliers, plants, distribution centers (DCs), and retailers. A bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

Journal: :Filomat 2022

In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work to effectively implement ?-constraint method produce complete set of non dominated points. convergence algorithm has been established theoretically. Further comparative study some existing also made.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید