2016
DOI: 10.1109/tvt.2015.2480964
|View full text |Cite
|
Sign up to set email alerts
|

Improving the Efficiency of Stochastic Vehicle Routing: A Partial Lagrange Multiplier Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 56 publications
(26 citation statements)
references
References 30 publications
0
26
0
Order By: Relevance
“…However, if we can convert our problem to a linear program (LP) without loss of precision, we can solve it in polynomial time. In this section we introduce the partial Lagrange multiplier method [36], which solves a sequence of LPs with at worst a polynomial number of steps.…”
Section: Partial Lagrange Multiplier Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…However, if we can convert our problem to a linear program (LP) without loss of precision, we can solve it in polynomial time. In this section we introduce the partial Lagrange multiplier method [36], which solves a sequence of LPs with at worst a polynomial number of steps.…”
Section: Partial Lagrange Multiplier Methodsmentioning
confidence: 99%
“…This proof is given in Appendix B due to space constraints. Since we have proved that g( λ) is concave, we can assume that ∇g( λ) ≤ G, where G is a value that we define in (35) and (36). Further, each individual Lagrange multiplier value, denoted by λ i , is bounded above, as well as by the defined bound of λ i ≥ 0.…”
Section: Proof Of Convergencementioning
confidence: 99%
See 1 more Smart Citation
“…It is recognized that, if + = 1, then () = ( ′ ). By using the Lagrangian multiplier method 34 for relaxing the constraint in (22), the problem  ′ is relaxed as follows: where i j is the Lagrangian multiplier for the constraint x i j = y i j . The Lagrangian relaxation ( ) can be separated into two problems.…”
Section: Joint Energy and Latency Optimizationmentioning
confidence: 99%
“…Zhao et al propose an offensive strategy based on a virtual tangent circle for robotic fish competition [7]; Gao et al propose a method for path planning of robotic fish balls based on fuzzy logic and geometry [8]; Xie et al propose fuzzy control based steering control algorithm [9]. Guo et al propose several path finding and path planning methods for smart agents, which consider the criterion of 'faster' or 'arriving on tome' in the route optimization [10][11][12][13][14]. In terms of robustness research, ke haokang also proposed the corresponding stability path planning strategy [15].…”
Section: Introductionmentioning
confidence: 99%