Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   JOURNAL OF TRANSPORTATION RESEARCH   SPRING 2010 , Volume 7 , Number 1 (22); Page(s) 95 To 101.
 
Paper: 

A VEHICLE ROUTING PROBLEM AND DETERMINATION OF GARBAGE COLLECTORS BY A META-HEURISTIC METHOD: A CASE STUDY

 
 
Author(s):  MAHDAVI I.*, TAVAKOLI MOGHADAM R., GHAZIZADEH HASHEMI S.M.
 
* DEPARTMENT OF INDUSTRIAL ENGINEERING, MAZANDARAN UNIVERSITY OF SCIENCE AND TECHNOLOGY, BABOL, IRAN
 
Abstract: 

This paper presents a linear integer programming model for a capacitated backhaul vehicle routing problem with time window (CVRPBTW) that minimizes the fleet cost and total traveled or the duration of the tours. We consider a heterogeneous fixed fleet with a fixed number of vehicles for each type (class). It is shown that the presented model enables to establish routes to serve all given customers (i.e., nodes) by the minimum number of vehicles with the maximum capacity used and minimum duration. This model is solved by a hybrid simulated annealing (HSA) method, in which is able to find very good solutions in a reasonable amount of time. A number of test problems in a small and large size are solved, and the computational results are reported in this paper. We investigate the performance of the proposed method in a real case. The input data are collected from waste and garbage collection industries for specified areas in Tehran.

 
Keyword(s): CAPACITATED VEHICLE ROUTING PROBLEM, BACKHAULS, TIME WINDOW, WASTE MANAGEMENT, HYBRID SIMULATED ANNEALING
 
References: 
  • ندارد
 
  Persian Abstract Yearly Visit 69
 
Latest on Blog
Enter SID Blog