This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-city mail distribution problem faced by Australia Post. First we describe the Australia Post mail distribution problem and outline the heuristic vehicle routing algorithm used to find vehicle routes. We present a new mul...

in this study the location routing problem with fuzzy parameters is taken into account, this problem involves determining the location of the depots and routing of the vehicles in order to serve the customers. in this study a location routing problem with fuzzy travel times and due dates is considered and two objective models are proposed. the considered objectives are minimizing the total cost...

In this paper, the fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery (FMDVRP-SPD) is investigated. The FMDVRP-SPD is the problem of allocating customers to several depots, so that the optimal set of routes is determined simultaneously to serve the pickup and the delivery demands of each customer within scattered depots. In the problem, both pickup and delivery dema...

Location-Routing Problem (LRP) is related to logistics system of supply chain. In LRP, aims are facility location problem and vehicle routing problem that are considered simultaneously. As shown in recent researches, the costs in distribution systems may be excessive if routes are ignored when locating depots. In this paper, a heuristic method in four phases is developed to solve Capacitated Lo...

As pointed out by Nagy and Salhi in their recent survey [1], many variants of the location routing problem (LRP) are addressed in the literature. Generally speaking the LRP consists of determining locations for depots from which customers are served on routes with the objective of minimizing the overall cost. In this talk we consider the capacitated locationrouting problem (CLRP) which is defin...

Using shared resources has created better opportunities in the field of sustainable logistics and procurement. The Multi-Depot Traveling Purchaser Problem under Shared Resources (MDTPPSR) is a new variant (TPP) inbound logistics. In this problem, each depot can purchase its products using other depots, vehicles do not have to return their starting depots. routing problem Multi-Trip, Open Vehicl...

This paper presents a new mathematical model of the vehicle routing problem in the context of city distribution, which considers multi-depot, multi-model vehicles and multi-task. The objective function includes three parts: transport cost, deadheading cost and time cost. To solve this mathematical model, a self-adaptive and polymorphic ant colony algorithm (APACA) has been introduced. Finally, ...

In this paper, we address the Two-Echelon Vehicle Routing Problem (2E-VRP) in which freight is delivered from depots to intermediary satellites, from where it is delivered to customers. Different from other multi-level problems, the focus in 2E-VRP is on the global routing costs of the overall network. 2E-VRP has been recently introduced and, to our knowledge, there are no studies of the impact...

This paper presents a method for solving the multi-depot location-routing problem (MDLRP). Since several unrealistic assumptions, such as homogeneous #eet type and unlimited number of available vehicles, are typically made concerning this problem, a mathematical formulation is given in which these assumptions are relaxed. Since the inherent complexity of the LRP problem makes it impossible to s...