An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution
From MaRDI portal
Publication:1652425
DOI10.1016/J.COR.2017.02.015zbMATH Open1391.90105OpenAlexW2591154916MaRDI QIDQ1652425FDOQ1652425
Xiaohang Yue, Jiafu Tang, Qi Lou, Yang Yu, Jun-Wei Wang
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.02.015
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Simple Expression for the Shapley Value in a Special Case
- The traveling salesman game: An application of cost allocation in a gas and oil company
- Sharing costs in highways: a game theoretic approach
- Cost allocation in collaborative forest transportation
- Horizontal cooperation among freight carriers: request allocation and profit sharing
- Cooperative game theory approach to allocating benefits of horizontal cooperation
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- Load-dependent and precedence-based models for pickup and delivery problems
- Exact algorithms for the double vehicle routing problem with multiple stacks
- Shipper collaboration
- Supplier-initiated outsourcing: a methodology to exploit synergy in transportation
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- A decomposition method for approximate evaluation of continuous flow multi-stage lines with general Markovian machines
- Mathematical models for green vehicle routing problems with pickup and delivery: a case of semiconductor supply chain
Cited In (5)
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games
- Title not available (Why is that?)
- A heuristic procedure for computing the nucleolus
- Exact method based on solution space cut for bi-objective Seru production
- Interval-valued n-person Cooperative games with satisfactory degree constraints
This page was built for publication: An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652425)