English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this article, a new vehicle routing problem appeared in carrier collaboration via a combinatorial auction (CA) is studied. A carrier with reserved requests wants to determine within a time horizon of multi periods (days) which requests to serve among a set of selective requests open for bid of the auction to maximize its profit. In each period, the carrier has a set of reserved requests that must be served by the carrier itself. Each request is specified by a pair of pickup and delivery locations, a quantity, and two time windows for pickup and delivery respectively. The objective of the carrier is to determine which selective requests may be served in each period in addition of its reserved requests and determine optimal routes to serve the reserved and selective requests to maximize its total profit. For this NP-hard problem, a mixed-integer linear programming model is formulated and a genetic algorithm combined with simulated annealing is proposed. The algorithm is evaluated on instances with 6 to 100 requests. The computational results show this algorithm significantly outperform CPLEX solver, not only in computation time but also in solution quality.

A Hybrid Genetic and Simulation Annealing Approach for a Multi-period Bid Generation Problem in Carrier Collaboration