A matheuristic for the packaging and shipping problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

A matheuristic for the packaging and shipping problem

Abstract

E-commerce has become nowadays a common practice and worldwide sales are forecast to hit $ 1.5 trillion by the end of 2014. Companies operating in this sector need to propose efficient services for attractive prices. This can be obtained by an efficient organization and management of the customer demand, from the moment it is ordered to when it is delivered at the customer’s place. We consider a packaging and shipping problem that occur in a warehouse. The objective is to optimize the process to prepare the customer demands over a horizon of days. The problem looks for an operational plan that minimizes the cost of hiring the workers (fixed and temporary) and the cost of re-affecting or postponing deliveries and the number of used vehicles. In addition, considering that the number of docks is usually a critical resource, we look for a plan that minimizes their usage (called trucks management policy).
Fichier principal
Vignette du fichier
cattaruzza_respet_ROADEF2015.pdf (231.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01260049 , version 1 (21-01-2016)

Identifiers

  • HAL Id : hal-01260049 , version 1

Cite

Diego Cattaruzza, Bayrem Tounsi, Luce Brotcorne, Frédéric Semet. A matheuristic for the packaging and shipping problem. Roadef 2015, Feb 2015, Marseille, France. ⟨hal-01260049⟩
157 View
56 Download

Share

Gmail Facebook Twitter LinkedIn More