This paper presents a two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows and multiple vehicles (PDPTW). The first stage uses a simple simulated annealing algorithm to decrease the number of routes, while the second stage uses LNS to decrease total travel cost. Experimental results show the effectiveness of the algorithm which has produced many new best...

One of the most important points in a supply chain is customer-driven modeling, which reduces the bullwhip effect in the supply chain, as well as the costs of investment on the inventory and efficient transshipment of the products. Their homogeneity is reflected in the Inventory Routing Problem, which is a combination of distribution and inventory management. This paper expands the classical In...

Background: Manufacturing companies optimize logistics network routing to reduce transportation costs and operational in order make profits an extremely competitive environment. Therefore, the efficiency of management supply chain quick response customers’ demands are treated as additional source profit. One warehouse operations for intelligent design, called cross-docking (CD) operations, is u...

The dynamic vehicle routing and scheduling problem is a well-known complex combinatorial optimization problem that drew significant attention over the past few years. This paper presents a novel algorithm introducing a new strategy to integrate anticipated future visit requests during plan generation, aimed vailable online xxx eywords: enetic algorithms ustomer satisfaction at explicitly improv...

A Steady State Genetic Algorithm (GA) is proposed for the Traveling Salesman Problem with Pickup and Delivery (TSPPD). TSPPD is an extension of the well known Traveling Salesman Problem (TSP). TSPPD is a graph and grouping optimization problem.In this thesis, TSPPD is differentiated by a group of cities as customers, each of them supplying (picking customer) or demanding (delivery customer) a g...

This paper addresses a vehicle scheduling problem encountered in home health care logistics. It concerns the delivery of drugs and medical devices from the home care company's pharmacy to patients' homes, delivery of special drugs from a hospital to patients, pickup of bio samples and unused drugs and medical devices from patients. The problem can be considered as a special vehicle routing prob...

We address in this paper the one-commodity pickup-and-delivery traveling salesman problem, which is characterized by a set of customers, each of them supplying (pickup customer) or demanding (delivery customer) a given amount of a single product. The objective is to design a minimum cost Hamiltonian route for a capacitated vehicle in order to transport the product from the pickup to the deliver...

In this paper we introduce a new, pickup and delivery vehicle routing model where weight limits and also packing constraints are taken into account. In the model the vehicles have to transport 3-dimensional boxes from their pickup points into their delivery points. The boxes have weights and the vehicles has to satisfy a weight limit. We present a heuristic algorithm for the solution of the pro...

This paper introduces the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand (DVRPMSHD). This problem is a more realistic generalization of the Double Vehicle Routing Problem with Multiple Stacks when customers have heterogeneous demands and the demand of each customer cannot be divided among two or more vehicles. The objective of this problem is to find optimal routes...

We address a single commodity Pickup and Delivery Vehicle Routing Problem from the literature. A network of customer nodes is given with both travel times costs. fleet vehicles limited capacity exploited to satisfy node demands, set routes must be found such that vehicle capacities are never exceeded, each route does not exceed time resource, cost minimized. The demands pickup delivery can spli...