We address the logistics and planning problem of delivering Ready Mixed Concrete (RMC) to a set of demand customers from a single depot while respecting time-windows induced restrictions. The RMC Dispatching Problem (RMCDP) is closely related to the Vehicle Routing Problem (VRP) with the difference that demand nodes in the RMCDP may be visited more than once by a truck. This class of routing an...

A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...

Multi-depot Location-Routing Problem (MDLRP) is about finding the optimal number and locations of depots while allocating customers to depots and determining vehicle routes to visit all customers. In this study we propose a nested Lagrangian relaxation-based method for the discrete uncapacitated MDLRP. An outer Lagrangian relaxation embedded in subgradient optimization decomposes the parent pro...

background & aim: nowadays, home health care services play significant roles in modern societies. such services allow the elderly and needy people to pass their treatment process at their own houses in a friendly environment. in this paper, weekly routing and scheduling problem of home health care personnel was investigated. methods & materials: insufficient number of expert personnel or overla...

The Vehicle Routing Problem (VRP) is a well studied logistical problem along with its various variants such as VRP customer Time-Window (VRPTW). However, all the previously assume that vehicles are mostly same in terms of their capacity, location and home (depot). This study uses agent-based approach for solving VRPTW vehicle’s unique depot. to minimise number used main target. Other targets in...

In real-world express systems, couriers need to satisfy not only the delivery demands but also pick-up of customers. Delivery and pickup tasks are usually mixed together within integrated routing plans. Such a problem can be abstracted formulated as Vehicle Routing Problem with Mixed Pickup (VRPMDP), which is an NP-hard combinatorial optimization problem. To solve VRPMDP, there three major chal...

The multi-depot vehicle routing problem (MDVRP) is a very challenging part of supply chain optimization. We propose here a simple yet powerful heuristic for the MDVRP with an integrated look-ahead. Compared to other state-of-the-art approaches, our heuristic is significantly faster, but yields competitive results and even found several new best solutions on a set of standard benchmark problems.

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