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

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

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

A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (...

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 ...

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...

A. Salamatbakhsh-Varjovi M. Alinaghian M. Fallah R. Tavakkoli-Moghaddam,

Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...

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...

This paper formulates a mathematical model for the Green Vehicle Routing Problem (GVRP), incorporating bi-fuel (natural gas and gasoline) pickup trucks in a mixed vehicle fleet. The objective is to minimize overall costs relating to service (earliness and tardiness), transportation (fixed, variable and fuel), and carbon emissions. To reflect a real-world situation, the study considers: (1) a co...

Journal: :American Journal of Operations Research 2023

The main objective of this paper is to propose a new hybrid algorithm for solving the Bi green vehicle routing problem (BGVRP) from BicriterionAnt metaheuristic. methodology used subdivided as follows: first, we introduce data GVRP or instances literature. Second, use first cluster route second technique using k-means algorithm, then apply BicriterionAntAPE (BicriterionAnt Adjacent Pairwise Exc...

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...

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

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