EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
516. A Pick-Up and Delivery Vehicle Routing Problem With Stochastic Demands and Unordered Customers
Invited abstract in session TA-64: Vehicle Routing Under Uncertainty 2, stream VeRoLog - Vehicle Routing and Logistics.
Tuesday, 8:30-10:00Room: S16 (building: 101)
Authors (first author is the speaker)
| 1. | Epaminondas Kyriakidis
|
| Statistics, Athens University of Economics and Business | |
| 2. | Theodosis Dimitrakos
|
| Mathematics, University of the Aegean | |
| 3. | ANDREAS PAPASALOUROS
|
| MATHEMATICS, UNIVERSITY OF THE AEGEAN |
Abstract
A vehicle starts its route from a depot and visits N unordered customers. New goods are delivered to the customers and expired goods are collected from them. The demands of the customers are stochastic with known distributions. The actual demands are revealed when the vehicle arrives at each customer’s site. During its route, the vehicle may return to the depot in order to unload expired goods and to restock with new goods. The cost structure includes travel costs between customers and travel costs between each customer and the depot. After the first visit at each customer’s site two decisions must be made. The first decision is to choose the next customer that the vehicle will visit. The second decision is to choose how the vehicle will go to the next customer. The problem is to find (i) the minimum total expected cost for servicing all customers and (ii) the optimal decisions that must be made after the first visit at each customer’s site. A suitable stochastic dynamic programming algorithm is developed for the solution of the above problem.
Keywords
- Programming, Dynamic
- Logistics
Status: accepted
Back to the list of papers