File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A cash transportation vehicle routing problem with combinations of different cash denominations

TitleA cash transportation vehicle routing problem with combinations of different cash denominations
Authors
KeywordsCash denominations
Cash transportation
Combined hybrid tabu search
Risk management
Vehicle routing problem
Issue Date2019
PublisherWiley-Blackwell Publishing Ltd. The Journal's web site is located at http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1475-3995
Citation
International Transactions in Operational Research, 2019, v. 26 n. 6, p. 2179-2198 How to Cite?
AbstractThis paper investigates a new cash transportation problem, which is a variant of the capacitated vehicle routing problem. To better satisfy the demands of customers (e.g., banks, large retailers, shopping centers, automated teller machines, etc.), the combination of different cash denominations (i.e., $100, $50, $20, etc.) is considered. The robbery risk, which is measured by both the amount of cash being carried and the distance covered by the vehicle carrying the cash, is limited by a risk threshold. The problem is formulated as mixed‐integer linear programming to minimize the total cost, which consists of the total travel cost and the total penalties due to the unmet expected demand of customers. A combined hybrid tabu search metaheuristic is proposed to solve this problem. Tabu search is adopted for determining routing decisions while three methods, namely the exact method, the greedy method, and the mixed method, are proposed to be embedded within the tabu search to determine the denomination combination strategy. The numerical studies show that the proposed method makes a good tradeoff between the solution quality and the computation time. Experimental results also reveal the effects of the unit penalty and the risk threshold.
Persistent Identifierhttp://hdl.handle.net/10722/276314
ISSN
2017 Impact Factor: 2.4
2015 SCImago Journal Rankings: 1.179
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorXu, G-
dc.contributor.authorLi, Y-
dc.contributor.authorSzeto, WY-
dc.contributor.authorLi, J-
dc.date.accessioned2019-09-10T03:00:31Z-
dc.date.available2019-09-10T03:00:31Z-
dc.date.issued2019-
dc.identifier.citationInternational Transactions in Operational Research, 2019, v. 26 n. 6, p. 2179-2198-
dc.identifier.issn0969-6016-
dc.identifier.urihttp://hdl.handle.net/10722/276314-
dc.description.abstractThis paper investigates a new cash transportation problem, which is a variant of the capacitated vehicle routing problem. To better satisfy the demands of customers (e.g., banks, large retailers, shopping centers, automated teller machines, etc.), the combination of different cash denominations (i.e., $100, $50, $20, etc.) is considered. The robbery risk, which is measured by both the amount of cash being carried and the distance covered by the vehicle carrying the cash, is limited by a risk threshold. The problem is formulated as mixed‐integer linear programming to minimize the total cost, which consists of the total travel cost and the total penalties due to the unmet expected demand of customers. A combined hybrid tabu search metaheuristic is proposed to solve this problem. Tabu search is adopted for determining routing decisions while three methods, namely the exact method, the greedy method, and the mixed method, are proposed to be embedded within the tabu search to determine the denomination combination strategy. The numerical studies show that the proposed method makes a good tradeoff between the solution quality and the computation time. Experimental results also reveal the effects of the unit penalty and the risk threshold.-
dc.languageeng-
dc.publisherWiley-Blackwell Publishing Ltd. The Journal's web site is located at http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1475-3995-
dc.relation.ispartofInternational Transactions in Operational Research-
dc.subjectCash denominations-
dc.subjectCash transportation-
dc.subjectCombined hybrid tabu search-
dc.subjectRisk management-
dc.subjectVehicle routing problem-
dc.titleA cash transportation vehicle routing problem with combinations of different cash denominations-
dc.typeArticle-
dc.identifier.emailSzeto, WY: ceszeto@hku.hk-
dc.identifier.authoritySzeto, WY=rp01377-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1111/itor.12640-
dc.identifier.scopuseid_2-s2.0-85061614913-
dc.identifier.hkuros303139-
dc.identifier.volume26-
dc.identifier.issue6-
dc.identifier.spage2179-
dc.identifier.epage2198-
dc.identifier.isiWOS:000471708400005-
dc.publisher.placeUnited Kingdom-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats