نتایج جستجو برای: location routing problem with time window

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

This paper presents a new model of two-echelon periodic supply vessel planning problem with time windows mix of facility location (PSVPTWMFL-2E) in an offshore oil and gas industry. The new mixed-integer nonlinear programming (MINLP) modelconsists ofa fleet composition problem and a location-routing problem (LRP). The aim of the model is to determine the size and type of large vessels in the fi...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان - دانشکده ریاضی 1390

abstract: in the paper of black and scholes (1973) a closed form solution for the price of a european option is derived . as extension to the black and scholes model with constant volatility, option pricing model with time varying volatility have been suggested within the frame work of generalized autoregressive conditional heteroskedasticity (garch) . these processes can explain a number of em...

Ashesh Kumar Sinha Ugandhar Delli

We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...

Journal: :CoRR 2011
Greg N. Frederickson Barry Wittman

Two multivehicle routing problems are considered in the framework that a visit to a location must take place during a specific time window in order to be counted and all time windows are the same length. In the first problem, the goal is to visit as many locations as possible using a fixed number of vehicles. In the second, the goal is to visit all locations using the smallest number of vehicle...

Babaee Tirkolaee, E., Dehnavi - Arani, S., Goli, A., Mirmohammadi, S. H.,

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...

Journal: :Transportation Science 2005
Toshihide Ibaraki Shinji Imahori Mikio Kubo T. Masuda Takeaki Uno Mutsunori Yagiura

We propose local search algorithms for the vehicle routing problem with soft time window constraints. The time window constraint for each customer is treated as a penalty function, which is very general in the sense that it can be non-convex and discontinuous as long as it is piecewise linear. In our algorithm, we use local search to assign customers to vehicles and to find orders of customers ...

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

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