EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2676. Capacitated Network Design for Multicommodity Flow problems with Sparse Commodities
Invited abstract in session WB-57: Scheduling and sustainability, stream Optimization at Amazon.
Wednesday, 10:30-12:00Room: S06 (building: 101)
Authors (first author is the speaker)
| 1. | Allan Sapucaia
|
| Amazon | |
| 2. | Nikos Liakopoulos
|
| ATS, Amazon |
Abstract
Finding a timely and minimum cost truck schedule to transport packages closer to the customer through the Amazon Middle Mile Network is a big challenge. We breakdown it down into steps, where here we will focus in the combinatorial problem of deciding the equipment (truck and trailer) type, their departure time and the commodity demand mix carried, while the fulfilment paths and commodity demand are predetermined. We model the middle mile network as a time expanded graph, where nodes describe facilities, as well as their inbound and outbound, and arcs are either fixed and capacitated according to the availability of a shared resource, or schedulable connecting different facilities, with different options of trailer capacities and costs. Since a commodity will flow through a predetermined sequence of sites, each commodity traverses a very limited fraction of the network. We call this problem variation Capacitate Fixed-Charge Network Design for Multicommodity Flow Problem with fixed arcs and sparse commodities. We present a scalable integer linear-programming based matheuristic for the problem and show how many existing results from the broad network design literature can be adapted to the problem we are solving.
Keywords
- Large Scale Optimization
- Combinatorial Optimization
- Transportation
Status: accepted
Back to the list of papers