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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The main objective of this paper is to propose a two-phase solution algorithm for solving the Inventory Routing Problem with Time Windows (IRPTW), which has not been excessively researched in the literature. The solution approach is based on (a) a simple simulation for the planning phase (Phase I) and (b) the Variable Neighborhood Search Algorithm (VNS) for the routing phase (Phase II). Testing instances are established to investigate algorithmic performance, and the computational results are then reported. The computational study underscores the importance of integrating the inventory and vehicle routing decisions. Graphical presentation formats are provided to convey meaningful insights into the problem.

A Two-phase Solution Algorithm for the Inventory Routing Problem with Time Windows