Routing problems with loading constraints

By Manuel Iori, Silvano Martello. 2010

233 citations recorded by the source corpus.

We consider difficult combinatorial optimization problems arising in transportation logistics when one is interested in optimizing both the routing of vehicles and the loading of goods into them. The separate problems (routing and loading) are already $\mathcal{NP}$-hard, and very difficult to solve in practice. A fortiori their combination is extremely challenging and stimulating. Although the specific literature is still quite limited, a first attempt to a systematic view of this field can be useful both to academic researchers and to practitioners. We review vehicle routing problems with two- and three-dimensional loading constraints. Other combinations of routing and special loading constraints arising from industrial applications are also considered.

Subfields: Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/eb59dba37cfd8066f426f93bd6e03a55d46999e5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

1. Rahma Lahyani
2. Mahdi Khemakhem
3. Frédéric Semet
4. Gilbert Laporte

Citations in the corpus

• Rich vehicle routing problems: From a taxonomy to a definition (2015, background): “Iori and Martello (2010) propose a recent survey on the VRP with loading constraints.”