different versions of the savings method for the time limited vehicle routing problem

Clicks: 250
ID: 169572
2012
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #171 of 391 articles by views in Talanta

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 391 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main difference is that the routes are paths (not cycles), i.e. vehicles do not return to the central city (or at least we do not observe their way back). Costs are given for the straight routes between each pair of the cities and represent the time necessary for going through. Each path must not exceed a given time limit. The sum of times for all routes is to be minimized.This problem is NP-hard. There are many various possibilities how to design the heuristics (approximation methods) to solve it. One of the ways of how to obtain an approximation method for the TLVRP is to modify the famous savings method by Clark and Wright (1964) for this purpose. In this paper we suggest several different versions of this method, test them in some instances, and evaluate and mutually compare the results of individual versions.
Reference Key
kuera2012actadifferent Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Petr Kučera
Journal Talanta
Year 2012
DOI
10.11118/actaun201260070171
URL
https://acta.mendelu.cz/60/7/0171/
Keywords
traveling salesman problem vehicle routing problem savings methodagriculturebiology (general)

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.