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

The non-fixed destination multi-depot multiple traveling salesmen problem (MmTSP) is a generalization of well-known MTSP with several salesmen in each depot. In this research, time window is defined for each depot (city).the salesmen only can service the customers within these time windows and also some penalties are considered for any deviation of start time. The objective function of problem is to minimize the total costs and penalties of the tours. This problem is of a great complexity and belongs to NP-complete class of problems. So the exact algorithms cannot perform the best solution in problems with big dimension. So Meta heuristics algorithm is used to solve these problems efficiently. In this research we used hybrid simulated annealing and genetic algorithms.

journal of mathematics and computer science

Using A Hybrid Simulated Annealing And Genetic Algorithms For Non Fixed Destination Multi-depot Multiple Traveling Salesmen Problem With Time Window And Waiting Penalty