A new mathematical model of vehicle routing problem based on milk-run

The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP), in which we are looking for an optimal set of delivery or collection routes from a given depot to a number of customers divided into predefined, mutually exclusive, and exhaustive clusters, visiting exactly one customer from each cluster and fulfilling the capacity restrictions. This paper deals with a more generic version of the GVRP, introduced recently and called Selective Vehicle Routing Problem (SVRP). This problem generalizes the GVRP in the sense that the customers are divided into clusters, but they may belong to one or more clusters. The aim of this work is to describe a novel mixed integer programming based mathematical model of the SVRP. To validate the consistency of the novel mathematical model, a comparison between the proposed model and the existing models from literature is performed, on the existing benchmark instances for SVRP and on a set of additional benchmark instances used in the case of GVRP and adapted for SVRP. The proposed model showed better results against the existing models.

Download Full-text

A mathematical model for vehicle routing problem under endogenous uncertainty

International Journal of Production Research ◽

10.1080/00207543.2015.1057625 ◽

2015 ◽

Vol 54 (2) ◽

pp. 579-590 ◽

Cited By ~ 8

Author(s):

F. Hooshmand Khaligh ◽

S.A. MirHassani

Keyword(s):

Mathematical Model ◽

Vehicle Routing ◽

Vehicle Routing Problem ◽

Routing Problem ◽

Endogenous Uncertainty

Download Full-text

Mutation Ant Colony Algorithm of Milk-Run Vehicle Routing Problem with Fastest Completion Time Based on Dynamic Optimization

Discrete Dynamics in Nature and Society ◽

10.1155/2013/418436 ◽

2013 ◽

Vol 2013 ◽

pp. 1-6 ◽

Cited By ~ 6

Author(s):

Jianhua Ma ◽

Guohua Sun

Keyword(s):

Vehicle Routing ◽

Dynamic Optimization ◽

Vehicle Routing Problem ◽

Completion Time ◽

Ant Colony Algorithm ◽

Ant Colony ◽

Routing Problem ◽

Numerical Examples ◽

Customer Order ◽

Milk Run

The objective of vehicle routing problem is usually to minimize the total traveling distance or cost. But in practice, there are a lot of problems needed to minimize the fastest completion time. The milk-run vehicle routing problem (MRVRP) is widely used in milk-run distribution. The mutation ACO is given to solve MRVRP with fastest completion time in this paper. The milk-run VRP with fastest completion time is introduced first, and then the customer division method based on dynamic optimization and split algorithm is given to transform this problem into finding the optimal customer order. At last the mutation ACO is given and the numerical examples verify the effectiveness of the algorithm.

Download Full-text

A A Multi-Objective Mathematical Model for Vehicle Routing Problem Considering the Time Window and Economic and Environmental Objectives Using the Metaheuristic Algorithm Based on Pareto Archive

Logistics & Supply Chain Review ◽

10.38157/logistics-supply-chain-review.v1i1.158 ◽

2020 ◽

Vol 1 (1) ◽

pp. 58-68

Author(s):

Elnaz Asadifard ◽

Maryam Adlifard ◽

Mohammad Taghipour ◽

Nader Shamami

Keyword(s):

Mathematical Model ◽

Vehicle Routing ◽

Vehicle Routing Problem ◽

Time Window ◽

Fixed Costs ◽

Metaheuristic Algorithm ◽

Routing Problem ◽

Total Distance ◽

Environmental Objectives ◽

Single Objective

Purpose: The purpose of this study is the well-known Heterogeneous Fleet Vehicle Routing Problem (HVRP) is one of the developed problems of vehicle routing, which involves optimizing a set of routes for a fleet of vehicles with different costs and capacities. Methods: HVRP is usually modeled as a single objective that aims to minimize overall transportation costs (total fixed costs and costs commensurate with total distance). Results: These vehicles are located in the central depot and serve customers’ demands. Implications: In this case, the number of vehicles available (of any type) may be limited.

Download Full-text

Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study

Production Engineering Archives ◽

10.30657/pea.2020.26.31 ◽

2020 ◽

Vol 26 (4) ◽

pp. 174-184

Author(s):

Thi Diem Chau Le ◽

Duy Duc Nguyen ◽

Judit Oláh ◽

Miklós Pakurár

Keyword(s):

Mathematical Model ◽

Simulated Annealing ◽

Vehicle Routing ◽

Vehicle Routing Problem ◽

Time Windows ◽

Distribution Networks ◽

Mixed Integer ◽

Vehicle Group ◽

Real Problem ◽

Routing Problem

AbstractThis study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, our study also evaluates both the quality of solutions and the time to find optimal solutions to select the best suitable algorithm for the real problem mentioned above. A novel mathematical model is formulated by OR tools for Python. Compared to the current solution, our results reduced total costs by 18%, increased the proportion of orders completed by internal vehicles (84%), and the proportion of orders delivered on time (100%). Our study provides a mathematical model with time constraints and large job volumes for a complex distribution network in reality. The proposed mathematical model provides effective solutions for making decisions at logistics companies. Furthermore, our study emphasizes that simulated annealing is a more suitable algorithm than the two others for this vehicle routing problem.

Download Full-text

DIESEL SUPPLY PLANNING FOR OFFSHORE PLATFORMS BY A MATHEMATICAL MODEL BASED ON THE VEHICLE ROUTING PROBLEM WITH REPLENISHMENT

Libro de Actas CIT2016. XII Congreso de Ingeniería del Transporte ◽

10.4995/cit2016.2016.2217 ◽

2016 ◽

Author(s):

Rodrigo De Alvarenga Rosa ◽

Henrique Fiorot Astoures ◽

André Silva Rosa

Keyword(s):

Mathematical Model ◽

Vehicle Routing ◽

Vehicle Routing Problem ◽

Oil And Gas ◽

Offshore Platforms ◽

Oil Exploration ◽

Routing Problem ◽

Model Based ◽

Supply Planning ◽

The Mathematical Model

Oil exploration in Brazil is mainly held by offshore platforms which require the supply of several products, including diesel to maintain its engines. One strategy to supply diesel to the platforms is to keep a vessel filled with diesel nearby the exploration basin. An empty boat leaves the port and goes directly to this vessel, then it is loaded with diesel. After that, it makes a trip to supply the platforms and when the boat is empty, it returns to the vessel to be reloaded with more diesel going to another trip. Based on this description, this paper proposes a mathematical model based on the Vehicle Routing Problem with Intermediate Replenishment Facilities (VRPIRF) to solve the problem. The purpose of the model is to plan the routes for the boats to meet the diesel requests of the platform. Given the fact that in the literature, papers about the VRPIRF are scarce and papers about the VRPIRF applied to offshore platforms were not found in the published papers, this paper is important to contribute with the evolution of this class of problem, bringing also a solution for a real application that is very important for the oil and gas business. The mathematical model was tested using the CPLEX 12.6. In order to assess the mathematical model, tests were done with data from the major Brazilian oil and gas company and several strategies were tested.DOI: http://dx.doi.org/10.4995/CIT2016.2016.2217

Download Full-text