﻿ A hybrid metaheuristic algorithm for solving a rollon–rolloff waste collection vehicle routing problem considering waste separation and recycling center

# A hybrid metaheuristic algorithm for solving a rollon–rolloff waste collection vehicle routing problem considering waste separation and recycling center

##### نویسندگان
• F. Haeri Tabrizi Department of Industrial Engineering, College of Engineering, University of Tehran
• H. Farrokhi-Asl Department of Industrial Engineering, Iran University of Science & Technology, Tehran
• M. Rabbani Department of Industrial Engineering, College of Engineering, University of Tehran
##### چکیده

This paper addresses a rollon&ndash;rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers&rsquo; locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling center site is also added to the collection network based on which 10 trip types are defined. The problem aims to determine the optimal routes for minimizing the total distance traveled by vehicles resulting in a decrease in service time and cost. An initial solution is first generated by a heuristic algorithm and then, a hybrid meta-heuristic solution involving simulated annealing (SA) algorithm and hybrid SA and local search algorithm is proposed to tackle the problem. The data of the problem which is categorized into 12 classes are first generated randomly. Then, a straightforward solution representation is presented to encode the problem. The final generated results, the degree of their improvement and their computation time are compared with each other. Finally, conclusion remarks and future research directions are provided

برای دانلود باید عضویت طلایی داشته باشید

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

## Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan

Collection of waste is an important logistic activity within any city. In this study, a mathematical model is proposed in order to reduce the cost of waste collection. First a mixed-integer nonlinear programming model is provided including a waste collection routing problem, so that, there is a balance between the distance between trashcans, and the similarity of the trashcans in terms of th...

متن کامل

## Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application

The urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. Also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). In fact, making slight improvements in this issue lead to a huge saving in municipal consumption. Some inci...

متن کامل

## A hybrid metaheuristic algorithm for the robust pollution-routing problem

Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...

متن کامل

## A Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...

متن کامل

## solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: a waste collection application

the urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). in fact, making slight improvements in this issue lead to a huge saving in municipal consumption. some inci...

متن کامل

## A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM

The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...

متن کامل

ذخیره در منابع من

ذخیره شده در منابع من

{@ msg_add @}

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی راحت تر خواهید کرد

دانلود متن کامل

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 6  شماره None

صفحات  19- 31

تاریخ انتشار 2016-06

{@ msg @}

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2021