نتایج جستجو برای: dependent vehicle routing problem

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

Journal: :international journal of supply and operations management 0
mohammad mirabi department of industrial engineering, ayatollah haeri university of meybod, meybod, yazd, iran nasibeh shokri group of industrial engineering, elm-o-honar university, yazd iran ahmad sadeghieh group of industrial engineering, yazd university, yazd, iran

this paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. the mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. furthermore, ...

Journal: :European Journal of Operational Research 2008

Journal: :مهندسی صنایع 0
نرگس نوروزی دانشجوی دکتری مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران رضا توکلی مقدم استاد دانشکدة مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران محسن صادق عمل نیک دانشیار دانشکدة مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران صادق خائفی دانشجوی کارشناسی ارشد دانشکدة مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران

increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may ...

Journal: :Oper. Res. Lett. 2009
David Soler José Albiach Eulalia Martínez

In this paper we deal with a generalization of the Vehicle Routing Problem with Time Windows that considers time-dependent travel times and costs. Through several steps we transform this extension into an Asymmetric Capacitated Vehicle Routing Problem, so it can be solved both optimally and heuristically with known codes.

Ali Nadizadeh, Yahia Zare Mehrjerdi,

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

H. Larki M. Sayyah M. Yousefikhoshbakht,

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

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

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

Journal: :مدیریت زنجیره تأمین 0
عرفان بابایی تیرکلایی سعید سائیل پور سیدحمید میرمحمدی

this paper discusses the multi-depot vehicle routing problem of heterogeneous fleet of vehicles with time windows for perishable commodities. the objective of the problem is to minimize the total time required for servicing all customers that is equivalent to the total cost. commodities are delivered to the customers with defined time windows by a fleet of heterogeneous vehicles, which have lim...

Journal: :INTERNATIONAL JOURNAL FOR TRAFFIC AND TRANSPORT ENGINEERING 2013

Journal: :journal of optimization in industrial engineering 2015
majid yousefikhoshbakht frazad didehvar farhad rahmati

the heterogeneous fixed fleet open vehicle routing problem (hffovrp) is one of the most significant extension problems of the open vehicle routing problem (ovrp). the hffovrp is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. in this problem, the vehicle doesn’t return to the depot after se...

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

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