COST ALLOCATION ON VEHICLE ROUTING PROBLEM

DOI10.15807/JORSJ.40.451MaRDI QIDQ4399700zbMATH OpenOpenAlexFDO

Authors Hiroaki Mohri, Takahiro Watanabe, Masao Mori, Mikio Kubo

Publication date 2 February 1999

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.40.451

zbMATH Keywords

co-operative logisticscost allocation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• On the nucleolus of the basic vehicle routing game
• The selective vehicle routing problem in a collaborative environment
• Cooperative game theory approach to allocating benefits of horizontal cooperation
• Stable cooperation in the dynamic vehicle routing problem

Cited in

(12)

• A savings-based model for two-shipper cooperative routing
• An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution
• On the nucleolus of the basic vehicle routing game
• Distance constrained vehicle routing problem to minimize the total cost
• Cooperative game theory approach to allocating benefits of horizontal cooperation
• A review on cost allocation methods in collaborative transportation
• Multi-period cooperative vehicle routing games
• Stable cooperation in the dynamic vehicle routing problem
• Competition and cooperation in pickup and multiple delivery problems
• The selective vehicle routing problem in a collaborative environment
• A competitive solution for cooperative truckload delivery
• Cost allocation for less-than-truckload collaboration among perishable product retailers

This page was built for publication: COST ALLOCATION ON VEHICLE ROUTING PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4399700)