مصطفی ستاک
دانشکده مهندسی صنایع- دانشگاه صنعتی خواجه نصیرالدین طوسی
[ 1 ] - مسئله مسیریابی وسیله نقلیه چندانباری ظرفیت‌دار با در نظرگرفتن مسیر بین انبارها
در این مقاله، مسئلهمسیریابی وسیله نقلیه چندانباری، با در نظرگرفتن مسیر بین انبارها بررسی می‌شودکه در آن وسایل نقلیه می‌توانند در دپوهای میانی، بارگیری مجدد انجام دهند. وسایل‌نقلیهبا بار کامل، از دپوی مبدأ شروع به حرکت می‌کنند و مشتریان را تا پایان بار سرویسمی‌دهند. آنها سپس می‌توانند برای بارگیری مجدد به دپوی میانی عزیمت کنند وسرانجام برای اتمام مسیر خود به دپوی مبدأ باز گردند. برای ای...
[ 2 ] - تحلیل مسئله‌ی تبلیغات مشارکتی باوجود گزینه‌های تبلیغاتی در حالت رقابت خرده‌فروش‌ها
در این مقاله، مسئله‌ی تبلیغات مشارکتی با وجود گزینه‌های تبلیغات محلی در زنجیره‌یی شامل یک تولیدکننده و دو خرده‌فروش مطالعه شده است. تولیدکننده برای ترویج نام تجاری خود و خرده‌فروش‌ها به‌منظور دست‌یابی به فروش کوتاه‌مدت تبلیغ می‌کنند. هر خرده‌فروش با مجموعه‌یی از گزینه‌های تبلیغاتی مواجه است که هریک مستقیماً بر سهم بازار تأثیر دارد. تولیدکننده به‌منظور ایجاد انگیزه در خرده‌فروش‌ها برای سرمایه‌گذ...
[ 3 ] - The Bi-Objective Location-Routing Problem based on Simultaneous Pickup and Delivery with Soft Time Window
The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...
[ 4 ] - رتبه بندی روش های ارزش گذاری نام تجاری از دید مشتریان صنعت مالی
اندازه گیری ارزش ویژه نام تجاری هم برای ذینفعان داخل سازمان و هم برای تعدادی از ذینفعان خارج سازمان حائز اهمیت است. اگر چه که روش ها و مدل‌های زیادی برای ارزش گذاری نام تجاری وجود دارد اما هنوز مشخص نشده که بهترین روش کدام است. با این حال، هنوز هیچ تحقیقی وجود ندارد که به طور پیمایشی به رتبه بندی روشهای ارزش گذاری موجود از دید ذینفعان مختلف بپردازد. در این مقاله، مدلی برای رتبه بندی روش ه...
[ 5 ] - A time-dependent vehicle routing problem for disaster response phase in multi-graph-based network
Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...
[ 6 ] - A Multi-Product Inventory Model for Selecting the First and Second Layers of Suppliers in a Supply Chain
In recent years, Supplier evaluation and selection, an important element in supply chain management, has been gaining attention in both academic literature and industrial practice. The Mixed integer multi-Objective non-Linear programming model (MIMONLP) presented in this paper aimed to evaluate and select the appropriate set of suppliers considering quantitative and qualitative criteria and in ...
[ 7 ] - A New Approach for Supplier Selection Process from the Features of Second Layer Suppliers Point of View
In nowadays world competitive market, on account of the development of electronic media and its influence on shortening distances, companies require some core competencies in order to be able to compete with numerous competitors in industry and sustain their situation in such a market. In addition companies achieve this target are those which their processes perform great and exploit from compe...
[ 8 ] - Ambulance routing in disaster response scenario considering different types of ambulances and semi soft time windows
This paper studies the ambulance routing problem (ARP) in disaster situations when a large number of injured people from various locations require receiving treatments and medical aids. In such circumstances, many people summoning the ambulances but the capacity and number of emergency vehicles are not sufficient to visit all the patients at the same time. Therefore, a pivotal issue is to manag...
[ 9 ] - A mathematical model for the electric vehicle routing with time windows considering queuing system at charging stations and alternative paths
Due to many damages that human activities have imposed on the environment, authorities, manufacturers, and industry owners have taken into account the development of supply chain more than ever. One of the most influential and essential human activities in the supply chain are transportation which green vehicles such as electric vehicles (EVs) are expected to generate higher economic and enviro...
[ 10 ] - Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
[ 11 ] - A Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
[ 12 ] - Investigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
[ 13 ] - Designing of Supply Chain Coordination Mechanism with Leadership Considering (RESEARCH NOTE)
Abstract Vertical cooperative (co-op) advertising is typically a cost sharing mechanism and coordinated effort by the channel’s members in order to increase demand and overall profits. In this marketing strategy, the manufacturer shares a fraction of the retailer’s advertising investment. This paper studies the advertising and pricing decisions in a retailer-manufacturer supply chain in which...
[ 14 ] - An Inventory Model for Deteriorating Items Using Vendor-Managed Inventory Policy
In recent researches, vendor managed inventory (VMI) policy is rarely considered for deteriorating items. This study considered the supply chain partner’s collaboration via a VMI system and provided an EOQ model for a two-level supply chain (single supplier - single retailer) to examine the inventory management proceedings for VMI and non-VMI supply chains. By a new approach in modeling, the ...
[ 15 ] - A Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint
In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...
[ 16 ] - Designing Incomplete Hub Location-routing Network in Urban Transportation Problem
In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...
[ 17 ] - تعیین برندگان در مناقصه‌ی ترکیبی با الگوریتم ژنتیک و روش تجزیه‌ی دنتزیگ - ولف
در این مقاله به ارائه‌ی یک روش دومرحله‌یی برای حل دقیق حالت خاصی از مسئله‌ی تعیین برندگان در مناقصه‌ی ترکیبی پرداخته می‌شود که ترکیبی از الگوریتم ژنتیک و روش تجزیه‌ی دنتزیگ - ولف است. الگوریتم فراابتکاری ژنتیک برای یافتن جواب موجه و نزدیک بهینه‌ی مسئله ارائه شده است که خروجی آن نقطه‌ی شروع روش دقیق تجزیه‌ی دنتزیگ - ولف است که با توجه به ساختار بلوکی - قطری مسئله برای تجزیه‌ی مسئله و یافتن جواب ...
نویسندگان همکار