In this presentation, we consider the Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) in which the delivery to a customer can be split between any number of vehicles. This problem has not been extensively studied in the literature. The main contribution of this paper is a Branch and Price approach for solving the SDVRPTW without imposing restrictions on the split delivery opt...

This paper addresses the robust vehicle routing problem with time windows. We are motivated by a problem that arises in maritime transportation where delays are frequent and should be taken into account. Our model only allows routes that are feasible for all values of the travel times in a predetermined uncertainty polytope, which yields a robust optimization problem. We propose two new formula...

Products distribution is a process on which products are moved from sources to customers. According to Toth and Vigo [1], transportation costs typically represent 10-20% of the final price of goods on the market. Over the past 20 years, Vehicle Routing Problem (VRP) was especially solved through the use of meta-heuristics, see Jozefowiez et al. [2], Vidal et al. [3]. Eksioglu et al. [4] made a ...

We investigate two matheuristic strategies using the periodic vehicle routing problem with time windows as a testbed. Two different metaheuristics are suitably combined with parts of a developed column generation approach: On the one hand a variable neighborhood search (VNS) acts as the sole provider of columns for a set covering model, hence realizing a pure metaheuristic column generation. He...

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 studies approximations to the average length of Vehicle Routing Problems (VRP) with time window, route duration, and capacity constraints. The approximations are valuable for the strategic and planning analysis of transportation and logistics problems. Using asymptotic properties of vehicle routing problems and the average probability of successfully sequencing a customer with time w...

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 chapter we are going to study metaheuristics based on the Automata Theory for the Multi-objective Optimization of Combinatorial Problems. As well known, Combinatorial Optimization is a branch of optimization. Its domain is optimization problems where the set of feasible solutions is discrete or can be reduced to a discrete one, and the goal is to find the best possible solution(Yong-Fa ...

This study has extended a vehicle routing problem, with time-windows (VRPTW), by considering the randomness of the perishable food delivery process, and constructing a SVRPTWmodel, to obtain optimal delivery routes, loads, fleet dispatching and departure times for delivering perishable food from a distribution center. Our objective was to minimize not only the fixed costs for dispatching vehicl...

In vehicle routing problems with time windows (VRPTW), a set of vehicles with limits on capacity and travel time are available to service a set of customers with demands and earliest and latest time for servicing. The objective is to minimize the cost of servicing the set of customers without being tardy or exceeding the capacity or travel time of the vehicles. As finding a feasible solution to...