Collaborative vehicle routing: A survey

Gansterer, Margaretha; Hartl, Richard F.

doi:10.1016/j.ejor.2017.10.023

Cited by 242 publications

(140 citation statements)

References 85 publications

Supporting

Mentioning

137

Contrasting

Unclassified

Order By: Relevance

“…The constraints (5) ensure that every subtour includes the depot and does not violate the vehicle capacity constraints, and hence represents a feasible route. Constraints (6), (7), (8) and (9) specify the domains of the decision variables.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Shared Capacity Routing Problem − An omni-channel retail study

Paul

Agatz

Spliet

et al. 2019

European Journal of Operational Research

View full text Add to dashboard Cite

More and more retailers allow customers to order goods online and then pick them up in a store. In this setting, these orders are typically served from a dedicated warehouse.This often means that the stores are visited by different vehicles to replenish the store inventory and to supply the pick-up points. Motivated by a collaboration with an omnichannel grocery retailer in the Netherlands, we study how to best share capacity between the routes associated with these different sales channels. As operational constraints prevent jointly planning the routes, we consider the replenishment routes as fixed when planning the routes to serve the pick-up orders. An order can be transferred to the replenishment route, if capacity allows. We consider the problem of deciding which customer orders to transfer and which to deliver directly such that the total costs are minimized. We present an exact and heuristic approach to solve this problem. Computational experiments on both real-world and artificial instances show that substantial savings can be achieved by sharing vehicle capacity across different channels.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Research in the collaboration of carriers mostly focusses on the selection of appropriate collaboration partners and mechanisms for exchanging requests among partners [8]. Cooperative game theory and combinatorial auctions are used for profit sharing in horizontal collaboration among logistic partners [15] [14].…”

Section: Related Literaturementioning

confidence: 99%

Shared Capacity Routing Problem − An omni-channel retail study

Paul

Agatz

Spliet

et al. 2019

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Nearly, intelligent cars can be driven on the road without any human assistance, and this is very safe for the driver and for the pedestrians. 48 Keeping these valuable outputs, in relation to the smart city and vehicle relationship and V2V relationship, the proposed approach extends this connection in order to optimize the consumed power inside the vehicle on the road.…”

Section: Buildings Infrastructures and Electric Vehicle Relationshipmentioning

confidence: 99%

“…In addition, V2V connection is possible in these new car versions. Nearly, intelligent cars can be driven on the road without any human assistance, and this is very safe for the driver and for the pedestrians …”

Section: Introductionmentioning

confidence: 99%

Design and analysis of a novel power management approach, applied on a connected vehicle as V2V, V2B/I, and V2N

Aymen

Mahmoudi

2019

Int J Energy Res

View full text Add to dashboard Cite

Summary The communication technologies were evolving rapidly and making everything connected. Peoples, vehicles, and buildings become connected everywhere. Concentrating on the targets that vehicle can be connected with, the present paper exposes a new power management approach applicable for three kinds of connected vehicles. Vehicle to buildings or infrastructure, vehicle to network, and vehicle to vehicle are the three communication protocols between vehicle and external targets. The proposed approach is designed for implementing all of these three communication cases. It is based on the principle of vehicle data sharing. Each vehicle will share a package of data, which contain information related to the vehicle status and the road condition. This information will be collected in a database and used for managing the power inside these cars. This approach is built on two stages; the first one is related to vehicles' classification, and the second one is attached to the recommendation, and this is according to the car position and according to the communication protocol case. The first stage was resolved using the support vector classification method. The second stage was treated using the artificial intelligence principle, and the neural network was employed. So the optimal decision will be outputted. According to the vehicle communication method, the optimal decision will be identified inside the building, infrastructure, vehicle, or the cloud database. This will be related to the vehicle position using the old vehicle's data. So the obtained decission will be transferred to the coming vehicle, for optimizing its energy consumption method in the corresponding area. Different possibilities and situations were discussed in this approach. The power management methodology was verified and confirmed. For showing the efficiency of this approach, a comparison of the obtained results in relation to the battery state of charge and the consumed energy results will be done. Matlab simulink was used for doing the necessary tests.

show abstract

“…In horizontal logistics collaboration, several companies pool their transportation requests in order to execute them more efficiently . The results of these initiatives are impressive: double‐digit efficiency improvements of up to 30% have been reported . Figure shows an example of noncollaborative and of collaborative vehicle routes of LTL carriers.…”

Section: Introductionmentioning

confidence: 99%

The cost of incentive compatibility in auction‐based mechanisms for carrier collaboration

2018

Self Cite

View full text Add to dashboard Cite

Collaboration has been one of the important trends in vehicle routing. A typical mechanism to enable carrier collaboration is to use combinatorial auctions, where requests are not traded individually but are combined into bundles. Previous literature on carrier collaboration has focused on issues such as bundle formation or winner determination, typically assuming truthfulness of all agents and absence of any strategic behavior. This article considers the interdependencies and problems that arise from bidders acting as buyers and sellers of requests at the same time. From standard auction theory, desirable properties of exchange mechanisms are identified as efficiency, incentive compatibility, individual rationality, and budget balance. It is shown that these desirable properties cannot be fulfilled at the same time. In particular, the properties efficiency and incentive compatibility induce that budget balance is violated, that is, an outside subsidy is required. We propose two incentive compatible exchange mechanisms. One is more closely related to the classical VCG approach, while the other one uses a more complicated concept for computing payments to participants. A numerical study investigates how frequently desired properties are violated. We show that both mechanisms can be acceptable in practical situations, but none of them can satisfy all desired properties.

show abstract

Collaborative vehicle routing: A survey

Cited by 242 publications

References 85 publications

Shared Capacity Routing Problem − An omni-channel retail study

Shared Capacity Routing Problem − An omni-channel retail study

Design and analysis of a novel power management approach, applied on a connected vehicle as V2V, V2B/I, and V2N

The cost of incentive compatibility in auction‐based mechanisms for carrier collaboration

Contact Info

Product

Resources

About