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 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 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 Penentuan Rute Distribusi Menggunakan Model Integer Linear Programming dengan Metode Branch and Bound

2020 ◽  
Vol 1 (01) ◽  
pp. 69-79
Author(s):  
Gratia Melina Sari ◽  
Rainisa Maini Heryanto ◽  
Santoso Santoso
Keyword(s):  
Linear Programming ◽  
Vehicle Routing ◽  
Branch And Bound ◽  
Integer Linear Programming ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

Biaya distribusi merupakan biaya yang dapat diminimalisasi perusahaan. Biaya distribusi dalam jaringan distribusi memiliki kontribusi 10% sampai 20% dari biaya akhir barang. Salah satu cara untuk meminimalisasi biaya distribusi adalah menentukan rute distribusi yang optimal yang memberikan total biaya minimum. Penelitian ini membahas penentuan rute distribusi menggunakan model Integer Linear Programming untuk menyelesaikan masalah Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). Metode yang digunakan untuk memecahkan masalah adalah Branch and Bound dengan bantuan MATLAB. Model matematis yang digunakan adalah model matematis total biaya perjalanan. Studi kasus yang digunakan dalam perhitungan adalah PT XYZ, perusahaan manufaktur cat yang melakukanpendistribusian produk dari gudang ke konsumen. Saat ini, kebijakan pemesanan dan pengiriman perusahaan membuat biaya distribusi tidak efisien dan terjadi gagal pengiriman. Penelitian ini memberikan 2 skenario usulan pengiriman. Pada skenario 1, pengiriman dilakukan sesuai dengan kebijakan pada perusahaan saat ini dengan mencari biaya optimal.Pada skenario 2, permintaan akan dikumpulkan pada hari Jumat dan pengiriman akan dilakukan pada minggu berikutnya. Dari hasil perhitungan didapatkan total biaya per bulan pada rute aktual perusahaan adalah Rp. 1.349.053,49 sedangkan skenario 1 memberikan hasil Rp. 1.067.207,73 (penghematan 20,89%) dan skenario 2 memberikan hasil Rp. 602.105,21(penghematan 55,37%). Kata kunci: Biaya; Branch and Bound; CVRPTW; Distribusi; Integer Linear Programming;Rute

scholarly journals A model for the time dependent vehicle routing problem with time windows under traffic conditions with intelligent travel times

2021 ◽  
Author(s):  
Saeed Khanchehzarrin ◽  
Maral Shahmizad ◽  
Iraj Mahdavi ◽  
Nezam Mahdavi-Amiri ◽  
Peiman Ghasemi
Keyword(s):  
Travel Time ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
Time Windows ◽  
Time Dependent ◽  
Mixed Integer ◽  
Travel Times ◽  
Routing Problem ◽  
Traffic Conditions

A new mixed-integer nonlinear programming model is presented for the time-dependent vehicle routing problem with time windows and intelligent travel times. The aim is to minimize fixed and variable costs, with the assumption that the travel time between any two nodes depends on traffic conditions and is considered to be a function of vehicle departure time. Depending on working hours, the route between any two nodes has a unique traffic parameter. We consider each working day to be divided into several equal and large intervals, termed as a scenario. Here, allowing for long distances between some of the nodes, travel time may take more than one scenario, resulting in resetting the scenario at the start of each large interval. This repetition of scenarios has been used in modeling and calculating travel time. A tabu search optimization algorithm is devised for solving large problems. Also, after linearization, a number of random instances are generated and solved by the CPLEX solver of GAMS to assess the effectiveness of our proposed algorithm. Results indicate that the initial travel time is estimated appropriately and updated properly in accordance with to the repeating traffic conditions.

Sign in / Sign up

Export Citation Format

Share Document