Mathematical models for multicontainer loading problems

Alonso, María Teresa; Álvarez-Valdés, Ramón; Iori, Manuel; Parreño, Francisco; Tamarit, José Manuel

doi:10.1016/j.omega.2016.02.002

Cited by 51 publications

(22 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One expects [6,7] that if there is too little fixed cost to divide, it will no longer be economical for shippers to join together for loading. The same setup with F = 20.5 can be used to produce a game that is not even workable.…”

Section: Discussionmentioning

confidence: 99%

“…Many papers have been written recently offering heuristics for solving one version or another of the MCV problem, with different constraints, as the problem of last mile transport grows more relevant in logistics. For instance, [6] worked on a simplified version involving putting packages on standard pallets, and pallets into trucks in specific layers. They included geometric constraints with some limitations, rather than 3D packing, and they studied the effect on solutions of overall weight, weight per axle, center of gravity of cargo and dynamic stability.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Sharing Loading Costs for Multi Compartment Vehicles

Hartman

2018

Games

View full text Add to dashboard Cite

Supply chains for goods that must be kept cool-cold chains-are of increasing importance in world trade. The goods must be kept within well-defined temperature limits to preserve their quality. One technique for reducing logistics costs is to load cold items into multiple compartment vehicles (MCVs), which have several spaces within that can be set for different temperature ranges. These vehicles allow better consolidation of loads. However, constructing the optimal load is a difficult problem, requiring heuristics for solution. In addition, the cost determined must be allocated to the different items being shipped, most often with different owners who need to pay, and this should be done in a stable manner so that firms will continue to combine loads. We outline the basic structure of the MCV loading problem, and offer the view that the optimization and cost allocation problems must be solved together. Doing so presents the opportunity to solve the problem inductively, reducing the size of the feasible set using constraints generated inductively from the inductive construction of minimal balanced collections of subsets. These limits may help the heuristics find a good result faster than optimizing first and allocating later.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Sharing Loading Costs for Multi Compartment Vehicles

Hartman

2018

Games

View full text Add to dashboard Cite

show abstract

“…This type of constraints can also be adapted to the case of truck loading in which a precise distribution of the cargo over the axles of the vehicles has to be respected (Pollaris et al (2015(Pollaris et al ( , 2016, Alonso et al (2016)).…”

Section: Figure 2: Six Possible Orientationsmentioning

confidence: 99%

A tailored two-phase constructive heuristic for the three-dimensional Multiple Bin Size Bin Packing Problem with transportation constraints

Paquay

Limbourg

Schyns

2018

European Journal of Operational Research

View full text Add to dashboard Cite

This paper considers the three-dimensional Multiple Bin Size Bin Packing Problem which consists in packing a set of cuboid boxes into containers of various shapes with minimising unused space. The problem is extended to air cargo where bins are Unit Load Devices, especially designed for tting in aircraft. We developed a fast constructive heuristic able to manage the dierent constraints met in transportation. The heuristic is split into two distinct phases. The rst phase deals with the packing of boxes into identical bins using an extension of the Extreme Points. During this phase, the fragility, stability and orientations of the boxes are taken into account as well as the special shape of the bins and their weight capacity.The second phase takes into account the multiple types of available bins. If necessary, the best found loading pattern is nally enhanced with respect to weight distribution in a post processing. After parametrisation, computational experiments have been performed on data sets especially designed for this application. The heuristic requires really short computational times to achieve promising results.

show abstract

“…Furthermore, trucks with overloaded axles represent a threat for traffic safety and may cause serious damage to the road surface. To our knowledge, Lim et al and Alonso et al are the only authors that address axle weight constraints in a container loading problem. Lim et al develop a heuristic method to tackle the single container loading problem with axle weight constraints.…”

Section: Introductionmentioning

confidence: 99%

“…Lim et al develop a heuristic method to tackle the single container loading problem with axle weight constraints. Alonso et al develop integer linear programming models to tackle multicontainer loading problems with axle weight constraints in which items are first packed on pallets and afterward, pallets are placed onto trucks.…”

Section: Introductionmentioning

confidence: 99%

Iterated local search for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints

et al. 2017

View full text Add to dashboard Cite

In this article an Iterated Local Search algorithm for the capacitated vehicle routing problem with sequencebased pallet loading and axle weight constraints is presented. Axle weight limits impose a great challenge for transportation companies. Yet, the literature on the incorporation of axle weight constraints in vehicle routing models is very scarce. The effect of introducing axle weight constraints in a CVRP on total routing cost is analyzed. Results show that integrating axle weight constraints does not lead to a large cost increase. However, not including axle weight constraints in the planning process may induce major axle weight violations.

show abstract

Mathematical models for multicontainer loading problems

Cited by 51 publications

References 34 publications

Sharing Loading Costs for Multi Compartment Vehicles

Sharing Loading Costs for Multi Compartment Vehicles

A tailored two-phase constructive heuristic for the three-dimensional Multiple Bin Size Bin Packing Problem with transportation constraints

Iterated local search for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints

Contact Info

Product

Resources

About