Finding the nucleolus of the vehicle routing game with time windows
SCIE
SCOPUS
- Title
- Finding the nucleolus of the vehicle routing game with time windows
- Authors
- Tae, Hyunchul; Kim, Byung-In; Park, Junhyuk
- Date Issued
- 2020-04
- Publisher
- ELSEVIER SCIENCE INC
- Abstract
- Computing the nucleolus is recognized as an equitable solution to cooperative n person cost games, such as a vehicle routing game (VRG). Computing the nucleolus of a VRG, however, has been limited to small-sized benchmark instances with no more than 25 players, because of the computation time required to solve the NP-hard separation problem. To reduce computation time, we develop an enumerative algorithm that computes the nucleolus of the VRG with time windows (VRGTW) in the case of the non-empty core. Numerical simulations demonstrate the ability of the proposed algorithm to compute the nucleolus of benchmark instances with up to 100 players. (C) 2019 Published by Elsevier Inc.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/107912
- DOI
- 10.1016/j.apm.2019.11.026
- ISSN
- 0307-904X
- Article Type
- Article
- Citation
- APPLIED MATHEMATICAL MODELLING, vol. 80, page. 334 - 344, 2020-04
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.