TY - GEN
T1 - A branch-and-price algorithm for the risk-equity constrained routing problem
AU - Touati-Moungla, Nora
AU - Belotti, Pietro
AU - Jost, Vincent
AU - Liberti, Leo
PY - 2011/1/1
Y1 - 2011/1/1
N2 - We study a multi-criteria variant of the problem of routing hazardous material on a geographical area subdivided in regions. The two objective functions are given by a generally defined routing cost and a risk equity equal to the maximum, over each region, of the risk perceived within a region. This is a multicommodity flow problem where integer variables are used to define the number of trucks used for the routing. This problem admits a straightforward path formulation, for which a branch-and-price problem where, for each node of the branch-and-bound tree, column generation is used to obtain a lower bound.
AB - We study a multi-criteria variant of the problem of routing hazardous material on a geographical area subdivided in regions. The two objective functions are given by a generally defined routing cost and a risk equity equal to the maximum, over each region, of the risk perceived within a region. This is a multicommodity flow problem where integer variables are used to define the number of trucks used for the routing. This problem admits a straightforward path formulation, for which a branch-and-price problem where, for each node of the branch-and-bound tree, column generation is used to obtain a lower bound.
U2 - 10.1007/978-3-642-21527-8_49
DO - 10.1007/978-3-642-21527-8_49
M3 - Conference contribution
AN - SCOPUS:80053010933
SN - 9783642215261
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 439
EP - 449
BT - Network Optimization - 5th International Conference, INOC 2011, Proceedings
PB - Springer Verlag
ER -