To solve the vehicle routing problem with simultaneous pickup–delivery and time windows (VRPSDPTW), a sine cosine firefly perturbed sparrow search algorithm (SFSSA) is presented. Based on standard algorithm, initial population uses tent chaotic mapping to change diversity; then, discoverer location updated using fluctuation range of random weight factor, finally global perturbation strategy. In...

Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...

in this paper, we investigate a decision support system (dss) for the resolution of real-life vehicle routing and scheduling problem (vrsp). scheduling the deliveries from a regional distribution centre (rdc) to large stores of a major fmcg retailer includes every possible vehicle routing complexity. usual constraints that are seen are: size of the vehicle and the length of the driving day, loa...

In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a shared service. The problem consists of designing a set of minimum cost vehicle routes satisfying capacity, duration, time window, pairing, precedence and ride time constraints. This paper introduces a mixed-integer progr...

the heterogeneous fixed fleet open vehicle routing problem (hffovrp) is one of the most significant extension problems of the open vehicle routing problem (ovrp). the hffovrp is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. in this problem, the vehicle doesn’t return to the depot after se...

Cross docking is a logistics strategy that strives to reduce inventory holding costs, shipping costs, and delays in delivering the products. In this research, an optimization model is presented for split loading and unloading products by suppliers and customers, vehicle routing with fuzzy possibilistic time window constraints among them, assignment of vehicles to cross dock, consolidation and i...

Vehicle routing problems have various extensions such as time windows, multiple vehicles, backhauls, simultaneous delivery and pick-up, etc. The objectives of all these problems are to design optimal routes minimizing total distance traveled, minimizing number of vehicles, etc that satisfy corresponding constraints. In this study, an ant colony optimization based heuristic that can be used to s...

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

 We consider a pickup and delivery vehicle routing problem (PDP) commonly find in real-world logistics operations. The problem includes a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of transportation orders, each of which has pickup time windows and delivery time...

This paper aims to study the split load vehicle routing problem in order to find a solution which would decrease logistics’ cost by implementing simultaneous delivery and pickup which is part of the multi-attribute vehicle routing problem. A model was established based on certain preconditions and assumptions considering some specific characteristics in this simultaneous delivery and pickup pro...