Routing problems with loading constraints

  • Iori M
  • Martello S
  • 81


    Mendeley users who have this article in their library.
  • 105


    Citations of this article.


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 -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.

Author-supplied keywords

  • Loading
  • Pickup and delivery
  • Three-dimensional packing
  • Traveling salesman
  • Two-dimensional packing
  • Vehicle routing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free