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

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

2010
Francesco Carrabs Raffaele Cerulli M. Grazia Speranza

This paper studies the double traveling salesman problem with two stacks. A number of requests have to be served where each request consists in the pickup and delivery of an item. All the pickup operations have to be performed before any delivery can take place. A single vehicle is available that starts from a depot, performs all the pickup operations and returns to the depot. Then, it performs...

Journal: :iranian journal of pharmaceutical research 0
z raoofi a aflatoonian

long protocol of gonadotropin-releasing hormone-analougue (gnrh-a) can result in the formation of ovarian cyst by the transient initial stimulatory effect which increases the levels of both follicle-stimulating hormone (fsh) and luteinizing hormone (lh). these cysts require surgical drainage or result in poor ovarian response. ovarian cyst formation can be prevented by taking oral contraceptive...

Journal: :The Journal of Japan Institute of Navigation 2005

Journal: :Journal of Mathematics and Its Applications 2018

Journal: :Expert Systems With Applications 2021

Abstract This paper introduces the multi-depot open location routing problem (MD-OLRP) with a heterogeneous fixed fleet. The is inspired by collection of company which collects raw materials from different suppliers coordinating several carriers. Each carrier has Moreover, there cost for contracting each vehicle and variable associated distance traveled. empty haul return to vehicles depot not ...

Journal: :International Journal of Industrial Engineering Computations 2015

Journal: :Croatian Operational Research Review 2021

Research of travel distance on single - depot position in warehouse is tremendous. This study focuses more the effect two-depot order picking problem (OPP) by using concept traveling salesman (TSP) and exact method – Branch Bound (B\&B) algorithm. The total one-depot shorter than for double block warehouses difference less 5%. also compared with approximate methods SA TS which show that dif...

A. Kourank Beheshti, S.H. Mirmohammadi, S.R. Hejazi,

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...

Journal: :Manufacturing Technology 2021

Vehicle Routing Problem is a common problem in logistics, which can simulate in-plant and out-plant material handling. In the article, we demonstrate Problem, contains period, time window multiple depots. this case, customers must be served from several The position of nodes (depots customers), demand are known advance. number capacity constraint vehicles predefined. leave one depot, visit some...

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

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