Name
Abstract | ||
|---|---|---|
We study a dynamic multiperiod routing problem where, at the beginning of each time period, a set of orders arrive that have to be fulfilled either that time period or the next. Thus, in each time period there are customers that have to be served and customers whose service may be postponed. Once it has been decided which customers to serve, an optimal route is constructed and executed. The objective of the problem is to minimize the total distance traveled during the planning horizon. Deciding which customers to serve in a time period is done on the basis of incomplete information, analyzing simultaneously customers in two consecutive periods. No knowledge is available about customers requiring service in future time periods. We introduce simple algorithms, ones which naturally arise in practice, and analyze these algorithms by studying their competitive ratio. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 49(4), 308–317 2007 |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1002/net.v49:4 | Networks |
Keywords | Field | DocType |
consecutive period,optimal route,competitive ratio,wiley periodicals,incomplete information,inc. networks,time period,future time period,competitive analysis,planning horizon,dynamic multiperiod | Dynamic programming,Ordered set,Mathematical optimization,Vehicle routing problem,Time horizon,Operations research,SIMPLE algorithm,Complete information,Mathematics,Service time,Competitive analysis | Journal |
Volume | Issue | ISSN |
49 | 4 | 0028-3045 |
Citations | PageRank | References |
20 | 0.98 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Enrico Angelelli | 1 | 291 | 20.58 |
| M. Grazia Speranza | 2 | 663 | 45.44 |
| Martin Savelsbergh | 3 | 2624 | 190.83 |