Teodor Gabriel Crainic

Learn 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)
The attributes of Vehicle Routing Problems are additional characteristics or constraints that aim to better take into account the specificities of real applications. The variants thus formed are supported by a well-developed literature, including a large variety of heuristics. This article first reviews the main classes of attributes, providing a survey of(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)
Vehicle Routing Problem (VRP) formulations are used to model an extremely broad range of situations in many application fields, such as transportation, supply chain management, and production planning. As a result, since the first paper on the topic by Dantzig and Ramser in 1959, routing problems have made up an extensively studied field. However, some(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 propose a path relinking procedure for the fixed-charge capacitated mul-ticommodity network design problem. Cycle-based neighbourhoods are used both to move along path between elite solutions and to generate the elite candidate set by a tabu-like local search procedure. Several variants of the method are implemented and compared. Extensive(More)