Generalized vehicle routing problem: Contemporary trends and research directions.

Ali Aghadavoudi Jolfaei, Mahdi Alinaghian, Roghayeh Bahrami, Erfan Babaee Tirkolaee

Abstract read

In one paragraph

Article in Heliyon, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it

0cells of the map it votes in

0citing papers in PubMed

–field-weighted citation impact

1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Ali Aghadavoudi JolfaeiDepartment of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran.

Mahdi AlinaghianDepartment of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran.

Roghayeh BahramiDepartment of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran.

Erfan Babaee TirkolaeeDepartment of Industrial Engineering, Istinye University, Istanbul, Turkey.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Generalized Vehicle Routing Problem (GVRP) is a challenging operational research problem which has been widely studied for nearly two decades. In this problem, it is assumed that graph nodes are grouped into a number of clusters, and serving any node of a cluster eliminates the need to visit the other nodes of that cluster. The general objective of this problem is to find the set of nodes to visit and determine the service sequence to minimize the total traveling cost. In addition to these general conditions, GVRP can be formulated with different assumptions and constraints to practically create different sub-types and variants. This paper aims to provide a comprehensive survey of the GVRP literature and explore its various dimensions. It first encompasses the definition of GVRP, similar problems, mathematical models, classification of different variants and solution methods developed for GVRPs, and practical implications. Finally, some useful suggestions are discussed to extend the problem. For this review study, Google Scholar, Scopus, Science Direct, Emerald, Springer, and Elsevier databases were searched for keywords, and 160 potential articles were extracted, and eventually, 45 articles were judged to be relevant.

Indexed as

Generalized vehicle routing problemMathematical modelRoaming delivery locationSolution methodTraveling salesman problem

Identifiers

PMID38125529

DOI10.1016/j.heliyon.2023.e22733

PMCPMC10731084

What OpenQuestion holds

Textmetadata

LicenceCC BY-NC-ND

Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.