EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1454. Continuous approximation model for estimating average tour length in prize collecting traveling salesman problem
Invited abstract in session TD-55: Freight transportation and logistic III, stream Transportation.
Tuesday, 14:30-16:00Room: S02 (building: 101)
Authors (first author is the speaker)
1. | Daisuke Hasegawa
|
Center for Real Estate Innovation, The University of Tokyo | |
2. | Yuichiro Miyamoto
|
Sophia University | |
3. | Toshio Nemoto
|
Bunkyo University |
Abstract
The prize collecting traveling salesman problem (PCTSP) is to find routes and subset of nodes that minimize a tour distance with the constraint to be less than given rewards by visiting nodes. This study estimates the PCTSP travel distance using a continuous approximation model.
Continuous approximation model does not search for routes, but it estimates the travel distance using the area of the region and the number of nodes. In our proposed model, the size of the delivery zone and the number of nodes is given, and the spatial distribution of the penalty is represented as a demand function. It replicates the concentration of population and economic value in the center of cities.
The function makes it possible to determine the range of the penalty and the average trip distance within the zone.
In addition, we propose a method for estimating the PCTSP travel distance in multiple delivery zones. It takes into account the distance between regions and the relative balance of demand and distribution.
The method is expected to be applied to the evaluation of priority areas where delivery services such as home delivery, food delivery, and carpooling.
Keywords
- Transportation
- Logistics
- Vehicle Routing
Status: accepted
Back to the list of papers