نتایج جستجو برای: depot vehiclerouting problem with inter

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

Journal: :Computers & Industrial Engineering 2015
Ilker Küçükoglu Nursel Öztürk

This paper presents an advanced hybrid meta-heuristic algorithm (HMA) to solve the vehicle routing problem with backhauls and time windows (VRPBTW). The VRPBTW is an extension of the vehicle routing problem with time windows (VRPTW) and the vehicle routing problem with backhauls (VRPB) that includes capacity, backhaul and time window constraints. In this problem, the customers are divided into ...

Journal: :Computers & Industrial Engineering 2016
Laura Calvet Alberto Ferrer M. Isabel Gomes Angel A. Juan David Masip

In real-life logistics and distribution activities it is usual to face situations in which the distribution of goods has to be made from multiple warehouses or depots to the final customers. This problem is known as the Multi-Depot Vehicle Routing Problem (MDVRP), and it typically includes two sequential and correlated stages: (a) the assignment map of customers to depots, and (b) the correspon...

Journal: :International Journal of Reconfigurable & Embedded Systems (IJRES) 2023

<p>Route optimization problem using vehicle routing (VRP) and time window constraint is explained as finding paths for a finite count of vehicles to provide service huge number customers hence, optimizing the path in given duration window. The loop have restricted intake capacity. This initiates from depot, delivers goods, stops at depot. Each customer serve exactly once. If arrival befor...

حسینی, احمد , رئوفی, آزاده , عبدالهیان, پروانه , مهرافزا, مرضیه , نصیری, مهری , نیکپوری, زهرا ,

Background: Polycystic ovarian syndrome (PCOS) is the most common endocrinological disorders that affect approximately 5-7% of women in reproductive age. There is not any consensus about the efficient in vitro fertilization (IVF) protocol for patients with PCOS. The aim of the present study was to compare the half and one-third dose depot gonadotropin-releasing hormone (GnRH) agonist protocols ...

2013
Issam Nouaouri Gilles Goncalves Daniel Jolly

We address in this paper a distribution real case problem facing the fuel supplying companies. The cost of acquiring vehicles is often more significant than the routing cost. The goal is to minimise the number of required vehicles. We deal with a vehicle routing problem with double time windows for the depot and multiple use of vehicles (VRPDM). There is a single depot with double time windows,...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده ادبیات و زبانهای خارجی 1390

abstract a fundamental study of “historio-graphic metafiction” and “literary genres”, as introduced in “new historical philosophy”, and tracing them in the works of julian barnes having studied the two novels, the porcupine and arthur & george, by julian barnes, the researcher has applied linda hutcheon’s historio-graphic metafictional theories to them. the thesis is divided into five cha...

2004
Herminia I. Calvete Carmen Galé María José Oliveros Belén Sánchez-Valverde

The classical vehicle routing problem involves to design a set of routes for a fleet of vehicles based at one central depot that is required to service a number of geographically dispersed customers, while minimizing the total travel distance or the total distribution cost. Each route originates and terminates at the central depot and customers’ demand are known. In many practical distribution ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شیخ بهایی - دانشکده زبانهای خارجی 1391

even though, to date, a lot of studies have been conducted on the subject of politeness theory, there are very few studies regarding the applicability of this theory to translation between english and persian which shows the reason behind conducting the present study. this study was carried out with the aim of highlighting whether there is any difference between english and persian methods of u...

Journal: :Appl. Soft Comput. 2011
Soheil Ghafurian Nikbakhsh Javadian

The fixed destination multi-depot multiple traveling salesmen problem (MmTSP) is a problem, in which more than one salesmen depart from several starting cities and having returned to the starting city, form tours so that each city is visited with exactly one salesman, and the tour lengths stay within certain limits. This problem is of a great complexity and few investigations have been done on ...

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

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