Determining the best shipper sizes for sending products to customers

DOI10.1111/ITOR.12128zbMATH Open1338.90330OpenAlexW2026353784MaRDI QIDQ2803267FDOQ2803267

Authors: M. T. Alonso, Ramón Alvarez-Valdes, José Manuel Tamarit, Francisco Parreño 

Publication date: 4 May 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12128

Recommendations

• Ship-pack optimization in a two-echelon distribution system
• Planning and consolidating shipments from a warehouse
• scientific article; zbMATH DE number 711782
• The multiple container loading cost minimization problem
• The freight consolidation and containerization problem

zbMATH Keywords

heuristicsinteger programmingcutting patternsassortment problemvariable bin-size packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)

Cites Work

• An improved typology of cutting and packing problems
• Solution methods for thep-median problem: An annotated bibliography
• Neighborhood structures for the container loading problem: a VNS implementation
• The two-dimensional bin packing problem with variable bin sizes and costs
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
• Discretized formulations for capacitated location problems with modular distribution costs
• A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
• A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
• A comparison of solution methods for the assortment problem
• A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
• An algorithm for the two-dimensional assortment problem
• Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
• Approximation solutions for the cutting stock `portfolio' problem
• An optimization model for trim loss minimization in an automotive glass plant
• Solution to the assortment problem via the genetic algorithm
• Exact and asymptotically exact solutions for a class of assortment problems

Cited In (2)

• Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
• Cutting and packing problems under uncertainty: literature review and classification framework

This page was built for publication: Determining the best shipper sizes for sending products to customers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803267)