A branch-and-price algorithm for the risk-equity constrained routing problem

Authors:
Nora Touati-Moungla;Pietro Belotti;Vincent Jost;Leo Liberti
Affiliations:
École Polytechnique, Laboratoire d'Informatique, Palaiseau Cedex, France;Department of Mathematical Sciences of Clemson University;École Polytechnique, Laboratoire d'Informatique, Palaiseau Cedex, France;École Polytechnique, Laboratoire d'Informatique, Palaiseau Cedex, France
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 4
Cited 0

The equity constrained shortest path problem

Computers and Operations Research
Modeling equity of risk in the transportation of hazardous materials

Operations Research
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software—Practice & Experience - Special issue on discrete algorithm engineering
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.