On a periodic vehicle routing problem
| Autor: | A. Arnout, Sofie Coene, Frits C. R. Spieksma |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Marketing
021103 operations research Operations research Computer science Strategy and Management Reliability (computer networking) 0211 other engineering and technologies Time horizon 02 engineering and technology Management Science and Operations Research Management Information Systems Scheduling (computing) Set (abstract data type) Vehicle routing problem 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Routing (electronic design automation) Integer programming |
| Zdroj: | Journal of the Operational Research Society. 61:1719-1728 |
| ISSN: | 1476-9360 0160-5682 |
| DOI: | 10.1057/jors.2009.154 |
| Popis: | This paper deals with a study on a variant of the Periodic Vehicle Routing Problem (PVRP). As in the traditional Vehicle Routing Problem, customer locations each with a certain daily demand are given, as well as a set of capacitated vehicles. In addition, the PVRP has a horizon, say T days, and there is a frequency for each customer stating how often within this T-day period this customer must be visited. A solution to the PVRP consists of T sets of routes that jointly satisfy the demand constraints and the frequency constraints. The objective is to minimize the sum of the costs of all routes over the planning horizon. We develop different algorithms solving the instances of the case studied. Using these algorithms we are able to realize considerable cost reductions compared to the current situation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink