The multi-vehicle profitable pickup and delivery problem

Gansterer, Margaretha; Kücüktepe, Murat; Hartl, Richard F.

doi:10.1007/s00291-016-0454-y

Cited by 35 publications

(14 citation statements)

References 65 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wang et al [33] also adopted the integerprogramming-model-based approach for searching the reasonable solutions for each vehicle in the distribution center network, which provides the best sequential transportation coalition and efficient model performance. Similar studies include the work of Sopot and Gribkovskaia [34], Gansterer et al [35], and Cuesta et al [36].…”

Section: Literature Reviewmentioning

confidence: 68%

An Optimization Model for Tramp Ship Scheduling considering Time Window and Seaport Operation Delay Factors

Yang

Cao

Chen

et al. 2021

Journal of Advanced Transportation

View full text Add to dashboard Cite

The quantity of electrical coal transported through the tramp shipping network is increasing due to the high demands. This trend has increased the scheduling difficulty combined with the underdevelopment of the private thermal power plant port. The high coal consumption and low port storage capacity requires the scheduling of the tramp ship to be on a strict time window to ensure the continuous operation of the thermal power plant. The low port unloading capacity often leads to the port congestion and delay of the unloading operation. This paper develops a mixed-integer-programming model for the optimization of the tramp ship scheduling to reduce the total operation cost, including the transportation cost and the unloading waiting cost, and the branch-and-price algorithm is adopted to solve this large-scale model. The model and algorithm are tested with historical operation data from the thermal power plant in the southern coastal areas of China. The optimized scheme significantly reduces the total operation cost by reducing the unloading waiting time and the number of active vessels in certain periods. The results also demonstrate the algorithm improvement in the aspects of the optimization quality and efficiency comparing with the heuristic solution.

show abstract

Section: Literature Reviewmentioning

confidence: 68%

An Optimization Model for Tramp Ship Scheduling considering Time Window and Seaport Operation Delay Factors

Yang

Cao

Chen

et al. 2021

Journal of Advanced Transportation

View full text Add to dashboard Cite

show abstract

“…Recently, the vehicle routing problem with pick-up and delivery considers the situation in which packages have to be picked-up from one of customers and delivered to another location [15,16]. During the pick-up and delivery process, visiting each pickup and delivery places occurs exactly once and total package weight during the delivery should not exceed the capacity.…”

Section: Vehicle Routing Problemmentioning

confidence: 99%

Battery-Aware Electric Truck Delivery Route Exploration

et al. 2020

View full text Add to dashboard Cite

The energy-optimal routing of Electric Vehicles (EVs) in the context of parcel delivery is more complicated than for conventional Internal Combustion Engine (ICE) vehicles, in which the total travel distance is the most critical metric. The total energy consumption of EV delivery strongly depends on the order of delivery because of transported parcel weight changing over time, which directly affects the battery efficiency. Therefore, it is not suitable to find an optimal routing solution with traditional routing algorithms such as the Traveling Salesman Problem (TSP), which use a static quantity (e.g., distance) as a metric. In this paper, we explore appropriate metrics considering the varying transported parcel total weight and achieve a solution for the least-energy delivery problem using EVs. We implement an electric truck simulator based on EV powertrain model and nonlinear battery model. We evaluate different metrics to assess their quality on small size instances for which the optimal solution can be computed exhaustively. A greedy algorithm using the empirically best metric (namely, distance × residual weight) provides significant reductions (up to 33%) with respect to a common-sense heaviest first package delivery route determined using a metric suggested by the battery properties. This algorithm also outperforms the state-of-the-art TSP heuristic algorithms, which consumes up to 12.46% more energy and 8.6 times more runtime. We also estimate how the proposed algorithms work well on real roads interconnecting cities located at different altitudes as a case study.

show abstract

“…In combinatorial auctions, requests are not traded individually but in packages . These mechanisms are of particular relevance in the pickup and delivery market, where shipments from several different customers can be transported on a single vehicle .…”

Section: Literature Reviewmentioning

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

The multi-vehicle profitable pickup and delivery problem

Cited by 35 publications

References 65 publications

An Optimization Model for Tramp Ship Scheduling considering Time Window and Seaport Operation Delay Factors

An Optimization Model for Tramp Ship Scheduling considering Time Window and Seaport Operation Delay Factors

Battery-Aware Electric Truck Delivery Route Exploration

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

Contact Info

Product

Resources

About