A distribution centre in the logistic chain acts as an interface between suppliers and retailers. Goods entering the centre by inbound trucks are unloaded, consolidated with respect to the retailer's orders, and then loaded into the outbound trucks, ready to be distributed. We consider the problem of scheduling unloading and loading operations of full-load trucks at a cross-docking distribution centre, where goods either are directly transshipped, or eventually warehoused for a very short time [1], [2]. Here we model the problem as a mixed integer linear program and propose a Lagrangian Relaxation approach. We show that the relaxed problem decomposes in two combinatorial subproblems. We study the mathematical properties of the relaxed problem from which we derive an attractive Lagrangian heuristic algorithm. Finally we present and discuss some numerical results.

A new solution approach to the truck scheduling problem in distribution centres

Monaco Maria Flavia;Gaudioso Manlio;Sammarra Marcello
2018-01-01

Abstract

A distribution centre in the logistic chain acts as an interface between suppliers and retailers. Goods entering the centre by inbound trucks are unloaded, consolidated with respect to the retailer's orders, and then loaded into the outbound trucks, ready to be distributed. We consider the problem of scheduling unloading and loading operations of full-load trucks at a cross-docking distribution centre, where goods either are directly transshipped, or eventually warehoused for a very short time [1], [2]. Here we model the problem as a mixed integer linear program and propose a Lagrangian Relaxation approach. We show that the relaxed problem decomposes in two combinatorial subproblems. We study the mathematical properties of the relaxed problem from which we derive an attractive Lagrangian heuristic algorithm. Finally we present and discuss some numerical results.
scheduling, Lagrangian relaxation, heuristics
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/288861
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact