scholarly journals Mixed Integer Linear Programming Models to Solve a Real-Life Vehicle Routing Problem with Pickup and Delivery

2021 ◽  
Vol 11 (20) ◽  
pp. 9551
Author(s):  
Ali Louati ◽  
Rahma Lahyani ◽  
Abdulaziz Aldaej ◽  
Racem Mellouli ◽  
Muneer Nusir
Keyword(s):  
Linear Programming ◽  
Vehicle Routing ◽  
Integer Linear Programming ◽  
Vehicle Routing Problem ◽  
Mixed Integer Linear Programming ◽  
Real Life ◽  
Mixed Integer ◽  
Pickup And Delivery ◽  
Routing Problem

This paper presents multiple readings to solve a vehicle routing problem with pickup and delivery (VRPPD) based on a real-life case study. Compared to theoretical problems, real-life ones are more difficult to address due to their richness and complexity. To handle multiple points of view in modeling our problem, we developed three different Mixed Integer Linear Programming (MILP) models, where each model covers particular constraints. The suggested models are designed for a mega poultry company in Tunisia, called CHAHIA. Our mission was to develop a prototype for CHAHIA that helps decision-makers find the best path for simultaneously delivering the company’s products and collecting the empty boxes. Based on data provided by CHAHIA, we conducted computational experiments, which have shown interesting and promising results.

scholarly journals A mixed-integer linear programming model for the selective full-truckload multi-depot vehicle routing problem with time windows

2021 ◽  
Vol 10 (4) ◽  
pp. 471-486 ◽  
Author(s):  
Karim EL Bouyahyiouy ◽  
Adil Bellabdaoui
Keyword(s):  
Linear Programming ◽  
Vehicle Routing ◽  
Integer Linear Programming ◽  
Vehicle Routing Problem ◽  
Mixed Integer Linear Programming ◽  
Programming Model ◽  
Time Windows ◽  
Mixed Integer ◽  
Data Set ◽  
Routing Problem

This article has studied a full truckload transportation problem in the context of an empty return scenario, particularly an order selection and vehicle routing problem with full truckload, multiple depots and time windows (SFTMDVRPTW). The aim is to develop a solution where a set of truck routes serves a subset of selected transportation demands from a number of full truckload orders to maximize the total profit obtained from those orders. Each truck route is a chain of selected demands to serve, originating at a departure point and terminating at an arriving point of trucks in a way that respects the constraints of availability and time windows. It is not mandatory to serve all orders, and only the profitable ones are selected. In this study, we have formulated the SFTMDVRPTW as a mixed-integer linear programming (MILP) model. Finally, Computational results are conducted on a new data set that contains thirty randomly generated problem instances ranging from 16 to 30 orders using the CPLEX software. The findings prove that our model has provided good solutions in a reasonable time.

scholarly journals Analysis of Mixed-Integer Linear Programming Formulations for a Fuel-Constrained Multiple Vehicle Routing Problem

2017 ◽  
Vol 05 (04) ◽  
pp. 197-207 ◽  
Author(s):  
Kaarthik Sundar ◽  
Saravanan Venkatachalam ◽  
Sivakumar Rathinam
Keyword(s):  
Linear Programming ◽  
Vehicle Routing ◽  
Integer Linear Programming ◽  
Vehicle Routing Problem ◽  
Mixed Integer Linear Programming ◽  
Optimal Solution ◽  
Branch And Cut ◽  
Mixed Integer ◽  
Computational Results ◽  
Routing Problem

This paper addresses a fuel-constrained, multiple vehicle routing problem (FCMVRP) in the presence of multiple refueling stations. We are given a set of targets, a set of refueling stations, and a depot where [Formula: see text] vehicles are stationed. The vehicles are allowed to refuel at any refueling station, and the objective of the problem is to determine a route for each vehicle starting and terminating at the depot, such that each target is visited by at least one vehicle, the vehicles never run out of fuel while traversing their routes, and the total travel cost of all the routes is a minimum. We present four new mixed-integer linear programming (MILP) formulations for the problem. These formulations are compared both analytically and empirically, and a branch-and-cut algorithm is developed to compute an optimal solution. Extensive computational results on a large class of test instances that corroborate the effectiveness of the algorithm are also presented.

scholarly journals A Mixed Integer Linear Programming Model for the Optimization of Steel Waste Gases in Cogeneration: A Combined Coke Oven and Converter Gas Case Study

Energies ◽  
2020 ◽  
Vol 13 (15) ◽  
pp. 3781
Author(s):  
Sergio García García ◽  
Vicente Rodríguez Montequín ◽  
Henar Morán Palacios ◽  
Adriano Mones Bayo
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Programming Model ◽  
Coke Oven ◽  
Linear Programming Model ◽  
Mixed Integer ◽  
Integer Linear Programming Model ◽  
Converter Gas

Off-gas is one of the by-products of the steelmaking process. Its potential energy can be transformed into heat and electricity by means of cogeneration. A case study using a coke oven and Linz–Donawitz converter gas is presented. This work addresses the gas allocation problem for a cogeneration system producing steam and electricity. In the studied facility, located in northern Spain, the annual production of the plant requires 95,000 MWh of electrical energy and 525,000 MWh of thermal energy. The installed electrical and thermal power is 20.4 MW and 81 MW, respectively. A mixed integer linear programming model is built to optimize gas allocation, thus maximizing its benefits. This model is applied to a 24-h scenario with real data from the plant, where gas allocation decision-making was performed by the plant operators. Application of the model generated profit in a scenario where there were losses, increasing benefits by 16.9%. A sensitivity analysis is also performed. The proposed model is useful not only from the perspective of daily plant operation but also as a tool to simulate different design scenarios, such as the capacity of gasholders.

Sign in / Sign up

Export Citation Format

Share Document