This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a pathrelinking intensification procedure ...

We propose an algorithmic framework that successfully addresses three vehicle routing problems: the multi-depot VRP, the periodic VRP, and the multi-depot periodic VRP with capacitated vehicles and constrained route duration. The meta-heuristic combines the exploration breadth of population-based evolutionary search, the aggressive improvement capabilities of neighborhood-based meta-heuristics,...

Despite some successful applications of genetic algorithms (GAs) for solving the capacitated vehicle routing problems, they usually rely on problem-specific components or hybridization with other heuristics for obtaining competitive solutions. These problemspecific and hybridized characteristics complicate the GA implementation for solving reallife problems. In this paper, a pure GA for the cap...

In this paper, we present a new formulation of one-stop capacitated hub-and-spoke model as a natural extension of the uncapacitated one-stop model. The model involves arc capacity constraints as well as hub capacity constraints, which enables us to incorporate some practical factors into the model. We also present a branch-and-bound based exact solution method with Lagrangian relaxation boundin...

This paper presents a discussion arisen after reading ”A hybrid genetic algorithm that optimizes capacitated vehicle routing problem”, by Chung-Ho Wang and Jiu-Zhang Lu, (2009). Expert System with Applications (35)(pp. 2921-2936). The discussed paper presents a hybrid genetic algorithm applied to the Capacitated Vehicle Routing Problem (CVRP). When the authors present the results obtained by th...

This paper describes a new method for solving the Capacitated Vehicle Routing Problem (CVRP). The CVRP is defined as the problem of delivering goods from a depot to a number of customers with a fleet of capacitated vehicles, minimizing the cost of distributing the goods while respecting the capacity constraints of the vehicles. We have developed a method based on Monte Carlo Simulation (MCS) an...

We tackle the Mixed Capacitated General Routing Problem (MCGRP) which generalizes many other routing problems. Very few papers have been devoted to this argument, in spite of interesting real-world applications. We propose an integer programming model for the MCGRP and extend to its polyhedron inequalities valid for the Capacitated Arc Routing Problem (CARP) polyhedron. Identification procedure...