2017
DOI: 10.1016/j.ejor.2016.12.017
|View full text |Cite
|
Sign up to set email alerts
|

The Traveling Purchaser Problem and its variants

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
4

Relationship

3
7

Authors

Journals

citations
Cited by 59 publications
(32 citation statements)
references
References 58 publications
0
32
0
Order By: Relevance
“…The efficiency in finding several alternative solutions is one of the most important added values of the SYNCHRO-NET planner. Thanks to the developed optimization routines and algorithms for routing problems [18,19], the system is able to combine possible routes from a database containing hundred thousands of services and to elaborate optimal complete itineraries. In particular, given an origin and a destination point, the underlying optimization problem resorts to a variant of the well-known Shortest Path Problem (SPP), in which:…”
Section: Basic Optimization Functionalitiesmentioning
confidence: 99%
“…The efficiency in finding several alternative solutions is one of the most important added values of the SYNCHRO-NET planner. Thanks to the developed optimization routines and algorithms for routing problems [18,19], the system is able to combine possible routes from a database containing hundred thousands of services and to elaborate optimal complete itineraries. In particular, given an origin and a destination point, the underlying optimization problem resorts to a variant of the well-known Shortest Path Problem (SPP), in which:…”
Section: Basic Optimization Functionalitiesmentioning
confidence: 99%
“…A TQD extension including transportation costs based on truckload shipping rates in also presented Mansini et al (2012). Interesting enough, the TQD policy is considered also in some routing problems for inbound and outbound logistics (Nguyen et al, 2014, Manerba et al, 2017b.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Normally, when cost is minimum, then minimum risk is not possible always. Few approaches, "Constraint guided search for aircraft sequencing" [13], "The Traveling Purchaser Problem and its variants" [9], "A Modified Genetic Algorithm for solving uncertain Constrained Solid Travelling Salesman Problems" [8], etc. Practically the use of CTSP is applicable when the number of nodes is large or very large.…”
Section: Introductionmentioning
confidence: 99%