Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

Belfiore, Patrícia; Yoshizaki, Hugo Tsugunobu Yoshida

doi:10.1016/j.ejor.2008.08.003

Cited by 96 publications

(42 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Authors [40] proposed heuristics and a scatter search (SS) algorithms to solve real-life heterogeneous fleet vehicle routing problem with tim ries (HFVRPTWSD). They proposed two constructive heuristics to generate the initial solutions of SS.…”

Section: Heuristic Approachesmentioning

confidence: 99%

A Survey on the Vehicle Routing Problem and Its Variants

Kumar¹,

Panneerselvam²

2012

IIM

242

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

Section: Heuristic Approachesmentioning

confidence: 99%

A Survey on the Vehicle Routing Problem and Its Variants

Kumar¹,

Panneerselvam²

2012

IIM

242

126

View full text Add to dashboard Cite

show abstract

“…The number of available vehicles could be given or be decision variable [10]. The objective is frequently the minimization of the distances as well as the number of vehicles used while satisfying the demands of the clients [11,12]. Recent studies have allowed the possibility of vehicles traversing different routes [13].…”

Section: Definition Of Cvrpmentioning

confidence: 99%

A New Approach to the Optimization of the CVRP through Genetic Algorithms

Frutos¹,

Tohmé²

2012

AJOR

View full text Add to dashboard Cite

This paper presents a new approach to the analysis of complex distribution problems under capacity constraints. These problems are known in the literature as CVRPs (Capacitated Vehicle Routing Problems). The procedure introduced in this paper optimizes a transformed variant of a CVRP. It starts generating feasible clusters and codifies their ordering. In the next stage the procedure feeds this information into a genetic algorithm for its optimization. This makes the algorithm independent of the constraints and improves its performance. Van Breedam problems have been used to test this technique. While the results obtained are similar to those in other works, the processing times are longer.

show abstract

“…The cargo shipment demand uncertainty enables us to propose a chance constraint for each liner service route which guarantees that the liner service route can satisfy the customers demand at least with a predetermined probability. Similar approaches to the subject can be found in [18][19][20][21]. Finally, in [22], the authors present an inventory model that integrates continuous review with production and distribution for a supply chain involving a pharmaceutical company and a hospital supply chain, and in [23], a study is presented about a thorough study of a local Italian healthcare network.…”

Section: Introductionmentioning

confidence: 99%

Optimal logistics strategy to distribute medicines in clinics and hospitals

Lechuga

2018

J.Math.Industry

View full text Add to dashboard Cite

This document presents a methodology for the optimal selection of the vehicle fleet necessary to distribute medical products from the company's storage center to many intermediate transfer nodes, and from these to a group of public hospitals. The problem addressed is a real case presented by a company that provides logistics services in the Mexican Republic. An algorithm that incorporates three modified mathematical models was designed for its solution. A version of the Dijkstra algorithm was modified for the solution to develop the clustering of nodes (clinics) within the system. A modified version of the model of the traveling salesman generated the routes of the transports and the sequence of distribution of the products. Finally, a model of mixed integer linear programming provided the quantities and characteristics of the transports to buy.

show abstract

Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

Cited by 96 publications

References 30 publications

A Survey on the Vehicle Routing Problem and Its Variants

A Survey on the Vehicle Routing Problem and Its Variants

A New Approach to the Optimization of the CVRP through Genetic Algorithms

Optimal logistics strategy to distribute medicines in clinics and hospitals

Contact Info

Product

Resources

About