Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

Clarke, Graham; Wright, J. W.

doi:10.1287/opre.12.4.568

Cited by 3,075 publications

(960 citation statements)

References 1 publication

Supporting

Mentioning

889

Contrasting

Unclassified

Order By: Relevance

“…It started with the seminal papers of [1,2]. Now, VRP offers a wealth of heuristic and metaheuristic approaches, which are surveyed in the papers of [3][4][5].…”

Section: Introductionmentioning

confidence: 99%

A Survey on the Vehicle Routing Problem and Its Variants

Kumar¹,

Panneerselvam²

2012

IIM

246

126

View full text Add to dashboard Cite

In this paper, we have conducted a literature review on the recent developments and publications involving the vehicle routing problem and its variants, namely vehicle routing problem with time windows (VRPTW) and the capacitated vehicle routing problem (CVRP) and also their variants. The VRP is classified as an NP-hard problem. Hence, the use of exact optimization methods may be difficult to solve these problems in acceptable CPU times, when the problem involves real-world data sets that are very large. The vehicle routing problem comes under combinatorial problem. Hence, to get solutions in determining routes which are realistic and very close to the optimal solution, we use heuristics and meta-heuristics. In this paper we discuss the various exact methods and the heuristics and meta-heuristics used to solve the VRP and its variants.

show abstract

“…It started with the seminal papers of [1,2]. Now, VRP offers a wealth of heuristic and metaheuristic approaches, which are surveyed in the papers of [3][4][5].…”

Section: Introductionmentioning

confidence: 99%

A Survey on the Vehicle Routing Problem and Its Variants

Kumar¹,

Panneerselvam²

2012

IIM

246

126

View full text Add to dashboard Cite

show abstract

“…For the second family, among the route-first cluster-second methods, application of Greedy Algorithms can be found (Chu et al, 2006;Sprenger & Mönch, 2012). Other heuristics are the constructive heuristic, the Clarke and Wright's Saving Algorithm (Clarke & Wright, 1964) is the most famous heuristic. Another more recent example is presented in (Lin, 2011) using constructive heuristic as a step of the broader heuristic proposal.…”

Section: Background and Literature Reviewmentioning

confidence: 99%

A hybrid expert system, clustering and ant colony optimization approach for scheduling and routing problem in courier services

López-Santana¹,

Rodríguez-Vásquez²,

Méndez-Giraldo³

2018

10.5267/j.ijiec

View full text Add to dashboard Cite

This paper focuses on the problem of scheduling and routing workers in a courier service to deliver packages for a set of geographically distributed customers and, on a specific date and time window. The crew of workers has a limited capacity and a time window that represents their labor length. The problem deals with a combination of multiples variants of the vehicle routing problem as capacity, multiple periods, time windows, due dates and distance as constraints. Since in the courier services the demands could be of hundreds or thousands of packages to be delivered, the problem is computationally unmanageable. We present a threephase solution approach. In the first phase, a scheduling model determines the visit date for each customer in the planning horizon by considering the release date, due date to visit and travel times. We use an expert system based on the know-how of the courier service, which uses an inference engine that works as a rule interpreter. In the second phase, a clustering model assigns, for each period, customers to workers according to the travel times, maximum load capacity and customer's time windows. We use a centroid based and sweep algorithms to solve the resulted problem. Finally, in the third phase, a routing model finds the order in which each worker will visit all customers taking into account their time windows and worker's available time. To solve the routing problem we use an Ant Colony Optimization metaheuristic. We present some numerical results using a case study, in which the proposed method of this paper finds better results in comparison with the current method used in the case study.

show abstract

“…The other two heuristics, which are sequential, combine heuristics for both VRP and Location-Allocation problem. The ALA-SAV heuristic is a three stage procedure composed from the Alternate Location Allocation (ALA) presented in Rapp (1962) and the Savings algorithm (SAV) introduced by Clarke and Wright (1964). The third heuristic (SAV-DROP) is also a three stage procedure composed from the Clarke and Wright Savings algorithm and the DROP method (Feldman et al, 1966).…”

Section: Literature Reviewmentioning

confidence: 99%

Vehicle Routing in Multi-Echelon Distribution Systems with Cross-Docking: A Systematic Lexical-Metanarrative Analysis

González-Feliu¹

2013

CIS

View full text Add to dashboard Cite

Multi-echelon distribution systems and more precisely, optimization of LTL routes related to them is one of the most popular subjects in the last 5 years of vehicle routing research. Although a plethora of models, methods and visions is found, it is still difficult to compare them because they use different terminologies and some authors insist on the fact there are a multitude of close but different problems. This paper presents the main concepts of multi-echelon distribution with cross-docks and the notation standards for cost optimization in this field on an attempt of unification, in order to provide a guide to researchers and practitioners. A literature review is first presented, in order to list the main problems and methods that are found in the literature. Then, by a hybrid systematic analysis method combining a lexical and a meta-narrative analysis, the main concepts and standards of multi-echelon based vehicle routing optimization problems are presented. A theoretical model as well as a classification of solving methods, both exact and heuristic, is presented. Finally, research paths are proposed to support both scientists and outbound logistics practitioners.

show abstract

Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

Cited by 3,075 publications

References 1 publication

A Survey on the Vehicle Routing Problem and Its Variants

A Survey on the Vehicle Routing Problem and Its Variants

A hybrid expert system, clustering and ant colony optimization approach for scheduling and routing problem in courier services

Vehicle Routing in Multi-Echelon Distribution Systems with Cross-Docking: A Systematic Lexical-Metanarrative Analysis

Contact Info

Product

Resources

About