Multi-Compartment Vehicle Routing Problem to Find the Alternative Distribution Route of Petroleum Product Delivery

The aim of this chapter is about the inclusion of real world scenarios, viewed as a Generalized Vehicle Routing Problem (GVRP) model problem, and treated by bio inspired algorithms in order to find optimum routing of product delivery. GVRP is the generalization of the classical Vehicle Routing Problem (VRP) that is well known NP-hard as generalized combinatorial optimization problem with a number of real world applications and a variety of different versions. Due to its complexity, large instances of VRP are hard to solve using exact methods. Thus a solution by a soft computing technique is desired. From a methodological standpoint, the chapter includes four bio inspired algorithms, ant colony optimization and firefly. From an application standpoint, several factors of the generalized vehicle routing are considered from a real world scenario.

Download Full-text

A combined order selection and time-dependent vehicle routing problem with time widows for perishable product delivery

Computers & Industrial Engineering ◽

10.1016/j.cie.2017.10.010 ◽

2017 ◽

Vol 114 ◽

pp. 101-113 ◽

Cited By ~ 14

Author(s):

Zu-Jun Ma ◽

Yao Wu ◽

Ying Dai

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Time Dependent ◽

Order Selection ◽

Routing Problem ◽

Perishable Product ◽

Product Delivery

Download Full-text

Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem

PROMET - Traffic&Transportation ◽

10.7307/ptt.v26i1.1478 ◽

1970 ◽

Vol 26 (1) ◽

pp. 1-10 ◽

Cited By ~ 3

Author(s):

Baozhen Yao ◽

Ping Hu ◽

Mingheng Zhang ◽

Xiaomei Tian

Keyword(s):

Ant Colony Optimization ◽

Vehicle Routing ◽

Vehicle Routing Problem ◽

Real Life ◽

Ant Colony ◽

Routing Problem ◽

Open Vehicle Routing Problem ◽

Product Delivery ◽

Seafood Product ◽

Open Vehicle Routing

This paper deals with a real-life vehicle delivery routing problem, which is a seafood product delivery routing problem. Considering the features of the seafood product delivery routing problem, this paper formulated this problem as a multi-depot open vehicle routing problem. Since the multi-depot open vehicle routing problem is a very complex problem, a method is used to reduce the complexity of the problem by changing the multi-depot open vehicle routing problem into an open vehicle routing problem with a dummy central depot in this paper. Then, ant colony optimization is used to solve the problem. To improve the performance of the algorithm, crossover operation and some adaptive strategies are used. Finally, the computational results for the benchmark problems of the multi-depot vehicle routing problem indicate that the proposed ant colony optimization is an effective method to solve the multi-depot vehicle routing problem. Furthermore, the computation results of the seafood product delivery problem from Dalian, China also suggest that the proposed ant colony optimization is feasible to solve the seafood product delivery routing problem.

Download Full-text

One Vehicle Routing Problem as the Best Solution for a Hangout Catering Company Expansion Plan with Lingo Software

Faktor Exacta ◽

10.30998/faktorexacta.v13i4.7540 ◽

2021 ◽

Vol 13 (4) ◽

pp. 216

Author(s):

Mohammad Riski Borman ◽

Mirani Oktavia

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Routing Problem ◽

The Future ◽

Expansion Plan ◽

Marketing Area ◽

Product Delivery ◽

The Will ◽

Product Marketing

Every company that has a desire to expand its working area or can be termed an expansion plan is an indication that the company has the will to continue and develop as well as proof that the company has good business prospects in the future. There are many things that can be done in an expansion effort for the company, including expanding the product marketing area. The expansion of the product marketing area will make the company face the problem of determining the route of product delivery so that it reaches all customers who are expected to pass the shortest mileage. In this studied, we examined the routes that the Hangout Catering Company had to take in order to obtain the best touring to reach the ten places that were expansion targets with three operating scenarios based on the number of vehicles used. The solution to this problem is obtained with the help of Lingo software.

Download Full-text