MOURGAYA, M.; VANDERBECK, François

doi:10.1016/j.ejor.2006.02.030

Metadatos

Licencia de uso del documento

MOURGAYA, M.
Institut de Mathématiques de Bordeaux [IMB]

VANDERBECK, François
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

Idioma

Article de revue

Este ítem está publicado en

European Journal of Operational Research. 2007, vol. 183, n° 3, p. 1028-1041

Elsevier

Resumen en inglés

The periodic vehicle routing problem (PVRP) consists in establishing a planning of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. The tactical planning model considered here restricts its attention to scheduling visits and assigning them to vehicles while leaving sequencing decisions for an underlying operational model. The objective is twofold: to optimize regional compactness of the routes in a desire to specialize routes to restricted geographical area and to balance the workload evenly between vehicles. Approximate solutions are constructed using a truncated column generation procedure followed by a rounding heuristic. This mathematical programming based procedure can deal with problems with 50–80 customers over five working days which is the range of size of most PVRP instances treated in the literature with meta-heuristics. The paper highlights the importance of alternative optimization criteria not accounted for in standard operational models and provides insights on the implementation of a column generation based rounding heuristic.< Leer menos

Metadatos

Compartir este ítem

Licencia de uso del documento

Column generation based heuristic for tactical planning in multi-period vehicle routing

Idioma

Este ítem está publicado en

Resumen en inglés

URI

DOI

Orígen

Centros de investigación