in many practical distribution networks, managers face significant uncertainties in demand, local price of building facilities, transportation cost, and macro and microeconomic parameters. this paper addresses design of distribution networks in a supply chain system which optimizes the performance of distribution networks subject to required service level. this service level, which is considere...

A multiobjective programming for transportation model with the consideration of both depot to customer and customer to customer relationships is proposed in this research. The objectives are to minimize the total transportation cost which is the baseline objective and to minimize the overall independence value. A Lexicographic Goal Programming (LGP) is applied to the proposed model. A minimizat...

A space transportation infrastructure is described that utilizes propellant depots to support all foreseeable missions in the Earth-Moon vicinity and deep space out to Mars. The infrastructure utilizes current expendable launch vehicles such as the Delta IV Heavy, Atlas V, and Falcon 9, for all crew, cargo, and propellant launches to orbit. Propellant launches are made to a Low-Earth-Orbit (LEO...

in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...

 In many practical distribution networks, managers face significant uncertainties in demand, local price of building facilities, transportation cost, and macro and microeconomic parameters. This paper addresses design of distribution networks in a supply chain system which optimizes the performance of distribution networks subject to required service level. This service level, which is consider...

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

ID: I935 Timothy W. Duket and Seokcheon Lee School of Industrial Engineering, Purdue University West Lafayette, IN 47906

This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.

The mission of logistics is basically to get the right goods or services to the right place, at the right time, and in the desired conditions, while making the greatest contribution to the company [1]. Everyday a distribution company has to decide how to put goods onto pallets according to the customers’ orders and then how to efficiently distribute these pallets among the number of trucks so a...