Dynamic vehicle routing: Status and prospects

Psaraftis, Harilaos N.

doi:10.1007/bf02098286

Cited by 403 publications

(165 citation statements)

References 32 publications

Supporting

Mentioning

157

Contrasting

Unclassified

Order By: Relevance

“…As explained by Psaraftis (1995), a problem is dynamic if some of the problem inputs are not known beforehand but are revealed as time goes by. In these conditions, the decision maker must solve the problem in a sequential fashion by gradually adapting the solution to the new information.…”

Section: Review Of the Literaturementioning

confidence: 99%

“…Dynamic vehicle routing problems have received significant attention in the literature as witnessed by the surveys of Psaraftis (1988Psaraftis ( , 1995 and Ghiani et al (2003). An important variant of dynamic vehicle routing is the dynamic pickup and delivery problem (DPDP) which arises, for example, in the management of urban courier services.…”

Section: Review Of the Literaturementioning

confidence: 99%

See 1 more Smart Citation

Heuristics for dynamic and stochastic routing in industrial shipping

Tirado

Hvattum

Fagerholt

et al. 2013

Computers & Operations Research

View full text Add to dashboard Cite

Section: Review Of the Literaturementioning

confidence: 99%

Section: Review Of the Literaturementioning

confidence: 99%

Heuristics for dynamic and stochastic routing in industrial shipping

Tirado

Hvattum

Fagerholt

et al. 2013

Computers & Operations Research

View full text Add to dashboard Cite

“…A comprehensive discussion of dynamic vehicle routing can be found in Psaraftis (1988), andPsaraftis (1995). Dynamic real-life problems often require rich models, in most of the literature on dynamic routing problems, however, some simplifying assumptions are made.…”

Section: Related Workmentioning

confidence: 99%

A General Vehicle Routing Problem

Goel¹,

Gruhn²

2008

European Journal of Operational Research

110

View full text Add to dashboard Cite

In this paper, we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined load acceptance and generalised vehicle routing problem. Among the real-life requirements are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, orders with multiple pickup, delivery and service locations, different start and end locations for vehicles, and route restrictions for vehicles. The GVRP is highly constrained and the search space is likely to contain many solutions such that it is impossible to go from one solution to another using a single neighbourhood structure. Therefore, we propose iterative improvement approaches based on the idea of changing the neighbourhood structure during the search.

show abstract

“…However, only previous studies that are directly related to "dynamic dispatching" will be introduced. Psaraftis (1988Psaraftis ( , 1995 explained the unique properties of "dynamic" vehicle-routing problems, which are different from those of static vehicle-routing problems, and illustrated various examples of real problems of the dynamic problems. It should be noted that the dispatching problem in this study can be considered as a vehicle-routing problem in a broad sense and deals with a dynamic situation.…”

Section: Introductionmentioning

confidence: 99%

An Auction-Based Dispatching Method for an Electronic Brokerage of Truckload Vehicles

Lee¹,

Kim²

2015

Industrial Engineering and Management Systems

View full text Add to dashboard Cite

This study suggests an electronic brokerage system that has the capability of efficiently matching dispatching delivery tasks with trucks. In the brokerage system, individual truck drivers and shippers are allowed to participate in the dispatching process through the internet or wireless communication. An auction-based dispatching method for the electronic brokerage system is suggested. The basic rationale of the auction-based dispatching method-which is a distributed decision-making process-is discussed. The performance of the suggested algorithms is evaluated by a simulation study.

show abstract

Dynamic vehicle routing: Status and prospects

Cited by 403 publications

References 32 publications

Heuristics for dynamic and stochastic routing in industrial shipping

Heuristics for dynamic and stochastic routing in industrial shipping

A General Vehicle Routing Problem

An Auction-Based Dispatching Method for an Electronic Brokerage of Truckload Vehicles

Contact Info

Product

Resources

About