We consider the vehicle routing problem with stochastic demands (VRPSD) on tree structured networks with a single depot. The problem we are concerned with in this paper is to find a set of tours for the vehicle with minimum expected length. Every tour begins at the depot, visits a subset of customers and returns to the depot without violating the capacity constraint. Randomized approximation al...

Abstract The issue of carbon emission reduction has attracted extensive attention in academic circles, but there are few studies on the Pareto frontier analysis multi-depot green vehicle routing problem with multi-objective. In order to effectively balance economic and environmental effects, this paper constructs a bi-objective optimization model for open problems time windows, which takes oper...

In this research discusses the problem of distributing goods from a depot to several customer locations minimize travel costs. The is solved by using Vehicle Routing Problem method. data used in secondary with 10 customers and one depot. aim form model that has been obtained determine optimal route based on formed. first step objective function problem, then constraints may occur. After formed,...

Waste clean-up after a disaster is one of the most critical tasks in response stage management. We develop model to minimise cost and duration waste considering using Temporary Disaster Management Sites (TDWMSs), which can store process before it sent final disposal sites. The problem that arises be seen as Multi-Period Two-echelon Location Routing Problem (MP-2ELRP) main decisions are location...

In this paper we consider an extension of the classical facility location problem where besides n customers, a set of p collection depots are also given. In this setting the service of a customer consists of the travel of a server to the customer and return back to the center via a collection depot. We have analyzed the problem and showed that the collection depots problem can be transformed to...

In vehicle routing problems (VRPs) the decisions to be taken concern assignment of customers vehicles and sequencing assigned each vehicle. Additional may need jointly taken, depending on specific problem setting. this paper, after discussing different kinds in classes VRPs, class where decision about when routes start from depot has is considered related literature reviewed. This problems, tha...

Since the Vehicle Routing Problem (VRP) was introduced by Dantzig and Ramser, it became one of the most studied problems in Combinatorial Optimization. Different solution approaches were proposed over the past decades to solve the VRP and its variants. In this thesis, we discuss about two VRP variants, resulting from the integration of VRPs with distribution problems. The first problem takes pl...

and submitted in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY (Mechanical Engineering) complies with the regulations of the University and meets the accepted standards with respect to originality and quality. Many manufacturers are moving towards green manufacturing. One of the actions for environment friendly manufacturing is collection of end-of-life products...

Abstract This paper introduces the Hierarchical Multi-Switch Multi-Echelon Vehicle Routing Problem, a new variant of well-known Problem. It is real-world problem originating from policies Nordic distribution company. The includes single depot, non-predetermined hierarchy intermediate facilities, and two different fleets, consisting homogeneous original local vehicles, which are pulling swap-bod...