the vehicle routing problem with backhauls (vrpb) as an extension of the classical vehicle routing prob-lem (vrp) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. a primary objective for the problem usually is minimizing the total distribution cost. most real-life problems have othe...

This research present a set-partitioning heuristic to generate populations in a hybrid genetic algorithm (hGA) which is able to solve four different variants of the vehicle routing problem: the multi-depot vehicle routing problem (MDVRP), the heterogeneous fleet and mix decisions (type, size and number of vehicle) (HFMVRP), site dependent vehicle routing problem (SDVRP) and the asymmetric vehic...

the location-routing problem is a relatively new branch of logistics system. its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. in this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. another important issue in this regard ...

in this paper we address the vrpcd, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. the products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. the objective of the vrpcd is to minimize the total traveled distance while respe...

customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. delivery quality has several parameters such as deliver time window options, time window size, etc. in this paper we focus on one of these parameters, namely time window setting. it has a direct impact upon customer satisfaction and busi...