Learn More
Tactical planning of operations is comprised of a set of interrelated decisions that aim to ensure an optimal allocation and utilization of resources to achieve the economic and customer service goals of the company. Tactical planning is particularly vital for intercity freight carriers that make intensive use of consolidation operations. Railways and(More)
The paper presents an efficient Hybrid Genetic Search with Advanced Diversity Control for a large class of time-constrained vehicle routing problems, introducing several new features to manage the temporal dimension. New move evaluation techniques are proposed, accounting for penalized infeasible solutions with respect to time-window and duration(More)
This paper focuses on a generic model for service network design, which includes asset positioning and utilization through constraints on asset availability at terminals. We denote these relations as " design-balance constraints " and focus on the design-balanced capacitated multi-commodity network design model, a generalization of the capacitated(More)
Vehicle routing attributes are extra characteristics and decisions that complement the academic problem formulations and aim to properly account for real-life application needs. Hundreds of methods have been introduced in recent years for specific attributes, but the development of a single, general-purpose algorithm, which is both efficient and applicable(More)
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(More)
This paper presents a comprehensive survey of models and algorithms for multicommod-ity capacitated network design problems, which are mostly encountered in telecommunications and transportation network planning. These problems are important not only due to the major relevance of their applications, but also because they pose considerable modeling and(More)
In this paper we introduce two algorithms to solve the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with the use of several families of valid inequalities. We also propose an adaptive large-neighborhood search(More)