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

Cold supply chain distribution systems ensure the freshness of temperature-sensitive products during transportation. In this study, we investigated a fresh food company’s cold supply chain distribution. Making fresh food available and achieving quality and safety, requires proper planning of vehicle routing, we addressed a routing problem that simultaneously considers time windows, multiple trips per vehicle, a heterogeneous fleet, parking constraints, unloading time at customer position, and limited duration, minimizing related operational costs. We formulate this problem as a mixed-integer programming model. Since this problem is NP-hard, we also propose a genetic algorithm with two adaptive-parameter mechanisms to solve it within a reasonable computational time. Extensive experiments were conducted to assess the performance of different approaches in a real-world application. The results demonstrate that the algorithms are robust and efficient. The proposed algorithms can reduce operational costs by more than 20% compared to the current practical planning approach.

transportation planning and technology

A multi-trip vehicle routing problem considering time windows and limited duration under a heterogeneous fleet and parking constraints in cold supply chain logistics