In this paper, a special case of the vehicle routing problem in which the demands consist in a set of rectangular two-dimensional weighted items is considered. The vehicles have a two-dimensional loading surface and a maximum weight capacity. These problems have a routing and a packing component. A framework to handle the loading of a vehicle is proposed. A Constraint Programming loading model ...

In this paper, a special case of the vehicle routing problem in which the demands consist in a set of rectangular two-dimensional weighted items is considered. The vehicles have a two-dimensional loading surface and a maximum weight capacity. These problems have a routing and a packing component. A framework to handle the loading of a vehicle is proposed. A Constraint Programming loading model ...

We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory management problem and the vehicle routing problem with time windows, both of which are known to be NP-hard. Under this framework, algorithms that solve the underlying sub-problems collaborate rigorously yet in a comput...

Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Algorithms and Scatter Search coupled with a decomposition-into-petals procedure for solving a class of Vehicle Routing and Scheduling Problems. The parallel genetic algorithm presented is based on the island model and was run on...

The purpose of this paper is to provide basic models for highly relevant extensions of the classical vehicle routing problem in the context of supply chain management. The classical vehicle routing problem is extended in various ways. We will especially focus on extensions with respect to lotsizing, scheduling, packing, batching, inventory and intermodality. The proposed models allow for a more...

 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 studies location routing and scheduling problems, a class of problems in which the decisions of facility location, vehicle routing, and route assignment are optimized simultaneously. For a version with capacity and time restrictions, two formulations are presented, one graph-based and one set-partitioning-based. For the set-partitioning-based formulation, valid inequalities are ident...

one of methods of improvement of the material flow is cross docking that in is considered as a good method to reduce inventory and improve customer satisfaction. too, the vehicle routing problem is one of the important problems in distribution management and its goal is to find paths for delivering various cargos. therefore, this study was conducted in order to vehicle routing problem with cros...

A key element of many distribution systems is the routing and scheduling of vehicles through a set of nodes requiring service. The Vehicle Routing Problem (VRP) can be defined as a problem of finding the optimal routes of delivery or collection from one or several depots to a number of cities or customers, while satisfying some constraints. In many practical situations, however, the vehicle is ...

Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...