Cost allocation on vehicle routing problem

Hiroaki Mohri, Takahiro Watanabe, Masao Mori, Mikio Kubo

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Co-operative logistics is important to solve several logistics problems, such as a shortage of tracks and drivers, inefficient loading, NO x pollution and so on. While, current evolvement of computer networks makes it possible to provide various information for common use through networks. And further development of information infrastructure is under way. Under these circumstances, co-operative logistics is socially desired in order to solve logistics problems. However, cost allocation method for co-operative logistics has not been clearly stated so far, and that becomes obstacle for implementating co-operative logistics. This is the paper which gives a solution about how to allocate the transportation costs out of logistics costs. We do not adopt the traditional solutions of co-operative game theory (i.e. Shapley values, core, nucleus, etc.). Instead, we use the expantion solution of Fishburn and Pollark on the Traveling Salesman Game. That is because the number of NP hard problems i.e. Vehicle Routing Problems for getting traditional solutions increases exponentially as the number of customers increases. Furthermore, this paper shows that participants of co-operative logistics should be able to choose their own costs allocation method based on their policies for rental costs and road costs, and also on allocation of saving costs by cooperation. We propose two axioms for cost allocation functions, and some saving functions as well. The furture themes of this problem are how to allocate logistics costs on various conditions (ex. time windows).

Original languageEnglish
Pages (from-to)463-465
Number of pages3
JournalJournal of the Operations Research Society of Japan
Volume40
Issue number4
Publication statusPublished - 1997 Dec
Externally publishedYes

Fingerprint

Cost allocation
Vehicle routing problem
Logistics
Logistics cost
Costs
Computer networks
Information infrastructure
Time windows
Pollution
Shortage
Transportation costs
Shapley value
Axioms
NP-hard
Cooperative game theory
Cost savings
Traveling salesman
Roads

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Decision Sciences(all)

Cite this

Cost allocation on vehicle routing problem. / Mohri, Hiroaki; Watanabe, Takahiro; Mori, Masao; Kubo, Mikio.

In: Journal of the Operations Research Society of Japan, Vol. 40, No. 4, 12.1997, p. 463-465.

Research output: Contribution to journalArticle

Mohri, H, Watanabe, T, Mori, M & Kubo, M 1997, 'Cost allocation on vehicle routing problem', Journal of the Operations Research Society of Japan, vol. 40, no. 4, pp. 463-465.
Mohri, Hiroaki ; Watanabe, Takahiro ; Mori, Masao ; Kubo, Mikio. / Cost allocation on vehicle routing problem. In: Journal of the Operations Research Society of Japan. 1997 ; Vol. 40, No. 4. pp. 463-465.
@article{8a2c9f7c390f42b09aa99fcb5cd4c58b,
title = "Cost allocation on vehicle routing problem",
abstract = "Co-operative logistics is important to solve several logistics problems, such as a shortage of tracks and drivers, inefficient loading, NO x pollution and so on. While, current evolvement of computer networks makes it possible to provide various information for common use through networks. And further development of information infrastructure is under way. Under these circumstances, co-operative logistics is socially desired in order to solve logistics problems. However, cost allocation method for co-operative logistics has not been clearly stated so far, and that becomes obstacle for implementating co-operative logistics. This is the paper which gives a solution about how to allocate the transportation costs out of logistics costs. We do not adopt the traditional solutions of co-operative game theory (i.e. Shapley values, core, nucleus, etc.). Instead, we use the expantion solution of Fishburn and Pollark on the Traveling Salesman Game. That is because the number of NP hard problems i.e. Vehicle Routing Problems for getting traditional solutions increases exponentially as the number of customers increases. Furthermore, this paper shows that participants of co-operative logistics should be able to choose their own costs allocation method based on their policies for rental costs and road costs, and also on allocation of saving costs by cooperation. We propose two axioms for cost allocation functions, and some saving functions as well. The furture themes of this problem are how to allocate logistics costs on various conditions (ex. time windows).",
author = "Hiroaki Mohri and Takahiro Watanabe and Masao Mori and Mikio Kubo",
year = "1997",
month = "12",
language = "English",
volume = "40",
pages = "463--465",
journal = "Journal of the Operations Research Society of Japan",
issn = "0453-4514",
publisher = "Operations Research Society of Japan",
number = "4",

}

TY - JOUR

T1 - Cost allocation on vehicle routing problem

AU - Mohri, Hiroaki

AU - Watanabe, Takahiro

AU - Mori, Masao

AU - Kubo, Mikio

PY - 1997/12

Y1 - 1997/12

N2 - Co-operative logistics is important to solve several logistics problems, such as a shortage of tracks and drivers, inefficient loading, NO x pollution and so on. While, current evolvement of computer networks makes it possible to provide various information for common use through networks. And further development of information infrastructure is under way. Under these circumstances, co-operative logistics is socially desired in order to solve logistics problems. However, cost allocation method for co-operative logistics has not been clearly stated so far, and that becomes obstacle for implementating co-operative logistics. This is the paper which gives a solution about how to allocate the transportation costs out of logistics costs. We do not adopt the traditional solutions of co-operative game theory (i.e. Shapley values, core, nucleus, etc.). Instead, we use the expantion solution of Fishburn and Pollark on the Traveling Salesman Game. That is because the number of NP hard problems i.e. Vehicle Routing Problems for getting traditional solutions increases exponentially as the number of customers increases. Furthermore, this paper shows that participants of co-operative logistics should be able to choose their own costs allocation method based on their policies for rental costs and road costs, and also on allocation of saving costs by cooperation. We propose two axioms for cost allocation functions, and some saving functions as well. The furture themes of this problem are how to allocate logistics costs on various conditions (ex. time windows).

AB - Co-operative logistics is important to solve several logistics problems, such as a shortage of tracks and drivers, inefficient loading, NO x pollution and so on. While, current evolvement of computer networks makes it possible to provide various information for common use through networks. And further development of information infrastructure is under way. Under these circumstances, co-operative logistics is socially desired in order to solve logistics problems. However, cost allocation method for co-operative logistics has not been clearly stated so far, and that becomes obstacle for implementating co-operative logistics. This is the paper which gives a solution about how to allocate the transportation costs out of logistics costs. We do not adopt the traditional solutions of co-operative game theory (i.e. Shapley values, core, nucleus, etc.). Instead, we use the expantion solution of Fishburn and Pollark on the Traveling Salesman Game. That is because the number of NP hard problems i.e. Vehicle Routing Problems for getting traditional solutions increases exponentially as the number of customers increases. Furthermore, this paper shows that participants of co-operative logistics should be able to choose their own costs allocation method based on their policies for rental costs and road costs, and also on allocation of saving costs by cooperation. We propose two axioms for cost allocation functions, and some saving functions as well. The furture themes of this problem are how to allocate logistics costs on various conditions (ex. time windows).

UR - http://www.scopus.com/inward/record.url?scp=28844483499&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=28844483499&partnerID=8YFLogxK

M3 - Article

VL - 40

SP - 463

EP - 465

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

SN - 0453-4514

IS - 4

ER -