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

Vehicle Routing Problem is a well-known problem in logistics andtransportation, and the variety of such problems is explained by the fact thatit occurs in many real-life situations. It is an NP-hard combinatorialoptimization problem and finding an exact optimal solution is practicallyimpossible. In this work, Site-Dependent Truck and Trailer Routing Problem withhard and soft Time Windows and Split Deliveries is considered (SDTTRPTWSD). Inthis article, we develop a heuristic with the elements of Tabu Search forsolving SDTTRPTWSD. The heuristic uses the concept of neighborhoods and visitsinfeasible solutions during the search. A greedy heuristic is applied toconstruct an initial solution.

Heuristic with elements of tabu search for Truck and Trailer Routing Problem