Supplier selection in vehicle routing problem with hard and soft time windows-modeling and solving approach
Supplier selection in vehicle routing problem with hard and soft time windows-modeling and solving approach
mehdi ghafari1 sonia beheshti2
1) exp: Iran university of seience and technology
2) exp: Iran university of seience and technology
IOI Code
:
XYHD-BFAAH
Publication :
International Conference On Research Science And Technology(restconf.org)
Abstract :
The basic vehicle routing problem (VRP) one of the most important issues in the field of NP-hard combinatorial optimization consists of a number of customers, each requiring a specified weight of goods to be delivered. Vehicles dispatched from a single depot must deliver the goods required, and then return to the depot. Each vehicle can carry a limited weight. Only one vehicle is allowed to visit each customer. The problem is to and a set of delivery routes satisfying these requirements and giving minimal total cost. In this research, each customer provides a time interval during which a particular task must be completed such as unloading the vehicle .Each customer has a time bound within which its demand is to be delivered. In this study, there are several suppliers. In this problem, there are two kinds of customers. The first type is the consumers who use the manufactured material or material loaded from the depot or the factory. The second types of customers are suppliers who provide the raw material and send it to the depot. So, the vehicle loads the material from the depot, renders service to the consumers in the way, that is it delivers the manufactured products to the consumers, and takes delivery of the necessary raw material from the suppliers and returns to the storehouse. This problem will be modeling
Keywords : vehicle routing problem hard time windows selection of supplier