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

Stochastic single vehicle routing problem with delivery and pick up and a predefined customer sequence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 36 publications
(10 citation statements)
references
References 12 publications
0
10
0
Order By: Relevance
“…However, multiple vehicles, vehicle capacities, tour-length restrictions, and delivery and pickup time windows among others complicate the planning of transportation and distribution operations in global logistics network . Analytics methodologies and techniques are used to optimize the routing of goods, vehicles, as well as crew (Novoa and Stoner, 2009;Lei et al, 2011;Minis and Tatarakis, 2011) in order to balance between transportation costs and margins, and pay attention to maintenance and safety.…”
Section: Logisticsmentioning
confidence: 99%
“…However, multiple vehicles, vehicle capacities, tour-length restrictions, and delivery and pickup time windows among others complicate the planning of transportation and distribution operations in global logistics network . Analytics methodologies and techniques are used to optimize the routing of goods, vehicles, as well as crew (Novoa and Stoner, 2009;Lei et al, 2011;Minis and Tatarakis, 2011) in order to balance between transportation costs and margins, and pay attention to maintenance and safety.…”
Section: Logisticsmentioning
confidence: 99%
“…The following methods were found: branch and cut algorithm (5 papers) [14][15][16][17][18]; branch and price algorithm (2 papers) [19,20]; branch and bound algorithm (1 paper), [21] dynamic programming (5 papers) [22][23][24][25][26]; mixed integer linear programming (5 papers) [27][28][29][30][31]; experiments (1 paper) [32]; column generation scheme (4 papers) [33][34][35][36]; classical theory of programming and graph theory (1 paper) [37].…”
Section: Exact Methodsmentioning
confidence: 99%
“…There are many kinds of VRPs, including MDVRP [II,12], VRPTW [13][14][15], VRP PD [17][18], CVRP (Capacity VRP) [19], etc. [12].…”
Section: Relative Workmentioning
confidence: 99%
“…redefine users' sequence to solve the problem[18].The above researchers put forward their respecti ve solutions to different types of VRP problems. Nevertheless, their methods can only apply to a single scenario.…”
mentioning
confidence: 99%