A new solution approach to the truck scheduling problem in distribution centres
| Autor: | M. Flavia Monaco M. Gaudioso M. Sammarra |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization, Bologna, 25-27/06/2018 info:cnr-pdr/source/autori:M. Flavia Monaco M. Gaudioso M. Sammarra/congresso_nome:Joint EURO%2FALIO International Conference 2018 on Applied Combinatorial Optimization/congresso_luogo:Bologna/congresso_data:25-27%2F06%2F2018/anno:2018/pagina_da:/pagina_a:/intervallo_pagine |
| Popis: | 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 . 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|