2010
DOI: 10.1016/j.cie.2009.11.010
|View full text |Cite
|
Sign up to set email alerts
|

Minimum cost path location for maximum traffic capture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…Branch-and-cut method is one of the most effective precision algorithms used to solve such problems. (Gutiérrez-Jarpa et al 2010 ) The algorithm framework is primarily based on the boundary-branching and plane-cutting algorithms. Upper and lower boundaries, as well as effective and enhanced boundaries in equations, are added to improve solution efficiency.…”
Section: Case Studymentioning
confidence: 99%
“…Branch-and-cut method is one of the most effective precision algorithms used to solve such problems. (Gutiérrez-Jarpa et al 2010 ) The algorithm framework is primarily based on the boundary-branching and plane-cutting algorithms. Upper and lower boundaries, as well as effective and enhanced boundaries in equations, are added to improve solution efficiency.…”
Section: Case Studymentioning
confidence: 99%
“…The problems related with the optimisation of collecting and delivering routes are of great importance for the efficient distribution and operation of transport companies. In a number of studies are presented algorithms for improved routing of the vehicles involved in the supply and distribution, most of which are based on the criterion of the lowest cost [5,8,7]. Other methods also exist, which try to offer fast real-time decision-making, at the cost of some inaccuracy [11] or optimising the postal transportation network with respect to planned road infrastructure [10].…”
Section: Introductionmentioning
confidence: 99%