2010
DOI: 10.1007/s11750-010-0144-x
|View full text |Cite
|
Sign up to set email alerts
|

Routing problems with loading constraints

Abstract: 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 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 res… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
107
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 189 publications
(107 citation statements)
references
References 80 publications
0
107
0
Order By: Relevance
“…Also, they used two heuristic methods to check the loading constraints. More information on VRP with two-dimensional loading constraints can be found in Iori and Martello (2010) and Iori and Martello (2013).…”
Section: Review Of the Literaturementioning
confidence: 99%
“…Also, they used two heuristic methods to check the loading constraints. More information on VRP with two-dimensional loading constraints can be found in Iori and Martello (2010) and Iori and Martello (2013).…”
Section: Review Of the Literaturementioning
confidence: 99%
“… VRPs with loading constraints, reviewed in (Iori and Martello, 2010): loading constraints that have been analysed include two and three-dimensional loading constraints, as well as some special variants such as multi-pile loading, taking into account order of loading, etc. ; again, the water tank delivery problem has special characteristics that have not been studied anywhere else, to our knowledge, such as the possibility of bundling and the necessity of visiting special intermediate locations where unbundling can take place;…”
Section: Vehicle Routing Problemsmentioning
confidence: 99%
“…In 3L-CVRP, every customer requires transporting one or a few parallelepipeds (or boxes) where each one is represented by a 3D rectangular loading space and its weight (in contrast to the traditional CVRP, where an only weight is given). Surveys [5] and [6] show a recent state of the art for solving the integrated vehicle routing and loading problems.…”
Section: Introductionmentioning
confidence: 99%