Cooperative vehicle routing problem: an opportunity for cost saving

Authors

  • Ashkan Hafezalkotob Industrial Engineering College, Islamic Azad University, South Tehran Branch, Entezari Alley, Oskoui Alley, Choobi Bridge, Tehran, 11518-63411, Iran
  • Sedighe Zibaei Industrial Engineering College, Islamic Azad University, South Tehran Branch, Entezari Alley, Oskoui Alley, Choobi Bridge, Tehran, 11518-63411, Iran
  • Seyed Sajad Ghashami Department of Manufacturing and Industrial Engineering, Faculty of Mechanical Engineering, University Teknologi Malaysia (UTM), 81310, Skudai, Malaysia
Abstract:

In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost saving allocations which are obtained from various coalitions of owners. The methodology is illustrated with a numerical example in which different coalitions of the players are evaluated along with the results of cooperation and cost saving allocation methods.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

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...

full text

A cooperative parallel metaheuristic for the capacitated vehicle routing problem

This paper introduces a cooperative parallel metaheuristic for solving the capacitated vehicle routing problem. The proposed metaheuristic consists of multiple parallel tabu search threads that cooperate by asynchronously exchanging best found solutions through a common solution pool. The solutions sent to the pool are clustered according to their similarities. The search history information id...

full text

Vehicle Routing Problem Vehicle Routing Problem

ing and non-profit use of the material is permitted with credit to the source. Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published articles. Publisher assumes no responsibility liability for any damage or injury to...

full text

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...

full text

Proposing a Constrained-GSA for the Vehicle Routing Problem

In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...

full text

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 12  issue 3

pages  -

publication date 2016-09-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023