The new emerging area of Enterprise Wide Optimization (EWO) has focused the attention in effectively solving the combined producion/distribution scheduling problem. The importance of logistic activities performed in multi-site environments comes from the relative magnitude f the associated transportation costs and the good chance of getting large savings on such expenses. This paper first devel...

In the stochastic and dynamic multi-stage vehicle routing problem, a set of vehicles collectively transports and services demands which require service at multiple spatially separated locations. Arrival times and service locations of individual demands are not known until the demand’s arrival, and vehicles are assumed to have infinite capacity and to travel with bounded velocity. The objective ...

This paper introduces the pickup and delivery traveling salesman problem with handling costs (PDTSPH). In the PDTSPH, a single vehicle has to transport loads from origins to destinations. Loading and unloading of the vehicle is operated in a last-in-firstout (LIFO) fashion. However, if a load must be unloaded that was not loaded last, additional handling operations are allowed to unload and rel...

Many companies face challenges in reducing their supply chain costs while increasing sustainability and customer service levels. A comprehensive framework for a sustainable closed-loop (CLSC) network is practical solution to these challenges. Hence, the first time, this study considers an integrated multi-objective mixed-integer linear programming (MOMILP) model design CLSC networks with cross-...

The split pickup and delivery problem is to find the shortest route that can provide delivery nodes with commodities collected from pickup nodes, subject to the vehicle load constraint. In particular, the split feature allows multiple visits to nodes and thus enables the vehicle to load or discharge an arbitrary portion of commodities along the route. This problem concerns the practical situati...

One important problem in transportation and logistics systems is the Multiple Vehicle Pickup and Delivery Problem with Time Windows (MV-PDPTW). The problem deals with a number of pickup and delivery (P&D) requests that should be served by a fleet of vehicles. A delivery location must be served after its corresponding pickup location. The vehicle’s journey should start and end at a central depot...

Distribution companies face great challenges to organize their fleet efficiently. In this work, a study of capacitated vehicle routing problem with simultaneous pickup and delivery between two depots with several nodes spread in between is taken up. The purpose of this study is to develop a heuristic procedure for the above mentioned problem and analyse the results. The problem consists of two ...

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VRPSPD...