GODINHO, Maria Teresa; GOUVEIA, Luís; PESNEAU, Pierre

Metadatos

Licencia de uso del documento

GODINHO, Maria Teresa
Departemento de Matematica [Beja]

GOUVEIA, Luís
Centro de Investigação Operacional [CIO]

PESNEAU, Pierre
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

Idioma

Chapitre d'ouvrage

Este ítem está publicado en

Progress in Combinatorial Optimization, Progress in Combinatorial Optimization. 2011-10-01

Wiley

Resumen en inglés

In this chapter we contextualize, in terms of the ATSP, a recent compact formulation presented in Godinho et al [11] for the time-dependent traveling salesman problem (TDTSP). The previous paper provides one way of viewing the new model, the time-dependent TSP point of view where it is put in evidence how to obtain the new model by tightening the linear programming relaxation of a well known formulation for the TDTSP. In this chapter, we will present the ATSP point of view and will show how to obtain the model by i) enhancing the subproblem arising in the standard multicommodity ow (MCF) model for the ATSP and then ii) by using modelling enhancement techniques. We will compare the linear programming relaxation of the new formulation with the linear programming relaxation of the three compact and non-dominated formulations presented in Oncan et al. [19]. As a result of this comparison we present an updated classication of formulations for the asymmetric traveling salesman problem (ATSP).< Leer menos

Metadatos

Compartir este ítem

Licencia de uso del documento

On a Time-Dependent Formulation and an Updated Classification of ATSP Formulations

Idioma

Este ítem está publicado en

Resumen en inglés

URI

Orígen

Centros de investigación