نتایج جستجو برای: bi objective warehouse problem
تعداد نتایج: 1425513 فیلتر نتایج به سال:
This paper proposes an ensemble multi-objective biogeography-based optimization (EMBBO) algorithm, which is inspired by ensemble learning, to solve the automated warehouse scheduling problem. First, a real-world automated warehouse scheduling problem is formulated as a constrained multi-objective optimization problem. Then EMBBO is formulated as a combination of several multi-objective biogeogr...
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...
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...
the location-routing problem is a relatively new branch of logistics system. its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. in this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. another important issue in this regard ...
In this work a problem motivated by a real-world case from a beverage distribution firm in Mexico is addressed. Different planning criteria are taken into account in order to create acceptable territory designs. Namely, each territory needs to be compact, connected and balanced according to two attributes (number of costumers and product demand). Two GRASP based heuristics (BGRASP and TGRASP) a...
This paper deals with fuzzy goal programming approach to bilevel multi-objective programming problem with fuzzy parameters. In the proposed approach, the tolerance membership functions for the fuzzily described objective functions are defined by determining individual optimal solution of the objective functions of each of the decision makers. Since the objectives are potentially conflicting in ...
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, related to the length of the cycle, whereas the second one is to minimize an assignment cost, from non-visited nodes to visited ones. In spite of its natural multi-objective formulation, this problem has never been inv...
This paper presents two new dynamic programming (DP) algorithms to find the exact Pareto frontier for the bi-objective integer knapsack problem. First, a property of the traditional DP algorithm for the multiobjective integer knapsack problem is identified. The first algorithm is developed by directly using the property. The second algorithm is a hybrid DP approach using the concept of the boun...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید