An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers
This research incorporated an auction mechanism into the vehicle routing problem with occasional drivers and produced simulations in an agent-based environment. Auctions were used to match online orders with potential occasional drivers. While a centralized system optimizes system performance under...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2022/2999162 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850161992449392640 |
|---|---|
| author | Chung-Wei Shen Che-Cheng Hsu Kuan-Hua Tseng |
| author_facet | Chung-Wei Shen Che-Cheng Hsu Kuan-Hua Tseng |
| author_sort | Chung-Wei Shen |
| collection | DOAJ |
| description | This research incorporated an auction mechanism into the vehicle routing problem with occasional drivers and produced simulations in an agent-based environment. Auctions were used to match online orders with potential occasional drivers. While a centralized system optimizes system performance under global objectives, the novel decentralized approach presented here illustrates emergent phenomena resulting from the interaction of individual entities in highly dynamic cases. In the simulations, the auctions were executed after a fixed time interval called a rolling time horizon. Our results suggest that the appropriate rolling time horizon produces a lower average unit compensation cost because better matches can be found when the accumulation of online orders and occasional drivers is maintained at a certain level. The simulation results also indicate that the use of an auction mechanism instead of simple nonauction rules can improve the average unit compensation cost by up to 25.1%. |
| format | Article |
| id | doaj-art-fccf1676a74741899d6e46bb2cf16d9e |
| institution | OA Journals |
| issn | 2042-3195 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-fccf1676a74741899d6e46bb2cf16d9e2025-08-20T02:22:40ZengWileyJournal of Advanced Transportation2042-31952022-01-01202210.1155/2022/2999162An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional DriversChung-Wei Shen0Che-Cheng Hsu1Kuan-Hua Tseng2Department of Transportation and Communication Management ScienceDepartment of Transportation and Communication Management ScienceDepartment of Transportation and Communication Management ScienceThis research incorporated an auction mechanism into the vehicle routing problem with occasional drivers and produced simulations in an agent-based environment. Auctions were used to match online orders with potential occasional drivers. While a centralized system optimizes system performance under global objectives, the novel decentralized approach presented here illustrates emergent phenomena resulting from the interaction of individual entities in highly dynamic cases. In the simulations, the auctions were executed after a fixed time interval called a rolling time horizon. Our results suggest that the appropriate rolling time horizon produces a lower average unit compensation cost because better matches can be found when the accumulation of online orders and occasional drivers is maintained at a certain level. The simulation results also indicate that the use of an auction mechanism instead of simple nonauction rules can improve the average unit compensation cost by up to 25.1%.http://dx.doi.org/10.1155/2022/2999162 |
| spellingShingle | Chung-Wei Shen Che-Cheng Hsu Kuan-Hua Tseng An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers Journal of Advanced Transportation |
| title | An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers |
| title_full | An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers |
| title_fullStr | An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers |
| title_full_unstemmed | An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers |
| title_short | An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers |
| title_sort | auction based multiagent simulation for the matching problem in dynamic vehicle routing problem with occasional drivers |
| url | http://dx.doi.org/10.1155/2022/2999162 |
| work_keys_str_mv | AT chungweishen anauctionbasedmultiagentsimulationforthematchingproblemindynamicvehicleroutingproblemwithoccasionaldrivers AT chechenghsu anauctionbasedmultiagentsimulationforthematchingproblemindynamicvehicleroutingproblemwithoccasionaldrivers AT kuanhuatseng anauctionbasedmultiagentsimulationforthematchingproblemindynamicvehicleroutingproblemwithoccasionaldrivers AT chungweishen auctionbasedmultiagentsimulationforthematchingproblemindynamicvehicleroutingproblemwithoccasionaldrivers AT chechenghsu auctionbasedmultiagentsimulationforthematchingproblemindynamicvehicleroutingproblemwithoccasionaldrivers AT kuanhuatseng auctionbasedmultiagentsimulationforthematchingproblemindynamicvehicleroutingproblemwithoccasionaldrivers |